./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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/Problem02_label19.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 e94bad701dc31ef8837df5dc0d8bbaaa41b948fd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:44:28,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:44:28,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:44:28,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:44:28,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:44:28,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:44:28,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:44:28,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:44:28,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:44:28,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:44:28,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:44:28,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:44:28,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:44:28,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:44:28,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:44:28,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:44:28,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:44:28,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:44:28,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:44:28,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:44:28,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:44:28,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:44:28,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:44:28,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:44:28,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:44:28,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:44:28,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:44:28,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:44:28,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:44:28,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:44:28,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:44:28,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:44:28,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:44:28,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:44:28,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:44:28,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:44:28,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:44:28,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:44:28,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:44:28,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:44:28,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:44:28,153 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:44:28,168 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:44:28,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:44:28,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:44:28,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:44:28,171 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:44:28,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:44:28,171 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:44:28,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:44:28,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:44:28,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:44:28,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:44:28,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:44:28,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:44:28,173 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:44:28,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:44:28,174 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:44:28,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:44:28,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:44:28,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:44:28,175 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:44:28,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:44:28,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:44:28,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:44:28,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:44:28,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:44:28,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:44:28,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:44:28,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:44:28,178 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:44:28,178 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 -> e94bad701dc31ef8837df5dc0d8bbaaa41b948fd [2019-11-28 15:44:28,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:44:28,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:44:28,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:44:28,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:44:28,538 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:44:28,539 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label19.c [2019-11-28 15:44:28,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e514baa/9b651d9a854346ccb8944862f904a955/FLAG5806d1f9f [2019-11-28 15:44:29,187 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:44:29,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label19.c [2019-11-28 15:44:29,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e514baa/9b651d9a854346ccb8944862f904a955/FLAG5806d1f9f [2019-11-28 15:44:29,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e514baa/9b651d9a854346ccb8944862f904a955 [2019-11-28 15:44:29,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:44:29,436 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:44:29,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:44:29,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:44:29,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:44:29,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:44:29" (1/1) ... [2019-11-28 15:44:29,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7b796e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:29, skipping insertion in model container [2019-11-28 15:44:29,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:44:29" (1/1) ... [2019-11-28 15:44:29,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:44:29,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:44:29,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:44:30,003 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:44:30,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:44:30,198 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:44:30,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:30 WrapperNode [2019-11-28 15:44:30,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:44:30,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:44:30,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:44:30,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:44:30,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:30" (1/1) ... [2019-11-28 15:44:30,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:30" (1/1) ... [2019-11-28 15:44:30,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:44:30,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:44:30,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:44:30,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:44:30,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:30" (1/1) ... [2019-11-28 15:44:30,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:30" (1/1) ... [2019-11-28 15:44:30,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:30" (1/1) ... [2019-11-28 15:44:30,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:30" (1/1) ... [2019-11-28 15:44:30,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:30" (1/1) ... [2019-11-28 15:44:30,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:30" (1/1) ... [2019-11-28 15:44:30,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:30" (1/1) ... [2019-11-28 15:44:30,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:44:30,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:44:30,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:44:30,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:44:30,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:44:30,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:44:30,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:44:31,908 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:44:31,909 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:44:31,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:44:31 BoogieIcfgContainer [2019-11-28 15:44:31,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:44:31,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:44:31,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:44:31,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:44:31,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:44:29" (1/3) ... [2019-11-28 15:44:31,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b39370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:44:31, skipping insertion in model container [2019-11-28 15:44:31,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:30" (2/3) ... [2019-11-28 15:44:31,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b39370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:44:31, skipping insertion in model container [2019-11-28 15:44:31,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:44:31" (3/3) ... [2019-11-28 15:44:31,921 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label19.c [2019-11-28 15:44:31,931 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:44:31,939 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:44:31,948 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:44:31,975 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:44:31,975 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:44:31,976 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:44:31,976 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:44:31,976 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:44:31,976 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:44:31,976 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:44:31,976 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:44:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-28 15:44:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-28 15:44:32,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:32,008 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] [2019-11-28 15:44:32,009 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:32,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:32,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1607169461, now seen corresponding path program 1 times [2019-11-28 15:44:32,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:32,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980648616] [2019-11-28 15:44:32,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:32,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980648616] [2019-11-28 15:44:32,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:32,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:32,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536189780] [2019-11-28 15:44:32,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:32,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:32,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:32,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:32,559 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-28 15:44:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:34,061 INFO L93 Difference]: Finished difference Result 789 states and 1377 transitions. [2019-11-28 15:44:34,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:34,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-28 15:44:34,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:34,082 INFO L225 Difference]: With dead ends: 789 [2019-11-28 15:44:34,083 INFO L226 Difference]: Without dead ends: 465 [2019-11-28 15:44:34,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-28 15:44:34,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-11-28 15:44:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 309. [2019-11-28 15:44:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-28 15:44:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 453 transitions. [2019-11-28 15:44:34,160 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 453 transitions. Word has length 92 [2019-11-28 15:44:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:34,161 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 453 transitions. [2019-11-28 15:44:34,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2019-11-28 15:44:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-28 15:44:34,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:34,166 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] [2019-11-28 15:44:34,167 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:34,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:34,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1513780896, now seen corresponding path program 1 times [2019-11-28 15:44:34,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:34,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735027344] [2019-11-28 15:44:34,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:34,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735027344] [2019-11-28 15:44:34,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:34,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:34,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704218472] [2019-11-28 15:44:34,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:44:34,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:34,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:44:34,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:44:34,302 INFO L87 Difference]: Start difference. First operand 309 states and 453 transitions. Second operand 3 states. [2019-11-28 15:44:34,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:34,889 INFO L93 Difference]: Finished difference Result 899 states and 1323 transitions. [2019-11-28 15:44:34,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:34,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-28 15:44:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:34,894 INFO L225 Difference]: With dead ends: 899 [2019-11-28 15:44:34,894 INFO L226 Difference]: Without dead ends: 592 [2019-11-28 15:44:34,896 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-28 15:44:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-28 15:44:34,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-11-28 15:44:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-28 15:44:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 765 transitions. [2019-11-28 15:44:34,936 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 765 transitions. Word has length 96 [2019-11-28 15:44:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:34,937 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 765 transitions. [2019-11-28 15:44:34,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:44:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 765 transitions. [2019-11-28 15:44:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-28 15:44:34,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:34,954 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:44:34,955 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:34,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:34,955 INFO L82 PathProgramCache]: Analyzing trace with hash 308279990, now seen corresponding path program 1 times [2019-11-28 15:44:34,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:34,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488731044] [2019-11-28 15:44:34,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:35,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488731044] [2019-11-28 15:44:35,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:35,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:44:35,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808568618] [2019-11-28 15:44:35,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:35,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:35,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:35,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:35,135 INFO L87 Difference]: Start difference. First operand 592 states and 765 transitions. Second operand 4 states. [2019-11-28 15:44:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:36,254 INFO L93 Difference]: Finished difference Result 2169 states and 2837 transitions. [2019-11-28 15:44:36,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:36,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-28 15:44:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:36,264 INFO L225 Difference]: With dead ends: 2169 [2019-11-28 15:44:36,264 INFO L226 Difference]: Without dead ends: 1437 [2019-11-28 15:44:36,267 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-28 15:44:36,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2019-11-28 15:44:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1150. [2019-11-28 15:44:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-11-28 15:44:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1467 transitions. [2019-11-28 15:44:36,302 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1467 transitions. Word has length 101 [2019-11-28 15:44:36,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:36,303 INFO L462 AbstractCegarLoop]: Abstraction has 1150 states and 1467 transitions. [2019-11-28 15:44:36,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1467 transitions. [2019-11-28 15:44:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-28 15:44:36,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:36,307 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:44:36,307 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:36,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1263008387, now seen corresponding path program 1 times [2019-11-28 15:44:36,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:36,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335090781] [2019-11-28 15:44:36,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:36,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335090781] [2019-11-28 15:44:36,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:36,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:44:36,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110690040] [2019-11-28 15:44:36,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:44:36,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:36,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:44:36,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:44:36,371 INFO L87 Difference]: Start difference. First operand 1150 states and 1467 transitions. Second operand 3 states. [2019-11-28 15:44:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:36,959 INFO L93 Difference]: Finished difference Result 3278 states and 4207 transitions. [2019-11-28 15:44:36,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:36,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-28 15:44:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:36,972 INFO L225 Difference]: With dead ends: 3278 [2019-11-28 15:44:36,972 INFO L226 Difference]: Without dead ends: 2130 [2019-11-28 15:44:36,974 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-28 15:44:36,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-11-28 15:44:37,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1850. [2019-11-28 15:44:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2019-11-28 15:44:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2333 transitions. [2019-11-28 15:44:37,021 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2333 transitions. Word has length 109 [2019-11-28 15:44:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:37,021 INFO L462 AbstractCegarLoop]: Abstraction has 1850 states and 2333 transitions. [2019-11-28 15:44:37,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:44:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2333 transitions. [2019-11-28 15:44:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-28 15:44:37,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:37,026 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-28 15:44:37,026 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:37,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:37,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1854205693, now seen corresponding path program 1 times [2019-11-28 15:44:37,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:37,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91981505] [2019-11-28 15:44:37,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:37,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91981505] [2019-11-28 15:44:37,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:37,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:37,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743446212] [2019-11-28 15:44:37,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:37,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:37,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:37,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:37,117 INFO L87 Difference]: Start difference. First operand 1850 states and 2333 transitions. Second operand 4 states. [2019-11-28 15:44:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:37,880 INFO L93 Difference]: Finished difference Result 3984 states and 4981 transitions. [2019-11-28 15:44:37,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:37,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-28 15:44:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:37,892 INFO L225 Difference]: With dead ends: 3984 [2019-11-28 15:44:37,892 INFO L226 Difference]: Without dead ends: 2136 [2019-11-28 15:44:37,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-28 15:44:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2019-11-28 15:44:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2131. [2019-11-28 15:44:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-28 15:44:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2423 transitions. [2019-11-28 15:44:37,941 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2423 transitions. Word has length 150 [2019-11-28 15:44:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:37,942 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2423 transitions. [2019-11-28 15:44:37,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2423 transitions. [2019-11-28 15:44:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-28 15:44:37,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:37,947 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-28 15:44:37,947 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:37,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:37,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2077294402, now seen corresponding path program 1 times [2019-11-28 15:44:37,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:37,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548566546] [2019-11-28 15:44:37,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:38,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548566546] [2019-11-28 15:44:38,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:38,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:38,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334589367] [2019-11-28 15:44:38,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:44:38,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:38,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:44:38,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:44:38,058 INFO L87 Difference]: Start difference. First operand 2131 states and 2423 transitions. Second operand 3 states. [2019-11-28 15:44:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:38,567 INFO L93 Difference]: Finished difference Result 4266 states and 4853 transitions. [2019-11-28 15:44:38,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:38,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-28 15:44:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:38,580 INFO L225 Difference]: With dead ends: 4266 [2019-11-28 15:44:38,580 INFO L226 Difference]: Without dead ends: 2137 [2019-11-28 15:44:38,584 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-28 15:44:38,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-11-28 15:44:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2131. [2019-11-28 15:44:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-28 15:44:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2379 transitions. [2019-11-28 15:44:38,635 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2379 transitions. Word has length 159 [2019-11-28 15:44:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:38,636 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2379 transitions. [2019-11-28 15:44:38,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:44:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2379 transitions. [2019-11-28 15:44:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-28 15:44:38,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:38,643 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-28 15:44:38,643 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:38,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:38,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1420578269, now seen corresponding path program 1 times [2019-11-28 15:44:38,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:38,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532847715] [2019-11-28 15:44:38,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-28 15:44:38,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532847715] [2019-11-28 15:44:38,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:38,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:38,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959109207] [2019-11-28 15:44:38,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:38,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:38,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:38,733 INFO L87 Difference]: Start difference. First operand 2131 states and 2379 transitions. Second operand 4 states. [2019-11-28 15:44:39,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:39,384 INFO L93 Difference]: Finished difference Result 4258 states and 4754 transitions. [2019-11-28 15:44:39,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:39,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-28 15:44:39,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:39,396 INFO L225 Difference]: With dead ends: 4258 [2019-11-28 15:44:39,396 INFO L226 Difference]: Without dead ends: 2129 [2019-11-28 15:44:39,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-28 15:44:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2019-11-28 15:44:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2129. [2019-11-28 15:44:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2129 states. [2019-11-28 15:44:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2307 transitions. [2019-11-28 15:44:39,449 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2307 transitions. Word has length 161 [2019-11-28 15:44:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:39,450 INFO L462 AbstractCegarLoop]: Abstraction has 2129 states and 2307 transitions. [2019-11-28 15:44:39,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2307 transitions. [2019-11-28 15:44:39,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-28 15:44:39,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:39,460 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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, 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] [2019-11-28 15:44:39,460 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:39,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:39,461 INFO L82 PathProgramCache]: Analyzing trace with hash 72359917, now seen corresponding path program 1 times [2019-11-28 15:44:39,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:39,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052336785] [2019-11-28 15:44:39,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-28 15:44:39,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052336785] [2019-11-28 15:44:39,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:39,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:39,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724399514] [2019-11-28 15:44:39,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:44:39,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:39,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:44:39,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:44:39,531 INFO L87 Difference]: Start difference. First operand 2129 states and 2307 transitions. Second operand 3 states. [2019-11-28 15:44:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:40,030 INFO L93 Difference]: Finished difference Result 4538 states and 4924 transitions. [2019-11-28 15:44:40,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:40,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-28 15:44:40,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:40,041 INFO L225 Difference]: With dead ends: 4538 [2019-11-28 15:44:40,042 INFO L226 Difference]: Without dead ends: 2270 [2019-11-28 15:44:40,045 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-28 15:44:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-11-28 15:44:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2268. [2019-11-28 15:44:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2019-11-28 15:44:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 2449 transitions. [2019-11-28 15:44:40,086 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 2449 transitions. Word has length 170 [2019-11-28 15:44:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:40,086 INFO L462 AbstractCegarLoop]: Abstraction has 2268 states and 2449 transitions. [2019-11-28 15:44:40,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:44:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2449 transitions. [2019-11-28 15:44:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-28 15:44:40,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:40,092 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 15:44:40,092 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:40,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash -648360830, now seen corresponding path program 1 times [2019-11-28 15:44:40,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:40,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005233686] [2019-11-28 15:44:40,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 15:44:40,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005233686] [2019-11-28 15:44:40,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:40,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:44:40,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24004870] [2019-11-28 15:44:40,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:40,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:40,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:40,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:40,203 INFO L87 Difference]: Start difference. First operand 2268 states and 2449 transitions. Second operand 4 states. [2019-11-28 15:44:41,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:41,178 INFO L93 Difference]: Finished difference Result 5239 states and 5687 transitions. [2019-11-28 15:44:41,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:41,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-28 15:44:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:41,196 INFO L225 Difference]: With dead ends: 5239 [2019-11-28 15:44:41,196 INFO L226 Difference]: Without dead ends: 2973 [2019-11-28 15:44:41,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-28 15:44:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2019-11-28 15:44:41,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2689. [2019-11-28 15:44:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2689 states. [2019-11-28 15:44:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 2886 transitions. [2019-11-28 15:44:41,249 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 2886 transitions. Word has length 171 [2019-11-28 15:44:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:41,250 INFO L462 AbstractCegarLoop]: Abstraction has 2689 states and 2886 transitions. [2019-11-28 15:44:41,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 2886 transitions. [2019-11-28 15:44:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-28 15:44:41,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:41,256 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:44:41,256 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1613967385, now seen corresponding path program 1 times [2019-11-28 15:44:41,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:41,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481378750] [2019-11-28 15:44:41,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:41,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481378750] [2019-11-28 15:44:41,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:41,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:44:41,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393050826] [2019-11-28 15:44:41,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:41,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:41,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:41,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:41,420 INFO L87 Difference]: Start difference. First operand 2689 states and 2886 transitions. Second operand 4 states. [2019-11-28 15:44:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:42,180 INFO L93 Difference]: Finished difference Result 5658 states and 6067 transitions. [2019-11-28 15:44:42,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:42,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-11-28 15:44:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:42,193 INFO L225 Difference]: With dead ends: 5658 [2019-11-28 15:44:42,193 INFO L226 Difference]: Without dead ends: 2550 [2019-11-28 15:44:42,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-28 15:44:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2019-11-28 15:44:42,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2406. [2019-11-28 15:44:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2019-11-28 15:44:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 2525 transitions. [2019-11-28 15:44:42,236 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 2525 transitions. Word has length 194 [2019-11-28 15:44:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:42,236 INFO L462 AbstractCegarLoop]: Abstraction has 2406 states and 2525 transitions. [2019-11-28 15:44:42,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2525 transitions. [2019-11-28 15:44:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-28 15:44:42,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:42,242 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:44:42,242 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:42,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:42,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1509674929, now seen corresponding path program 1 times [2019-11-28 15:44:42,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:42,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965773181] [2019-11-28 15:44:42,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 8 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-28 15:44:42,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965773181] [2019-11-28 15:44:42,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642875715] [2019-11-28 15:44:42,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:44:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:42,431 INFO L264 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:44:42,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:44:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-28 15:44:42,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:44:42,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-28 15:44:42,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749723998] [2019-11-28 15:44:42,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:44:42,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:42,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:44:42,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:44:42,503 INFO L87 Difference]: Start difference. First operand 2406 states and 2525 transitions. Second operand 3 states. [2019-11-28 15:44:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:42,702 INFO L93 Difference]: Finished difference Result 4380 states and 4595 transitions. [2019-11-28 15:44:42,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:42,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-11-28 15:44:42,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:42,707 INFO L225 Difference]: With dead ends: 4380 [2019-11-28 15:44:42,707 INFO L226 Difference]: Without dead ends: 992 [2019-11-28 15:44:42,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:44:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-11-28 15:44:42,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2019-11-28 15:44:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-11-28 15:44:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1026 transitions. [2019-11-28 15:44:42,735 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1026 transitions. Word has length 201 [2019-11-28 15:44:42,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:42,735 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 1026 transitions. [2019-11-28 15:44:42,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:44:42,736 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1026 transitions. [2019-11-28 15:44:42,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-28 15:44:42,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:42,740 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-28 15:44:42,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:44:42,949 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:42,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:42,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2063084960, now seen corresponding path program 1 times [2019-11-28 15:44:42,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:42,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440631963] [2019-11-28 15:44:42,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-28 15:44:43,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440631963] [2019-11-28 15:44:43,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:43,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:43,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811137536] [2019-11-28 15:44:43,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:43,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:43,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:43,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:43,154 INFO L87 Difference]: Start difference. First operand 992 states and 1026 transitions. Second operand 4 states. [2019-11-28 15:44:43,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:43,354 INFO L93 Difference]: Finished difference Result 1839 states and 1907 transitions. [2019-11-28 15:44:43,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:43,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-11-28 15:44:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:43,355 INFO L225 Difference]: With dead ends: 1839 [2019-11-28 15:44:43,355 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:44:43,357 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-28 15:44:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:44:43,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:44:43,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:44:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:44:43,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2019-11-28 15:44:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:43,359 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:44:43,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:44:43,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:44:43,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:44:43,791 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-11-28 15:44:44,124 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-11-28 15:44:44,131 INFO L246 CegarLoopResult]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,131 INFO L246 CegarLoopResult]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,131 INFO L246 CegarLoopResult]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,131 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-28 15:44:44,131 INFO L246 CegarLoopResult]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-28 15:44:44,131 INFO L246 CegarLoopResult]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-28 15:44:44,131 INFO L246 CegarLoopResult]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-28 15:44:44,132 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-28 15:44:44,132 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-28 15:44:44,132 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-28 15:44:44,132 INFO L246 CegarLoopResult]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,132 INFO L246 CegarLoopResult]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,132 INFO L246 CegarLoopResult]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,132 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-28 15:44:44,132 INFO L246 CegarLoopResult]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-28 15:44:44,132 INFO L246 CegarLoopResult]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-28 15:44:44,133 INFO L246 CegarLoopResult]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-28 15:44:44,133 INFO L246 CegarLoopResult]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-28 15:44:44,133 INFO L246 CegarLoopResult]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-28 15:44:44,133 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-28 15:44:44,133 INFO L246 CegarLoopResult]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,133 INFO L246 CegarLoopResult]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,133 INFO L246 CegarLoopResult]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,133 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-28 15:44:44,133 INFO L246 CegarLoopResult]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-28 15:44:44,134 INFO L246 CegarLoopResult]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-28 15:44:44,134 INFO L246 CegarLoopResult]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-28 15:44:44,134 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-28 15:44:44,134 INFO L246 CegarLoopResult]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,134 INFO L246 CegarLoopResult]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,134 INFO L246 CegarLoopResult]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,134 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-28 15:44:44,134 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-28 15:44:44,134 INFO L246 CegarLoopResult]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-28 15:44:44,135 INFO L246 CegarLoopResult]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-28 15:44:44,135 INFO L246 CegarLoopResult]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-28 15:44:44,135 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-28 15:44:44,135 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-28 15:44:44,135 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-28 15:44:44,135 INFO L246 CegarLoopResult]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,135 INFO L246 CegarLoopResult]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,135 INFO L246 CegarLoopResult]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,135 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-28 15:44:44,136 INFO L246 CegarLoopResult]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-28 15:44:44,136 INFO L246 CegarLoopResult]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-28 15:44:44,136 INFO L246 CegarLoopResult]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-28 15:44:44,136 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-28 15:44:44,136 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-28 15:44:44,136 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-28 15:44:44,136 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-28 15:44:44,136 INFO L246 CegarLoopResult]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,136 INFO L246 CegarLoopResult]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,136 INFO L246 CegarLoopResult]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,137 INFO L246 CegarLoopResult]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-28 15:44:44,137 INFO L246 CegarLoopResult]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-28 15:44:44,137 INFO L246 CegarLoopResult]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-28 15:44:44,137 INFO L246 CegarLoopResult]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-28 15:44:44,137 INFO L246 CegarLoopResult]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-28 15:44:44,137 INFO L246 CegarLoopResult]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-28 15:44:44,137 INFO L246 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-28 15:44:44,137 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-28 15:44:44,137 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-28 15:44:44,138 INFO L246 CegarLoopResult]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,138 INFO L246 CegarLoopResult]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,138 INFO L246 CegarLoopResult]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,138 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-28 15:44:44,138 INFO L246 CegarLoopResult]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-28 15:44:44,138 INFO L246 CegarLoopResult]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-28 15:44:44,138 INFO L246 CegarLoopResult]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-28 15:44:44,138 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-28 15:44:44,138 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-28 15:44:44,138 INFO L246 CegarLoopResult]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,139 INFO L246 CegarLoopResult]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,139 INFO L246 CegarLoopResult]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,139 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-28 15:44:44,139 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-28 15:44:44,139 INFO L246 CegarLoopResult]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-28 15:44:44,139 INFO L246 CegarLoopResult]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-28 15:44:44,139 INFO L246 CegarLoopResult]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-28 15:44:44,139 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:44:44,140 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-28 15:44:44,140 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-28 15:44:44,140 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-28 15:44:44,140 INFO L246 CegarLoopResult]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,140 INFO L246 CegarLoopResult]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,140 INFO L246 CegarLoopResult]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,140 INFO L246 CegarLoopResult]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-28 15:44:44,140 INFO L246 CegarLoopResult]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-28 15:44:44,140 INFO L246 CegarLoopResult]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-28 15:44:44,140 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-28 15:44:44,141 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-28 15:44:44,141 INFO L246 CegarLoopResult]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,141 INFO L246 CegarLoopResult]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,141 INFO L246 CegarLoopResult]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,141 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-28 15:44:44,141 INFO L246 CegarLoopResult]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-28 15:44:44,141 INFO L246 CegarLoopResult]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-28 15:44:44,141 INFO L246 CegarLoopResult]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-28 15:44:44,141 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-28 15:44:44,141 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-28 15:44:44,142 INFO L246 CegarLoopResult]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-28 15:44:44,142 INFO L246 CegarLoopResult]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-28 15:44:44,142 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-28 15:44:44,142 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-28 15:44:44,142 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:44:44,143 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 448) no Hoare annotation was computed. [2019-11-28 15:44:44,143 INFO L246 CegarLoopResult]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-28 15:44:44,143 INFO L246 CegarLoopResult]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,144 INFO L246 CegarLoopResult]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,144 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-28 15:44:44,144 INFO L246 CegarLoopResult]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-28 15:44:44,144 INFO L246 CegarLoopResult]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-28 15:44:44,144 INFO L246 CegarLoopResult]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-28 15:44:44,144 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-28 15:44:44,144 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-28 15:44:44,144 INFO L246 CegarLoopResult]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-28 15:44:44,144 INFO L246 CegarLoopResult]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-28 15:44:44,145 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-28 15:44:44,145 INFO L242 CegarLoopResult]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse5 (= ~a25~0 1))) (let ((.cse0 (= ~a11~0 1)) (.cse8 (= ~a17~0 8)) (.cse2 (= ~a28~0 7)) (.cse10 (<= 10 ~a28~0)) (.cse7 (not .cse5)) (.cse3 (= ~a19~0 1)) (.cse9 (not (= ~a28~0 11))) (.cse6 (= ~a28~0 10)) (.cse4 (<= ~a11~0 0)) (.cse1 (<= ~a17~0 8))) (or (and (= ~a28~0 9) .cse0 .cse1) (and .cse2 .cse0 .cse1) (and (not .cse2) .cse3 .cse4 .cse5 .cse1) (and .cse6 .cse0) (and .cse6 .cse3 .cse4) (and .cse7 .cse8 .cse4 .cse9) (and .cse10 .cse7 .cse0) (and .cse8 .cse4 .cse2) (and .cse10 .cse7 .cse3 .cse4 .cse9) (and .cse6 .cse4 .cse5 .cse1)))) [2019-11-28 15:44:44,145 INFO L246 CegarLoopResult]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,145 INFO L246 CegarLoopResult]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,145 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-28 15:44:44,145 INFO L246 CegarLoopResult]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-28 15:44:44,146 INFO L246 CegarLoopResult]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-28 15:44:44,146 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-28 15:44:44,146 INFO L246 CegarLoopResult]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-28 15:44:44,146 INFO L246 CegarLoopResult]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-28 15:44:44,146 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-28 15:44:44,146 INFO L246 CegarLoopResult]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,146 INFO L246 CegarLoopResult]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,146 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-28 15:44:44,146 INFO L246 CegarLoopResult]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-28 15:44:44,147 INFO L246 CegarLoopResult]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-28 15:44:44,147 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-28 15:44:44,147 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-28 15:44:44,147 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-28 15:44:44,147 INFO L246 CegarLoopResult]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-28 15:44:44,147 INFO L246 CegarLoopResult]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-28 15:44:44,147 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-28 15:44:44,147 INFO L246 CegarLoopResult]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,147 INFO L246 CegarLoopResult]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,147 INFO L246 CegarLoopResult]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-28 15:44:44,147 INFO L246 CegarLoopResult]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-28 15:44:44,148 INFO L246 CegarLoopResult]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-28 15:44:44,148 INFO L246 CegarLoopResult]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-28 15:44:44,148 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-28 15:44:44,148 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-28 15:44:44,148 INFO L242 CegarLoopResult]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse5 (= ~a25~0 1))) (let ((.cse0 (= ~a11~0 1)) (.cse8 (= ~a17~0 8)) (.cse2 (= ~a28~0 7)) (.cse10 (<= 10 ~a28~0)) (.cse7 (not .cse5)) (.cse3 (= ~a19~0 1)) (.cse9 (not (= ~a28~0 11))) (.cse6 (= ~a28~0 10)) (.cse4 (<= ~a11~0 0)) (.cse1 (<= ~a17~0 8))) (or (and (= ~a28~0 9) .cse0 .cse1) (and .cse2 .cse0 .cse1) (and (not .cse2) .cse3 .cse4 .cse5 .cse1) (and .cse6 .cse0) (and .cse6 .cse3 .cse4) (and .cse7 .cse8 .cse4 .cse9) (and .cse10 .cse7 .cse0) (and .cse8 .cse4 .cse2) (and .cse10 .cse7 .cse3 .cse4 .cse9) (and .cse6 .cse4 .cse5 .cse1)))) [2019-11-28 15:44:44,148 INFO L246 CegarLoopResult]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,148 INFO L246 CegarLoopResult]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,148 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-28 15:44:44,149 INFO L246 CegarLoopResult]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-28 15:44:44,149 INFO L246 CegarLoopResult]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-28 15:44:44,149 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-28 15:44:44,149 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-28 15:44:44,149 INFO L246 CegarLoopResult]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,149 INFO L246 CegarLoopResult]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,149 INFO L246 CegarLoopResult]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-28 15:44:44,149 INFO L246 CegarLoopResult]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-28 15:44:44,149 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-28 15:44:44,149 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-28 15:44:44,149 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-28 15:44:44,150 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-28 15:44:44,150 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-28 15:44:44,150 INFO L246 CegarLoopResult]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-28 15:44:44,150 INFO L246 CegarLoopResult]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-28 15:44:44,150 INFO L246 CegarLoopResult]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,150 INFO L246 CegarLoopResult]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,150 INFO L246 CegarLoopResult]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-28 15:44:44,150 INFO L246 CegarLoopResult]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,150 INFO L246 CegarLoopResult]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-28 15:44:44,150 INFO L246 CegarLoopResult]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-28 15:44:44,151 INFO L246 CegarLoopResult]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-28 15:44:44,151 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-28 15:44:44,151 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-28 15:44:44,151 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:44:44,151 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-28 15:44:44,151 INFO L246 CegarLoopResult]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,151 INFO L246 CegarLoopResult]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,151 INFO L246 CegarLoopResult]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,151 INFO L246 CegarLoopResult]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-28 15:44:44,152 INFO L246 CegarLoopResult]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-28 15:44:44,152 INFO L246 CegarLoopResult]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-28 15:44:44,152 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-28 15:44:44,152 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-28 15:44:44,152 INFO L246 CegarLoopResult]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,152 INFO L246 CegarLoopResult]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,152 INFO L246 CegarLoopResult]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,152 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-28 15:44:44,152 INFO L246 CegarLoopResult]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-28 15:44:44,152 INFO L246 CegarLoopResult]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-28 15:44:44,152 INFO L246 CegarLoopResult]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-28 15:44:44,153 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-28 15:44:44,153 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-28 15:44:44,153 INFO L246 CegarLoopResult]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,153 INFO L246 CegarLoopResult]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,153 INFO L246 CegarLoopResult]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,153 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-28 15:44:44,153 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-28 15:44:44,153 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-28 15:44:44,153 INFO L246 CegarLoopResult]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-28 15:44:44,153 INFO L246 CegarLoopResult]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-28 15:44:44,154 INFO L246 CegarLoopResult]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-28 15:44:44,154 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:44:44,154 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-28 15:44:44,154 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-28 15:44:44,154 INFO L246 CegarLoopResult]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,154 INFO L246 CegarLoopResult]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,154 INFO L246 CegarLoopResult]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,154 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-28 15:44:44,154 INFO L246 CegarLoopResult]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-28 15:44:44,154 INFO L246 CegarLoopResult]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-28 15:44:44,155 INFO L246 CegarLoopResult]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-28 15:44:44,155 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-28 15:44:44,155 INFO L246 CegarLoopResult]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,155 INFO L246 CegarLoopResult]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,155 INFO L246 CegarLoopResult]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:44,155 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-28 15:44:44,155 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-28 15:44:44,155 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-28 15:44:44,155 INFO L246 CegarLoopResult]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-28 15:44:44,155 INFO L246 CegarLoopResult]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-28 15:44:44,155 INFO L246 CegarLoopResult]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-28 15:44:44,156 INFO L246 CegarLoopResult]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-28 15:44:44,156 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-28 15:44:44,156 INFO L246 CegarLoopResult]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-28 15:44:44,156 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-28 15:44:44,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:44:44 BoogieIcfgContainer [2019-11-28 15:44:44,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:44:44,182 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:44:44,182 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:44:44,183 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:44:44,183 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:44:31" (3/4) ... [2019-11-28 15:44:44,187 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:44:44,229 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:44:44,231 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:44:44,425 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:44:44,425 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:44:44,427 INFO L168 Benchmark]: Toolchain (without parser) took 14991.42 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 429.4 MB). Free memory was 960.4 MB in the beginning and 1.3 GB in the end (delta: -382.4 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:44,427 INFO L168 Benchmark]: CDTParser took 0.96 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:44:44,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:44,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.20 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:44,428 INFO L168 Benchmark]: Boogie Preprocessor took 68.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:44:44,429 INFO L168 Benchmark]: RCFGBuilder took 1552.72 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: 104.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:44,429 INFO L168 Benchmark]: TraceAbstraction took 12269.65 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 284.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -366.2 MB). Peak memory consumption was 468.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:44,430 INFO L168 Benchmark]: Witness Printer took 243.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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:44,432 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.96 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 762.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -152.4 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.20 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1552.72 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: 104.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12269.65 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 284.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -366.2 MB). Peak memory consumption was 468.6 MB. Max. memory is 11.5 GB. * Witness Printer took 243.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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 448]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((a28 == 9 && a11 == 1) && a17 <= 8) || ((a28 == 7 && a11 == 1) && a17 <= 8)) || ((((!(a28 == 7) && a19 == 1) && a11 <= 0) && a25 == 1) && a17 <= 8)) || (a28 == 10 && a11 == 1)) || ((a28 == 10 && a19 == 1) && a11 <= 0)) || (((!(a25 == 1) && a17 == 8) && a11 <= 0) && !(a28 == 11))) || ((10 <= a28 && !(a25 == 1)) && a11 == 1)) || ((a17 == 8 && a11 <= 0) && a28 == 7)) || ((((10 <= a28 && !(a25 == 1)) && a19 == 1) && a11 <= 0) && !(a28 == 11))) || (((a28 == 10 && a11 <= 0) && a25 == 1) && a17 <= 8) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((a28 == 9 && a11 == 1) && a17 <= 8) || ((a28 == 7 && a11 == 1) && a17 <= 8)) || ((((!(a28 == 7) && a19 == 1) && a11 <= 0) && a25 == 1) && a17 <= 8)) || (a28 == 10 && a11 == 1)) || ((a28 == 10 && a19 == 1) && a11 <= 0)) || (((!(a25 == 1) && a17 == 8) && a11 <= 0) && !(a28 == 11))) || ((10 <= a28 && !(a25 == 1)) && a11 == 1)) || ((a17 == 8 && a11 <= 0) && a28 == 7)) || ((((10 <= a28 && !(a25 == 1)) && a19 == 1) && a11 <= 0) && !(a28 == 11))) || (((a28 == 10 && a11 <= 0) && a25 == 1) && a17 <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 11.3s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 1537 SDtfs, 2378 SDslu, 267 SDs, 0 SdLazy, 5978 SolverSat, 948 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 217 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2689occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 1164 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 245 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1180 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 274 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2045 NumberOfCodeBlocks, 2045 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2032 ConstructedInterpolants, 0 QuantifiedInterpolants, 655619 SizeOfPredicates, 1 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1294/1302 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...