./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d63a23585cedb87d2d2ae4c59168b108a64280e1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:01:54,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:01:54,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:01:54,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:01:54,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:01:54,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:01:54,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:01:54,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:01:54,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:01:54,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:01:54,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:01:54,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:01:54,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:01:54,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:01:54,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:01:54,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:01:54,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:01:54,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:01:54,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:01:54,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:01:54,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:01:54,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:01:54,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:01:54,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:01:54,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:01:54,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:01:54,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:01:54,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:01:54,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:01:54,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:01:54,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:01:54,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:01:54,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:01:54,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:01:54,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:01:54,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:01:54,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:01:54,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:01:54,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:01:54,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:01:54,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:01:54,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:01:54,953 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:01:54,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:01:54,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:01:54,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:01:54,958 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:01:54,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:01:54,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:01:54,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:01:54,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:01:54,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:01:54,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:01:54,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:01:54,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:01:54,963 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:01:54,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:01:54,963 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:01:54,964 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:01:54,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:01:54,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:01:54,964 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:01:54,965 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:01:54,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:01:54,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:01:54,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:01:54,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:01:54,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:01:54,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:01:54,967 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:01:54,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d63a23585cedb87d2d2ae4c59168b108a64280e1 [2019-11-28 00:01:55,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:01:55,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:01:55,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:01:55,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:01:55,298 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:01:55,299 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-11-28 00:01:55,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe04dc390/8e040be039ee47e2879616a9833d42ae/FLAG16769c4d4 [2019-11-28 00:01:55,820 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:01:55,824 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-11-28 00:01:55,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe04dc390/8e040be039ee47e2879616a9833d42ae/FLAG16769c4d4 [2019-11-28 00:01:56,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe04dc390/8e040be039ee47e2879616a9833d42ae [2019-11-28 00:01:56,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:01:56,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:01:56,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:01:56,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:01:56,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:01:56,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:01:56" (1/1) ... [2019-11-28 00:01:56,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e799c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:56, skipping insertion in model container [2019-11-28 00:01:56,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:01:56" (1/1) ... [2019-11-28 00:01:56,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:01:56,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:01:56,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:01:56,568 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:01:56,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:01:56,731 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:01:56,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:56 WrapperNode [2019-11-28 00:01:56,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:01:56,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:01:56,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:01:56,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:01:56,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:56" (1/1) ... [2019-11-28 00:01:56,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:56" (1/1) ... [2019-11-28 00:01:56,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:01:56,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:01:56,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:01:56,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:01:56,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:56" (1/1) ... [2019-11-28 00:01:56,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:56" (1/1) ... [2019-11-28 00:01:56,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:56" (1/1) ... [2019-11-28 00:01:56,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:56" (1/1) ... [2019-11-28 00:01:56,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:56" (1/1) ... [2019-11-28 00:01:56,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:56" (1/1) ... [2019-11-28 00:01:56,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:56" (1/1) ... [2019-11-28 00:01:56,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:01:56,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:01:56,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:01:56,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:01:56,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:01:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:01:56,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:01:57,575 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:01:57,575 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:01:57,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:01:57 BoogieIcfgContainer [2019-11-28 00:01:57,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:01:57,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:01:57,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:01:57,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:01:57,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:01:56" (1/3) ... [2019-11-28 00:01:57,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6685a8d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:01:57, skipping insertion in model container [2019-11-28 00:01:57,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:01:56" (2/3) ... [2019-11-28 00:01:57,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6685a8d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:01:57, skipping insertion in model container [2019-11-28 00:01:57,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:01:57" (3/3) ... [2019-11-28 00:01:57,593 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-11-28 00:01:57,604 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:01:57,612 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-28 00:01:57,625 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-28 00:01:57,659 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:01:57,660 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:01:57,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:01:57,660 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:01:57,661 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:01:57,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:01:57,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:01:57,661 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:01:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2019-11-28 00:01:57,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 00:01:57,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:57,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:57,700 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:57,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:57,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2019-11-28 00:01:57,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:57,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017511329] [2019-11-28 00:01:57,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:57,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:57,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017511329] [2019-11-28 00:01:57,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:57,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:01:57,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674540921] [2019-11-28 00:01:57,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:01:57,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:57,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:01:57,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:01:57,907 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 4 states. [2019-11-28 00:01:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:58,234 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2019-11-28 00:01:58,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:01:58,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 00:01:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:58,249 INFO L225 Difference]: With dead ends: 131 [2019-11-28 00:01:58,249 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 00:01:58,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 00:01:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-28 00:01:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-28 00:01:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2019-11-28 00:01:58,299 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 7 [2019-11-28 00:01:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:58,300 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2019-11-28 00:01:58,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:01:58,300 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2019-11-28 00:01:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 00:01:58,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:58,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:58,302 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:58,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:58,302 INFO L82 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2019-11-28 00:01:58,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:58,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498886246] [2019-11-28 00:01:58,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:58,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498886246] [2019-11-28 00:01:58,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:58,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:01:58,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846794051] [2019-11-28 00:01:58,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:01:58,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:58,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:01:58,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:01:58,343 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand 4 states. [2019-11-28 00:01:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:58,531 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2019-11-28 00:01:58,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:01:58,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 00:01:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:58,533 INFO L225 Difference]: With dead ends: 114 [2019-11-28 00:01:58,534 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 00:01:58,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:58,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 00:01:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-28 00:01:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 00:01:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2019-11-28 00:01:58,546 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 8 [2019-11-28 00:01:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:58,546 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2019-11-28 00:01:58,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:01:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2019-11-28 00:01:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 00:01:58,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:58,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:58,549 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:58,549 INFO L82 PathProgramCache]: Analyzing trace with hash -639549266, now seen corresponding path program 1 times [2019-11-28 00:01:58,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:58,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27354259] [2019-11-28 00:01:58,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:58,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27354259] [2019-11-28 00:01:58,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:58,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:01:58,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668193828] [2019-11-28 00:01:58,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:01:58,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:58,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:01:58,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:58,623 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 5 states. [2019-11-28 00:01:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:58,832 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2019-11-28 00:01:58,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:01:58,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 00:01:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:58,834 INFO L225 Difference]: With dead ends: 109 [2019-11-28 00:01:58,834 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 00:01:58,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:01:58,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 00:01:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-28 00:01:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 00:01:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-11-28 00:01:58,844 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 11 [2019-11-28 00:01:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:58,844 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-11-28 00:01:58,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:01:58,845 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-11-28 00:01:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 00:01:58,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:58,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:58,846 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:58,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:58,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1648813321, now seen corresponding path program 1 times [2019-11-28 00:01:58,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:58,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553991442] [2019-11-28 00:01:58,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:58,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553991442] [2019-11-28 00:01:58,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:58,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:01:58,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531235540] [2019-11-28 00:01:58,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:01:58,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:58,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:01:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:01:58,900 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 4 states. [2019-11-28 00:01:59,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:59,040 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2019-11-28 00:01:59,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:01:59,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 00:01:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:59,042 INFO L225 Difference]: With dead ends: 107 [2019-11-28 00:01:59,043 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 00:01:59,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 00:01:59,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-11-28 00:01:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-28 00:01:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-11-28 00:01:59,059 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 12 [2019-11-28 00:01:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:59,060 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-11-28 00:01:59,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:01:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-11-28 00:01:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 00:01:59,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:59,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:59,066 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:59,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:59,067 INFO L82 PathProgramCache]: Analyzing trace with hash -411248735, now seen corresponding path program 1 times [2019-11-28 00:01:59,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:59,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015635410] [2019-11-28 00:01:59,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:59,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015635410] [2019-11-28 00:01:59,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:59,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:01:59,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980991526] [2019-11-28 00:01:59,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:01:59,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:59,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:01:59,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:59,132 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 5 states. [2019-11-28 00:01:59,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:59,342 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2019-11-28 00:01:59,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:01:59,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 00:01:59,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:59,345 INFO L225 Difference]: With dead ends: 121 [2019-11-28 00:01:59,345 INFO L226 Difference]: Without dead ends: 119 [2019-11-28 00:01:59,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:01:59,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-28 00:01:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2019-11-28 00:01:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 00:01:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-11-28 00:01:59,365 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 13 [2019-11-28 00:01:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:59,366 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-11-28 00:01:59,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:01:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-11-28 00:01:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 00:01:59,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:59,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:59,371 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash -409524831, now seen corresponding path program 1 times [2019-11-28 00:01:59,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:59,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40574722] [2019-11-28 00:01:59,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:59,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40574722] [2019-11-28 00:01:59,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:59,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:01:59,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489863751] [2019-11-28 00:01:59,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:01:59,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:59,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:01:59,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:01:59,510 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2019-11-28 00:01:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:01:59,698 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2019-11-28 00:01:59,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:01:59,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-28 00:01:59,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:01:59,700 INFO L225 Difference]: With dead ends: 101 [2019-11-28 00:01:59,700 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 00:01:59,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:01:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 00:01:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-11-28 00:01:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 00:01:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-11-28 00:01:59,714 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 13 [2019-11-28 00:01:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:01:59,714 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-11-28 00:01:59,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:01:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-11-28 00:01:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 00:01:59,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:01:59,717 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:01:59,717 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:01:59,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:01:59,718 INFO L82 PathProgramCache]: Analyzing trace with hash 136195212, now seen corresponding path program 1 times [2019-11-28 00:01:59,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:01:59,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233141550] [2019-11-28 00:01:59,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:01:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:01:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:01:59,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233141550] [2019-11-28 00:01:59,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:01:59,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:01:59,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068365538] [2019-11-28 00:01:59,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:01:59,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:01:59,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:01:59,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:01:59,805 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2019-11-28 00:02:00,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:00,049 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2019-11-28 00:02:00,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:00,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 00:02:00,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:00,050 INFO L225 Difference]: With dead ends: 116 [2019-11-28 00:02:00,050 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 00:02:00,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:00,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 00:02:00,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2019-11-28 00:02:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 00:02:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-11-28 00:02:00,063 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 14 [2019-11-28 00:02:00,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:00,064 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-11-28 00:02:00,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-11-28 00:02:00,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 00:02:00,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:00,066 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:00,066 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:00,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash 137742357, now seen corresponding path program 1 times [2019-11-28 00:02:00,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:00,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577938287] [2019-11-28 00:02:00,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:00,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577938287] [2019-11-28 00:02:00,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:00,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:00,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612237468] [2019-11-28 00:02:00,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:00,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:00,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:00,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:00,149 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 5 states. [2019-11-28 00:02:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:00,330 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2019-11-28 00:02:00,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:00,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 00:02:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:00,331 INFO L225 Difference]: With dead ends: 116 [2019-11-28 00:02:00,331 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 00:02:00,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 00:02:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2019-11-28 00:02:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-28 00:02:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-11-28 00:02:00,335 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 14 [2019-11-28 00:02:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:00,335 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-11-28 00:02:00,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-11-28 00:02:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 00:02:00,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:00,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:00,336 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:00,337 INFO L82 PathProgramCache]: Analyzing trace with hash 189636292, now seen corresponding path program 1 times [2019-11-28 00:02:00,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:00,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900418880] [2019-11-28 00:02:00,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:00,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900418880] [2019-11-28 00:02:00,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:00,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:00,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506178667] [2019-11-28 00:02:00,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:00,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:00,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:00,400 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 5 states. [2019-11-28 00:02:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:00,576 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-11-28 00:02:00,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:00,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 00:02:00,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:00,577 INFO L225 Difference]: With dead ends: 95 [2019-11-28 00:02:00,578 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 00:02:00,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:00,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 00:02:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-28 00:02:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 00:02:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-11-28 00:02:00,583 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 14 [2019-11-28 00:02:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:00,583 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-11-28 00:02:00,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-11-28 00:02:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 00:02:00,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:00,584 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:00,585 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:00,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash -24950085, now seen corresponding path program 1 times [2019-11-28 00:02:00,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:00,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772873483] [2019-11-28 00:02:00,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:00,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772873483] [2019-11-28 00:02:00,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:00,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:00,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35852661] [2019-11-28 00:02:00,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:00,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:00,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:00,661 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 5 states. [2019-11-28 00:02:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:00,875 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2019-11-28 00:02:00,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:00,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-28 00:02:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:00,881 INFO L225 Difference]: With dead ends: 107 [2019-11-28 00:02:00,881 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 00:02:00,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 00:02:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2019-11-28 00:02:00,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 00:02:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2019-11-28 00:02:00,885 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 15 [2019-11-28 00:02:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:00,886 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2019-11-28 00:02:00,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2019-11-28 00:02:00,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:02:00,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:00,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:00,887 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:00,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:00,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2034707599, now seen corresponding path program 1 times [2019-11-28 00:02:00,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:00,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865857578] [2019-11-28 00:02:00,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:00,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865857578] [2019-11-28 00:02:00,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:00,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:02:00,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480228984] [2019-11-28 00:02:00,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:02:00,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:00,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:02:00,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:00,928 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 6 states. [2019-11-28 00:02:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:01,118 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2019-11-28 00:02:01,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:01,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 00:02:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:01,119 INFO L225 Difference]: With dead ends: 99 [2019-11-28 00:02:01,120 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 00:02:01,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 00:02:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2019-11-28 00:02:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 00:02:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2019-11-28 00:02:01,124 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 16 [2019-11-28 00:02:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:01,124 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2019-11-28 00:02:01,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:02:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2019-11-28 00:02:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:02:01,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:01,126 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:01,126 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:01,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:01,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1348569745, now seen corresponding path program 1 times [2019-11-28 00:02:01,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:01,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411906940] [2019-11-28 00:02:01,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:01,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411906940] [2019-11-28 00:02:01,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:01,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:01,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606923198] [2019-11-28 00:02:01,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:01,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:01,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:01,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:01,154 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 4 states. [2019-11-28 00:02:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:01,248 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-11-28 00:02:01,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:01,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 00:02:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:01,249 INFO L225 Difference]: With dead ends: 87 [2019-11-28 00:02:01,250 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 00:02:01,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:01,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 00:02:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-28 00:02:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 00:02:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-11-28 00:02:01,252 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 17 [2019-11-28 00:02:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:01,253 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-11-28 00:02:01,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-11-28 00:02:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 00:02:01,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:01,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:01,255 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash 892497877, now seen corresponding path program 1 times [2019-11-28 00:02:01,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:01,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120174457] [2019-11-28 00:02:01,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:01,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120174457] [2019-11-28 00:02:01,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:01,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 00:02:01,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935598037] [2019-11-28 00:02:01,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:02:01,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:01,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:02:01,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:02:01,416 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 12 states. [2019-11-28 00:02:01,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:01,522 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-11-28 00:02:01,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 00:02:01,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-11-28 00:02:01,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:01,523 INFO L225 Difference]: With dead ends: 54 [2019-11-28 00:02:01,523 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 00:02:01,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:02:01,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 00:02:01,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-28 00:02:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 00:02:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-11-28 00:02:01,526 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 44 [2019-11-28 00:02:01,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:01,526 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-11-28 00:02:01,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:02:01,527 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-11-28 00:02:01,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 00:02:01,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:01,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:01,528 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:01,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:01,529 INFO L82 PathProgramCache]: Analyzing trace with hash 892513765, now seen corresponding path program 1 times [2019-11-28 00:02:01,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:01,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774036652] [2019-11-28 00:02:01,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:01,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774036652] [2019-11-28 00:02:01,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:01,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-28 00:02:01,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045248694] [2019-11-28 00:02:01,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 00:02:01,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:01,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 00:02:01,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:02:01,698 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 13 states. [2019-11-28 00:02:01,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:01,825 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-11-28 00:02:01,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:02:01,826 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-11-28 00:02:01,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:01,827 INFO L225 Difference]: With dead ends: 59 [2019-11-28 00:02:01,827 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 00:02:01,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:02:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 00:02:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2019-11-28 00:02:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 00:02:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-11-28 00:02:01,831 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2019-11-28 00:02:01,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:01,832 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-11-28 00:02:01,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 00:02:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-11-28 00:02:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 00:02:01,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:01,834 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:01,834 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:01,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:01,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1897634854, now seen corresponding path program 1 times [2019-11-28 00:02:01,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:01,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230325222] [2019-11-28 00:02:01,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:02,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230325222] [2019-11-28 00:02:02,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:02,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:02,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506716097] [2019-11-28 00:02:02,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:02,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:02,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:02,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:02,054 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 5 states. [2019-11-28 00:02:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:02,132 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-11-28 00:02:02,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:02,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-28 00:02:02,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:02,134 INFO L225 Difference]: With dead ends: 50 [2019-11-28 00:02:02,134 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 00:02:02,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 25 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 00:02:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-28 00:02:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 00:02:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-11-28 00:02:02,136 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 45 [2019-11-28 00:02:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:02,137 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-11-28 00:02:02,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-11-28 00:02:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 00:02:02,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:02,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:02,138 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:02,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:02,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1898127398, now seen corresponding path program 1 times [2019-11-28 00:02:02,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:02,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268785276] [2019-11-28 00:02:02,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:02,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268785276] [2019-11-28 00:02:02,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:02,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:02,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474594436] [2019-11-28 00:02:02,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:02,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:02,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:02,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:02,326 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 5 states. [2019-11-28 00:02:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:02,444 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-11-28 00:02:02,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:02,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-28 00:02:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:02,445 INFO L225 Difference]: With dead ends: 50 [2019-11-28 00:02:02,445 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:02:02,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 25 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:02:02,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:02:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:02:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:02:02,447 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-28 00:02:02,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:02,447 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:02:02,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:02:02,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:02:02,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:02:02,536 INFO L246 CegarLoopResult]: For program point L448(lines 448 977) no Hoare annotation was computed. [2019-11-28 00:02:02,537 INFO L249 CegarLoopResult]: At program point L927(lines 12 1001) the Hoare annotation is: true [2019-11-28 00:02:02,537 INFO L246 CegarLoopResult]: For program point L861(lines 861 941) no Hoare annotation was computed. [2019-11-28 00:02:02,537 INFO L246 CegarLoopResult]: For program point L250(lines 250 272) no Hoare annotation was computed. [2019-11-28 00:02:02,537 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-11-28 00:02:02,537 INFO L246 CegarLoopResult]: For program point L531(lines 531 555) no Hoare annotation was computed. [2019-11-28 00:02:02,538 INFO L246 CegarLoopResult]: For program point L878(line 878) no Hoare annotation was computed. [2019-11-28 00:02:02,538 INFO L246 CegarLoopResult]: For program point L746(lines 746 757) no Hoare annotation was computed. [2019-11-28 00:02:02,538 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2019-11-28 00:02:02,538 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-28 00:02:02,538 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:02:02,539 INFO L246 CegarLoopResult]: For program point L796(lines 796 946) no Hoare annotation was computed. [2019-11-28 00:02:02,539 INFO L246 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-28 00:02:02,539 INFO L246 CegarLoopResult]: For program point L565(lines 565 968) no Hoare annotation was computed. [2019-11-28 00:02:02,539 INFO L246 CegarLoopResult]: For program point L912(lines 912 938) no Hoare annotation was computed. [2019-11-28 00:02:02,539 INFO L246 CegarLoopResult]: For program point L780(lines 780 948) no Hoare annotation was computed. [2019-11-28 00:02:02,539 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-28 00:02:02,539 INFO L246 CegarLoopResult]: For program point L516(lines 516 971) no Hoare annotation was computed. [2019-11-28 00:02:02,540 INFO L242 CegarLoopResult]: At program point L863(lines 21 995) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-11-28 00:02:02,540 INFO L246 CegarLoopResult]: For program point L252(line 252) no Hoare annotation was computed. [2019-11-28 00:02:02,540 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2019-11-28 00:02:02,540 INFO L246 CegarLoopResult]: For program point L599(lines 599 623) no Hoare annotation was computed. [2019-11-28 00:02:02,541 INFO L246 CegarLoopResult]: For program point L21(lines 21 995) no Hoare annotation was computed. [2019-11-28 00:02:02,541 INFO L246 CegarLoopResult]: For program point L814(lines 814 825) no Hoare annotation was computed. [2019-11-28 00:02:02,541 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-11-28 00:02:02,541 INFO L246 CegarLoopResult]: For program point L633(lines 633 962) no Hoare annotation was computed. [2019-11-28 00:02:02,541 INFO L246 CegarLoopResult]: For program point L914(line 914) no Hoare annotation was computed. [2019-11-28 00:02:02,541 INFO L246 CegarLoopResult]: For program point L848(lines 848 942) no Hoare annotation was computed. [2019-11-28 00:02:02,541 INFO L246 CegarLoopResult]: For program point L138(lines 138 231) no Hoare annotation was computed. [2019-11-28 00:02:02,541 INFO L246 CegarLoopResult]: For program point L584(lines 584 965) no Hoare annotation was computed. [2019-11-28 00:02:02,542 INFO L246 CegarLoopResult]: For program point L320(lines 320 988) no Hoare annotation was computed. [2019-11-28 00:02:02,542 INFO L246 CegarLoopResult]: For program point L667(lines 667 691) no Hoare annotation was computed. [2019-11-28 00:02:02,542 INFO L246 CegarLoopResult]: For program point L304(lines 304 990) no Hoare annotation was computed. [2019-11-28 00:02:02,542 INFO L242 CegarLoopResult]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2019-11-28 00:02:02,542 INFO L246 CegarLoopResult]: For program point L701(lines 701 956) no Hoare annotation was computed. [2019-11-28 00:02:02,542 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-11-28 00:02:02,542 INFO L246 CegarLoopResult]: For program point L338(lines 338 349) no Hoare annotation was computed. [2019-11-28 00:02:02,543 INFO L246 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-28 00:02:02,544 INFO L246 CegarLoopResult]: For program point L652(lines 652 959) no Hoare annotation was computed. [2019-11-28 00:02:02,544 INFO L246 CegarLoopResult]: For program point L41(lines 41 51) no Hoare annotation was computed. [2019-11-28 00:02:02,544 INFO L249 CegarLoopResult]: At program point L999(lines 17 1000) the Hoare annotation is: true [2019-11-28 00:02:02,544 INFO L246 CegarLoopResult]: For program point L388(lines 388 982) no Hoare annotation was computed. [2019-11-28 00:02:02,544 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:02:02,545 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-11-28 00:02:02,545 INFO L246 CegarLoopResult]: For program point L735(lines 735 759) no Hoare annotation was computed. [2019-11-28 00:02:02,545 INFO L246 CegarLoopResult]: For program point L91(lines 91 280) no Hoare annotation was computed. [2019-11-28 00:02:02,545 INFO L246 CegarLoopResult]: For program point L372(lines 372 984) no Hoare annotation was computed. [2019-11-28 00:02:02,545 INFO L246 CegarLoopResult]: For program point L769(lines 769 950) no Hoare annotation was computed. [2019-11-28 00:02:02,546 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-11-28 00:02:02,546 INFO L246 CegarLoopResult]: For program point L406(lines 406 417) no Hoare annotation was computed. [2019-11-28 00:02:02,546 INFO L246 CegarLoopResult]: For program point L720(lines 720 953) no Hoare annotation was computed. [2019-11-28 00:02:02,546 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-28 00:02:02,546 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2019-11-28 00:02:02,547 INFO L246 CegarLoopResult]: For program point L456(lines 456 976) no Hoare annotation was computed. [2019-11-28 00:02:02,547 INFO L242 CegarLoopResult]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 9 ULTIMATE.start_main_~main__t~0)) [2019-11-28 00:02:02,547 INFO L246 CegarLoopResult]: For program point L869(lines 869 940) no Hoare annotation was computed. [2019-11-28 00:02:02,547 INFO L246 CegarLoopResult]: For program point L803(lines 803 827) no Hoare annotation was computed. [2019-11-28 00:02:02,547 INFO L246 CegarLoopResult]: For program point L159(lines 159 228) no Hoare annotation was computed. [2019-11-28 00:02:02,548 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-11-28 00:02:02,548 INFO L246 CegarLoopResult]: For program point L60(lines 60 994) no Hoare annotation was computed. [2019-11-28 00:02:02,548 INFO L246 CegarLoopResult]: For program point L440(lines 440 978) no Hoare annotation was computed. [2019-11-28 00:02:02,548 INFO L246 CegarLoopResult]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-11-28 00:02:02,561 INFO L246 CegarLoopResult]: For program point L837(lines 837 944) no Hoare annotation was computed. [2019-11-28 00:02:02,561 INFO L246 CegarLoopResult]: For program point L127(lines 127 279) no Hoare annotation was computed. [2019-11-28 00:02:02,561 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-28 00:02:02,562 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:02:02,562 INFO L246 CegarLoopResult]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-11-28 00:02:02,562 INFO L246 CegarLoopResult]: For program point L788(lines 788 947) no Hoare annotation was computed. [2019-11-28 00:02:02,562 INFO L246 CegarLoopResult]: For program point L243(lines 243 278) no Hoare annotation was computed. [2019-11-28 00:02:02,562 INFO L246 CegarLoopResult]: For program point L78(lines 78 281) no Hoare annotation was computed. [2019-11-28 00:02:02,562 INFO L246 CegarLoopResult]: For program point L524(lines 524 970) no Hoare annotation was computed. [2019-11-28 00:02:02,562 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2019-11-28 00:02:02,562 INFO L246 CegarLoopResult]: For program point L293(lines 293 992) no Hoare annotation was computed. [2019-11-28 00:02:02,562 INFO L246 CegarLoopResult]: For program point L29(lines 29 53) no Hoare annotation was computed. [2019-11-28 00:02:02,562 INFO L246 CegarLoopResult]: For program point L508(lines 508 972) no Hoare annotation was computed. [2019-11-28 00:02:02,563 INFO L246 CegarLoopResult]: For program point L888(lines 888 900) no Hoare annotation was computed. [2019-11-28 00:02:02,563 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-11-28 00:02:02,564 INFO L242 CegarLoopResult]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0)) [2019-11-28 00:02:02,564 INFO L246 CegarLoopResult]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-11-28 00:02:02,564 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-28 00:02:02,564 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2019-11-28 00:02:02,564 INFO L246 CegarLoopResult]: For program point L327(lines 327 351) no Hoare annotation was computed. [2019-11-28 00:02:02,565 INFO L246 CegarLoopResult]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-11-28 00:02:02,565 INFO L246 CegarLoopResult]: For program point L212(lines 212 224) no Hoare annotation was computed. [2019-11-28 00:02:02,565 INFO L246 CegarLoopResult]: For program point L592(lines 592 964) no Hoare annotation was computed. [2019-11-28 00:02:02,565 INFO L246 CegarLoopResult]: For program point L361(lines 361 986) no Hoare annotation was computed. [2019-11-28 00:02:02,565 INFO L246 CegarLoopResult]: For program point L262(lines 262 270) no Hoare annotation was computed. [2019-11-28 00:02:02,565 INFO L246 CegarLoopResult]: For program point L576(lines 576 966) no Hoare annotation was computed. [2019-11-28 00:02:02,565 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-28 00:02:02,565 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-28 00:02:02,566 INFO L246 CegarLoopResult]: For program point L890(line 890) no Hoare annotation was computed. [2019-11-28 00:02:02,566 INFO L246 CegarLoopResult]: For program point L312(lines 312 989) no Hoare annotation was computed. [2019-11-28 00:02:02,566 INFO L246 CegarLoopResult]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-28 00:02:02,566 INFO L246 CegarLoopResult]: For program point L395(lines 395 419) no Hoare annotation was computed. [2019-11-28 00:02:02,566 INFO L246 CegarLoopResult]: For program point L131(lines 131 237) no Hoare annotation was computed. [2019-11-28 00:02:02,566 INFO L246 CegarLoopResult]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-11-28 00:02:02,566 INFO L246 CegarLoopResult]: For program point L610(lines 610 621) no Hoare annotation was computed. [2019-11-28 00:02:02,566 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 00:02:02,566 INFO L246 CegarLoopResult]: For program point L924(lines 924 936) no Hoare annotation was computed. [2019-11-28 00:02:02,567 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2019-11-28 00:02:02,567 INFO L246 CegarLoopResult]: For program point L214(line 214) no Hoare annotation was computed. [2019-11-28 00:02:02,567 INFO L246 CegarLoopResult]: For program point L660(lines 660 958) no Hoare annotation was computed. [2019-11-28 00:02:02,567 INFO L246 CegarLoopResult]: For program point L429(lines 429 980) no Hoare annotation was computed. [2019-11-28 00:02:02,567 INFO L246 CegarLoopResult]: For program point L264(line 264) no Hoare annotation was computed. [2019-11-28 00:02:02,567 INFO L246 CegarLoopResult]: For program point L644(lines 644 960) no Hoare annotation was computed. [2019-11-28 00:02:02,567 INFO L246 CegarLoopResult]: For program point L380(lines 380 983) no Hoare annotation was computed. [2019-11-28 00:02:02,567 INFO L246 CegarLoopResult]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2019-11-28 00:02:02,568 INFO L246 CegarLoopResult]: For program point L463(lines 463 487) no Hoare annotation was computed. [2019-11-28 00:02:02,568 INFO L246 CegarLoopResult]: For program point L876(lines 876 902) no Hoare annotation was computed. [2019-11-28 00:02:02,568 INFO L246 CegarLoopResult]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-11-28 00:02:02,568 INFO L246 CegarLoopResult]: For program point L678(lines 678 689) no Hoare annotation was computed. [2019-11-28 00:02:02,568 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-28 00:02:02,568 INFO L246 CegarLoopResult]: For program point L67(lines 67 283) no Hoare annotation was computed. [2019-11-28 00:02:02,568 INFO L246 CegarLoopResult]: For program point L926(line 926) no Hoare annotation was computed. [2019-11-28 00:02:02,568 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-11-28 00:02:02,569 INFO L246 CegarLoopResult]: For program point L728(lines 728 952) no Hoare annotation was computed. [2019-11-28 00:02:02,569 INFO L246 CegarLoopResult]: For program point L150(lines 150 229) no Hoare annotation was computed. [2019-11-28 00:02:02,569 INFO L246 CegarLoopResult]: For program point L497(lines 497 974) no Hoare annotation was computed. [2019-11-28 00:02:02,569 INFO L246 CegarLoopResult]: For program point L200(lines 200 226) no Hoare annotation was computed. [2019-11-28 00:02:02,569 INFO L246 CegarLoopResult]: For program point L712(lines 712 954) no Hoare annotation was computed. [2019-11-28 00:02:02,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:02:02 BoogieIcfgContainer [2019-11-28 00:02:02,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:02:02,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:02:02,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:02:02,591 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:02:02,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:01:57" (3/4) ... [2019-11-28 00:02:02,594 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:02:02,611 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 00:02:02,612 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:02:02,774 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:02:02,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:02:02,777 INFO L168 Benchmark]: Toolchain (without parser) took 6634.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 960.4 MB in the beginning and 1.3 GB in the end (delta: -308.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:02:02,777 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:02:02,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 586.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:02,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:02,778 INFO L168 Benchmark]: Boogie Preprocessor took 38.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:02:02,779 INFO L168 Benchmark]: RCFGBuilder took 736.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:02,779 INFO L168 Benchmark]: TraceAbstraction took 5009.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -208.9 MB). Peak memory consumption was 321.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:02,780 INFO L168 Benchmark]: Witness Printer took 183.42 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:02,783 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 586.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 736.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5009.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -208.9 MB). Peak memory consumption was 321.4 MB. Max. memory is 11.5 GB. * Witness Printer took 183.42 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t + 1 <= main__tagbuf_len - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 9 <= main__t - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 16 error locations. Result: SAFE, OverallTime: 4.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 697 SDtfs, 1844 SDslu, 728 SDs, 0 SdLazy, 2417 SolverSat, 438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 48 SyntacticMatches, 56 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 87 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 32 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1154 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 64 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 31348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...