./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label08.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/eca-rers2012/Problem01_label08.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 16d1e07abe3d8baa61b9a8d494202a7664f873bb ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:38:24,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:38:24,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:38:24,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:38:24,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:38:24,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:38:24,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:38:24,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:38:24,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:38:24,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:38:24,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:38:24,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:38:24,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:38:24,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:38:24,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:38:24,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:38:24,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:38:24,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:38:24,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:38:24,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:38:24,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:38:24,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:38:24,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:38:24,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:38:24,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:38:24,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:38:24,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:38:24,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:38:24,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:38:24,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:38:24,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:38:24,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:38:24,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:38:24,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:38:24,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:38:24,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:38:24,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:38:24,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:38:24,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:38:24,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:38:24,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:38:24,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:38:24,129 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:38:24,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:38:24,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:38:24,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:38:24,132 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:38:24,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:38:24,132 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:38:24,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:38:24,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:38:24,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:38:24,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:38:24,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:38:24,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:38:24,134 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:38:24,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:38:24,135 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:38:24,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:38:24,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:38:24,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:38:24,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:38:24,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:38:24,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:38:24,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:38:24,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:38:24,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:38:24,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:38:24,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:38:24,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:38:24,141 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 -> 16d1e07abe3d8baa61b9a8d494202a7664f873bb [2019-11-27 22:38:24,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:38:24,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:38:24,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:38:24,509 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:38:24,510 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:38:24,512 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label08.c [2019-11-27 22:38:24,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a0474ca/c70ebdabad1645e9852134175f5836ca/FLAGb76d0b4a4 [2019-11-27 22:38:25,188 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:38:25,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label08.c [2019-11-27 22:38:25,205 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a0474ca/c70ebdabad1645e9852134175f5836ca/FLAGb76d0b4a4 [2019-11-27 22:38:25,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a0474ca/c70ebdabad1645e9852134175f5836ca [2019-11-27 22:38:25,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:38:25,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:38:25,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:25,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:38:25,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:38:25,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:25" (1/1) ... [2019-11-27 22:38:25,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5562b866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:25, skipping insertion in model container [2019-11-27 22:38:25,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:25" (1/1) ... [2019-11-27 22:38:25,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:38:25,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:38:26,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:26,075 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:38:26,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:26,196 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:38:26,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:26 WrapperNode [2019-11-27 22:38:26,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:26,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:26,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:38:26,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:38:26,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:26" (1/1) ... [2019-11-27 22:38:26,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:26" (1/1) ... [2019-11-27 22:38:26,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:26,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:38:26,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:38:26,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:38:26,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:26" (1/1) ... [2019-11-27 22:38:26,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:26" (1/1) ... [2019-11-27 22:38:26,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:26" (1/1) ... [2019-11-27 22:38:26,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:26" (1/1) ... [2019-11-27 22:38:26,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:26" (1/1) ... [2019-11-27 22:38:26,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:26" (1/1) ... [2019-11-27 22:38:26,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:26" (1/1) ... [2019-11-27 22:38:26,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:38:26,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:38:26,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:38:26,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:38:26,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:26" (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-27 22:38:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:38:26,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:38:27,659 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:38:27,660 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:38:27,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:27 BoogieIcfgContainer [2019-11-27 22:38:27,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:38:27,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:38:27,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:38:27,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:38:27,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:38:25" (1/3) ... [2019-11-27 22:38:27,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c45244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:38:27, skipping insertion in model container [2019-11-27 22:38:27,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:26" (2/3) ... [2019-11-27 22:38:27,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c45244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:38:27, skipping insertion in model container [2019-11-27 22:38:27,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:27" (3/3) ... [2019-11-27 22:38:27,672 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label08.c [2019-11-27 22:38:27,683 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:38:27,692 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:38:27,705 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:38:27,736 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:38:27,736 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:38:27,737 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:38:27,737 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:38:27,737 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:38:27,738 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:38:27,738 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:38:27,739 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:38:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-27 22:38:27,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-27 22:38:27,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:27,793 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, 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, 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-27 22:38:27,794 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:27,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:27,801 INFO L82 PathProgramCache]: Analyzing trace with hash -439667690, now seen corresponding path program 1 times [2019-11-27 22:38:27,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:27,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895986909] [2019-11-27 22:38:27,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:28,367 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-27 22:38:28,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895986909] [2019-11-27 22:38:28,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:28,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:28,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684955229] [2019-11-27 22:38:28,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:28,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:28,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:28,397 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-27 22:38:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:29,339 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-27 22:38:29,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:29,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-27 22:38:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:29,360 INFO L225 Difference]: With dead ends: 528 [2019-11-27 22:38:29,360 INFO L226 Difference]: Without dead ends: 266 [2019-11-27 22:38:29,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:29,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-27 22:38:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-27 22:38:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-27 22:38:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2019-11-27 22:38:29,434 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 113 [2019-11-27 22:38:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:29,435 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2019-11-27 22:38:29,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:29,435 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2019-11-27 22:38:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-27 22:38:29,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:29,438 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 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, 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, 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-27 22:38:29,439 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:29,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:29,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1141355742, now seen corresponding path program 1 times [2019-11-27 22:38:29,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:29,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007006624] [2019-11-27 22:38:29,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:38:29,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007006624] [2019-11-27 22:38:29,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:29,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:29,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743046642] [2019-11-27 22:38:29,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:29,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:29,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:29,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:29,733 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand 4 states. [2019-11-27 22:38:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:30,644 INFO L93 Difference]: Finished difference Result 1054 states and 1488 transitions. [2019-11-27 22:38:30,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:30,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-27 22:38:30,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:30,652 INFO L225 Difference]: With dead ends: 1054 [2019-11-27 22:38:30,652 INFO L226 Difference]: Without dead ends: 790 [2019-11-27 22:38:30,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-27 22:38:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 528. [2019-11-27 22:38:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-27 22:38:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2019-11-27 22:38:30,717 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 117 [2019-11-27 22:38:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:30,717 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2019-11-27 22:38:30,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2019-11-27 22:38:30,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-27 22:38:30,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:30,723 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-27 22:38:30,724 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:30,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:30,724 INFO L82 PathProgramCache]: Analyzing trace with hash -935067032, now seen corresponding path program 1 times [2019-11-27 22:38:30,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:30,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658294979] [2019-11-27 22:38:30,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-27 22:38:30,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658294979] [2019-11-27 22:38:30,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:30,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:30,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879084924] [2019-11-27 22:38:30,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:30,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:30,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:30,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:30,879 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand 3 states. [2019-11-27 22:38:31,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:31,368 INFO L93 Difference]: Finished difference Result 1316 states and 1785 transitions. [2019-11-27 22:38:31,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:31,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-27 22:38:31,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:31,374 INFO L225 Difference]: With dead ends: 1316 [2019-11-27 22:38:31,375 INFO L226 Difference]: Without dead ends: 790 [2019-11-27 22:38:31,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-27 22:38:31,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-11-27 22:38:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-27 22:38:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2019-11-27 22:38:31,399 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 147 [2019-11-27 22:38:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:31,399 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2019-11-27 22:38:31,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2019-11-27 22:38:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-27 22:38:31,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:31,403 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-27 22:38:31,403 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:31,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1615405790, now seen corresponding path program 1 times [2019-11-27 22:38:31,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:31,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092935989] [2019-11-27 22:38:31,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-27 22:38:31,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092935989] [2019-11-27 22:38:31,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:31,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:31,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743790399] [2019-11-27 22:38:31,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:31,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:31,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:31,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:31,574 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand 4 states. [2019-11-27 22:38:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:32,403 INFO L93 Difference]: Finished difference Result 1449 states and 1931 transitions. [2019-11-27 22:38:32,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:32,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-27 22:38:32,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:32,409 INFO L225 Difference]: With dead ends: 1449 [2019-11-27 22:38:32,410 INFO L226 Difference]: Without dead ends: 792 [2019-11-27 22:38:32,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:38:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-11-27 22:38:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2019-11-27 22:38:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-27 22:38:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1025 transitions. [2019-11-27 22:38:32,440 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1025 transitions. Word has length 151 [2019-11-27 22:38:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:32,441 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1025 transitions. [2019-11-27 22:38:32,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1025 transitions. [2019-11-27 22:38:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-27 22:38:32,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:32,444 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1] [2019-11-27 22:38:32,444 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:32,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:32,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1243165274, now seen corresponding path program 1 times [2019-11-27 22:38:32,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:32,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790969034] [2019-11-27 22:38:32,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-27 22:38:32,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790969034] [2019-11-27 22:38:32,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:32,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:32,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489371003] [2019-11-27 22:38:32,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:32,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:32,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:32,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:32,543 INFO L87 Difference]: Start difference. First operand 790 states and 1025 transitions. Second operand 3 states. [2019-11-27 22:38:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:33,038 INFO L93 Difference]: Finished difference Result 1709 states and 2245 transitions. [2019-11-27 22:38:33,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:33,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-27 22:38:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:33,044 INFO L225 Difference]: With dead ends: 1709 [2019-11-27 22:38:33,044 INFO L226 Difference]: Without dead ends: 1052 [2019-11-27 22:38:33,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-27 22:38:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-11-27 22:38:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-27 22:38:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1323 transitions. [2019-11-27 22:38:33,084 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1323 transitions. Word has length 155 [2019-11-27 22:38:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:33,085 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1323 transitions. [2019-11-27 22:38:33,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1323 transitions. [2019-11-27 22:38:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-27 22:38:33,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:33,089 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1] [2019-11-27 22:38:33,089 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash 626276872, now seen corresponding path program 1 times [2019-11-27 22:38:33,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:33,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079608011] [2019-11-27 22:38:33,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-27 22:38:33,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079608011] [2019-11-27 22:38:33,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:33,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:38:33,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395779960] [2019-11-27 22:38:33,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:33,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:33,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:33,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:33,161 INFO L87 Difference]: Start difference. First operand 1052 states and 1323 transitions. Second operand 4 states. [2019-11-27 22:38:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:34,013 INFO L93 Difference]: Finished difference Result 3150 states and 3974 transitions. [2019-11-27 22:38:34,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:34,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-27 22:38:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:34,026 INFO L225 Difference]: With dead ends: 3150 [2019-11-27 22:38:34,026 INFO L226 Difference]: Without dead ends: 2231 [2019-11-27 22:38:34,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-27 22:38:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1576. [2019-11-27 22:38:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-27 22:38:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1943 transitions. [2019-11-27 22:38:34,069 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1943 transitions. Word has length 164 [2019-11-27 22:38:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:34,070 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1943 transitions. [2019-11-27 22:38:34,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1943 transitions. [2019-11-27 22:38:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-27 22:38:34,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:34,076 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-27 22:38:34,076 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:34,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:34,076 INFO L82 PathProgramCache]: Analyzing trace with hash 375824388, now seen corresponding path program 1 times [2019-11-27 22:38:34,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:34,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55545180] [2019-11-27 22:38:34,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-27 22:38:34,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55545180] [2019-11-27 22:38:34,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:34,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:38:34,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380130707] [2019-11-27 22:38:34,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:38:34,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:34,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:38:34,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:38:34,177 INFO L87 Difference]: Start difference. First operand 1576 states and 1943 transitions. Second operand 5 states. [2019-11-27 22:38:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:35,405 INFO L93 Difference]: Finished difference Result 3543 states and 4355 transitions. [2019-11-27 22:38:35,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:38:35,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 188 [2019-11-27 22:38:35,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:35,415 INFO L225 Difference]: With dead ends: 3543 [2019-11-27 22:38:35,416 INFO L226 Difference]: Without dead ends: 2100 [2019-11-27 22:38:35,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:38:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-27 22:38:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-11-27 22:38:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-27 22:38:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2216 transitions. [2019-11-27 22:38:35,462 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2216 transitions. Word has length 188 [2019-11-27 22:38:35,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:35,463 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2216 transitions. [2019-11-27 22:38:35,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:38:35,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2216 transitions. [2019-11-27 22:38:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-27 22:38:35,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:35,469 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:35,470 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:35,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:35,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2072693678, now seen corresponding path program 1 times [2019-11-27 22:38:35,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:35,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671422861] [2019-11-27 22:38:35,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-27 22:38:35,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671422861] [2019-11-27 22:38:35,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:35,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:38:35,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690477684] [2019-11-27 22:38:35,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:35,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:35,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:35,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:35,605 INFO L87 Difference]: Start difference. First operand 1838 states and 2216 transitions. Second operand 4 states. [2019-11-27 22:38:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:36,367 INFO L93 Difference]: Finished difference Result 4591 states and 5491 transitions. [2019-11-27 22:38:36,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:36,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-11-27 22:38:36,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:36,378 INFO L225 Difference]: With dead ends: 4591 [2019-11-27 22:38:36,378 INFO L226 Difference]: Without dead ends: 2231 [2019-11-27 22:38:36,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-27 22:38:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1707. [2019-11-27 22:38:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-27 22:38:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1847 transitions. [2019-11-27 22:38:36,420 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1847 transitions. Word has length 203 [2019-11-27 22:38:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:36,421 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1847 transitions. [2019-11-27 22:38:36,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1847 transitions. [2019-11-27 22:38:36,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-27 22:38:36,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:36,427 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:36,427 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:36,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:36,428 INFO L82 PathProgramCache]: Analyzing trace with hash -230297452, now seen corresponding path program 1 times [2019-11-27 22:38:36,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:36,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697395245] [2019-11-27 22:38:36,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-27 22:38:36,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697395245] [2019-11-27 22:38:36,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:36,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:36,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215280850] [2019-11-27 22:38:36,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:36,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:36,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:36,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:36,614 INFO L87 Difference]: Start difference. First operand 1707 states and 1847 transitions. Second operand 3 states. [2019-11-27 22:38:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:36,999 INFO L93 Difference]: Finished difference Result 2100 states and 2283 transitions. [2019-11-27 22:38:37,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:37,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-27 22:38:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:37,000 INFO L225 Difference]: With dead ends: 2100 [2019-11-27 22:38:37,001 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:38:37,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:37,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:38:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:38:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:38:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:38:37,004 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 217 [2019-11-27 22:38:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:37,005 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:38:37,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:38:37,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:38:37,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:38:37,303 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2019-11-27 22:38:37,417 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2019-11-27 22:38:37,421 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-27 22:38:37,421 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-27 22:38:37,421 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,421 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,422 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,422 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,422 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,422 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,422 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-27 22:38:37,422 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-27 22:38:37,422 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-27 22:38:37,423 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-27 22:38:37,423 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-27 22:38:37,423 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-27 22:38:37,423 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-27 22:38:37,423 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-27 22:38:37,423 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-27 22:38:37,423 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-27 22:38:37,424 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,424 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,424 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,424 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,424 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,424 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,424 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-27 22:38:37,425 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-27 22:38:37,425 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-27 22:38:37,425 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-27 22:38:37,425 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-27 22:38:37,425 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-27 22:38:37,425 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-27 22:38:37,425 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-27 22:38:37,425 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-27 22:38:37,425 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-27 22:38:37,426 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-27 22:38:37,426 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-27 22:38:37,426 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-27 22:38:37,426 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-27 22:38:37,426 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-27 22:38:37,426 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,426 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,426 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,427 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,427 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,427 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-27 22:38:37,427 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-27 22:38:37,427 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-27 22:38:37,427 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-27 22:38:37,427 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-27 22:38:37,427 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-27 22:38:37,427 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-27 22:38:37,428 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-27 22:38:37,428 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-27 22:38:37,428 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 13 ~a8~0))) (let ((.cse4 (not .cse0)) (.cse5 (not (= ~a16~0 6))) (.cse2 (not (= 1 ~a7~0))) (.cse3 (= ~a21~0 1)) (.cse1 (= ~a20~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse0 .cse5 (= ~a17~0 1)) (and .cse5 .cse2 .cse3) (and (not (= 15 ~a8~0)) .cse3 .cse1)))) [2019-11-27 22:38:37,428 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,429 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,429 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,429 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,429 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,429 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-27 22:38:37,429 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-27 22:38:37,429 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-27 22:38:37,429 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-27 22:38:37,429 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-27 22:38:37,430 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-27 22:38:37,430 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-27 22:38:37,430 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-27 22:38:37,430 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-27 22:38:37,430 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-27 22:38:37,430 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-27 22:38:37,430 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-27 22:38:37,430 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-27 22:38:37,431 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-27 22:38:37,431 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,431 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,431 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,431 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,431 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,431 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-27 22:38:37,431 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-27 22:38:37,432 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-27 22:38:37,432 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-27 22:38:37,432 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-27 22:38:37,432 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-27 22:38:37,432 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-27 22:38:37,432 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-27 22:38:37,432 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-27 22:38:37,432 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,433 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,433 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,433 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,433 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-27 22:38:37,433 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,433 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-27 22:38:37,433 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-27 22:38:37,433 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-27 22:38:37,433 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-27 22:38:37,434 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-27 22:38:37,434 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-27 22:38:37,434 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-27 22:38:37,434 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:38:37,434 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-27 22:38:37,434 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-27 22:38:37,434 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-27 22:38:37,435 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-27 22:38:37,435 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-27 22:38:37,435 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-27 22:38:37,435 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,435 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 13 ~a8~0))) (let ((.cse4 (not .cse0)) (.cse5 (not (= ~a16~0 6))) (.cse2 (not (= 1 ~a7~0))) (.cse3 (= ~a21~0 1)) (.cse1 (= ~a20~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse0 .cse5 (= ~a17~0 1)) (and .cse5 .cse2 .cse3) (and (not (= 15 ~a8~0)) .cse3 .cse1)))) [2019-11-27 22:38:37,436 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,436 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,436 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,436 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,436 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-27 22:38:37,436 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-27 22:38:37,436 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-27 22:38:37,436 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-27 22:38:37,437 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-27 22:38:37,437 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-27 22:38:37,437 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-27 22:38:37,437 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-27 22:38:37,437 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,437 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,437 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,437 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,437 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,438 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-27 22:38:37,438 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:38:37,438 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-27 22:38:37,438 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-27 22:38:37,438 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-27 22:38:37,438 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-27 22:38:37,438 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-27 22:38:37,438 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-27 22:38:37,439 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-27 22:38:37,439 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-27 22:38:37,439 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-27 22:38:37,439 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-27 22:38:37,439 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-27 22:38:37,439 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,439 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,440 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,440 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,440 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-27 22:38:37,440 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,440 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,440 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-27 22:38:37,440 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-27 22:38:37,440 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:38:37,441 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-27 22:38:37,441 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-27 22:38:37,441 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-27 22:38:37,441 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-27 22:38:37,441 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-27 22:38:37,441 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-27 22:38:37,441 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-27 22:38:37,441 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-27 22:38:37,441 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-27 22:38:37,442 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-27 22:38:37,442 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,442 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,442 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,442 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,442 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,442 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-27 22:38:37,442 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,443 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-27 22:38:37,443 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-27 22:38:37,443 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-27 22:38:37,443 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-27 22:38:37,443 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-27 22:38:37,443 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-27 22:38:37,443 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-27 22:38:37,443 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-27 22:38:37,443 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-27 22:38:37,444 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-27 22:38:37,444 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-27 22:38:37,444 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:38:37,444 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 515) no Hoare annotation was computed. [2019-11-27 22:38:37,444 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-27 22:38:37,444 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-27 22:38:37,444 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-27 22:38:37,444 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,445 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,445 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,445 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,445 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,445 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:38:37,445 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-27 22:38:37,445 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-27 22:38:37,445 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-27 22:38:37,445 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-27 22:38:37,446 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-27 22:38:37,446 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-27 22:38:37,446 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-27 22:38:37,446 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-27 22:38:37,446 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-27 22:38:37,446 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-27 22:38:37,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:38:37 BoogieIcfgContainer [2019-11-27 22:38:37,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:38:37,486 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:38:37,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:38:37,487 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:38:37,487 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:27" (3/4) ... [2019-11-27 22:38:37,492 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:38:37,527 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:38:37,528 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:38:37,721 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:38:37,721 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:38:37,723 INFO L168 Benchmark]: Toolchain (without parser) took 12273.35 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 428.9 MB). Free memory was 960.4 MB in the beginning and 1.3 GB in the end (delta: -379.3 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:37,723 INFO L168 Benchmark]: CDTParser took 0.42 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-27 22:38:37,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:37,725 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.07 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:37,725 INFO L168 Benchmark]: Boogie Preprocessor took 105.76 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:37,726 INFO L168 Benchmark]: RCFGBuilder took 1245.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:37,726 INFO L168 Benchmark]: TraceAbstraction took 9823.13 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 277.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -358.3 MB). Peak memory consumption was 350.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:37,727 INFO L168 Benchmark]: Witness Printer took 235.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:38:37,729 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.42 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 745.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 112.07 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.76 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1245.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9823.13 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 277.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -358.3 MB). Peak memory consumption was 350.9 MB. Max. memory is 11.5 GB. * Witness Printer took 235.09 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 515]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((13 == a8 && a20 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((13 == a8 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((13 == a8 && a20 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((13 == a8 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 9.2s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 520 SDtfs, 1863 SDslu, 85 SDs, 0 SdLazy, 4383 SolverSat, 719 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1836 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 45 NumberOfFragments, 133 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3010 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 358 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1455 NumberOfCodeBlocks, 1455 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1446 ConstructedInterpolants, 0 QuantifiedInterpolants, 543858 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 640/640 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...