./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label18.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label18.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 eb8eeb6e67f290f9d56e698aa8c9c7a779115813 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:38:41,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:38:41,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:38:41,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:38:41,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:38:41,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:38:41,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:38:41,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:38:41,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:38:41,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:38:41,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:38:41,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:38:41,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:38:41,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:38:41,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:38:41,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:38:41,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:38:41,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:38:41,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:38:41,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:38:41,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:38:41,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:38:41,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:38:41,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:38:41,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:38:41,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:38:41,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:38:41,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:38:41,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:38:41,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:38:41,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:38:41,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:38:41,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:38:41,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:38:41,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:38:41,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:38:41,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:38:41,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:38:41,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:38:41,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:38:41,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:38:41,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:38:41,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:38:41,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:38:41,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:38:41,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:38:41,258 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:38:41,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:38:41,259 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:38:41,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:38:41,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:38:41,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:38:41,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:38:41,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:38:41,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:38:41,263 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:38:41,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:38:41,263 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:38:41,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:38:41,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:38:41,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:38:41,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:38:41,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:38:41,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:38:41,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:38:41,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:38:41,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:38:41,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:38:41,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:38:41,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:38:41,267 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 -> eb8eeb6e67f290f9d56e698aa8c9c7a779115813 [2019-11-27 22:38:41,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:38:41,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:38:41,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:38:41,632 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:38:41,633 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:38:41,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2019-11-27 22:38:41,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef569b8b/6309efaa3d58403ca77d482b81001c49/FLAG825942668 [2019-11-27 22:38:42,249 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:38:42,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2019-11-27 22:38:42,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef569b8b/6309efaa3d58403ca77d482b81001c49/FLAG825942668 [2019-11-27 22:38:42,513 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef569b8b/6309efaa3d58403ca77d482b81001c49 [2019-11-27 22:38:42,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:38:42,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:38:42,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:42,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:38:42,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:38:42,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:42" (1/1) ... [2019-11-27 22:38:42,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bb7c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:42, skipping insertion in model container [2019-11-27 22:38:42,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:42" (1/1) ... [2019-11-27 22:38:42,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:38:42,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:38:43,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:43,173 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:38:43,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:43,320 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:38:43,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:43 WrapperNode [2019-11-27 22:38:43,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:43,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:43,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:38:43,322 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:38:43,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:43" (1/1) ... [2019-11-27 22:38:43,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:43" (1/1) ... [2019-11-27 22:38:43,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:43,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:38:43,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:38:43,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:38:43,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:43" (1/1) ... [2019-11-27 22:38:43,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:43" (1/1) ... [2019-11-27 22:38:43,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:43" (1/1) ... [2019-11-27 22:38:43,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:43" (1/1) ... [2019-11-27 22:38:43,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:43" (1/1) ... [2019-11-27 22:38:43,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:43" (1/1) ... [2019-11-27 22:38:43,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:43" (1/1) ... [2019-11-27 22:38:43,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:38:43,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:38:43,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:38:43,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:38:43,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:38:43,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:38:43,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:38:44,971 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:38:44,972 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:38:44,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:44 BoogieIcfgContainer [2019-11-27 22:38:44,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:38:44,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:38:44,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:38:44,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:38:44,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:38:42" (1/3) ... [2019-11-27 22:38:44,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31869831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:38:44, skipping insertion in model container [2019-11-27 22:38:44,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:43" (2/3) ... [2019-11-27 22:38:44,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31869831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:38:44, skipping insertion in model container [2019-11-27 22:38:44,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:44" (3/3) ... [2019-11-27 22:38:44,985 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label18.c [2019-11-27 22:38:44,996 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:38:45,004 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:38:45,017 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:38:45,060 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:38:45,060 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:38:45,061 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:38:45,061 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:38:45,061 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:38:45,061 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:38:45,062 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:38:45,063 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:38:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-27 22:38:45,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-27 22:38:45,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:45,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:45,101 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:45,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1128398527, now seen corresponding path program 1 times [2019-11-27 22:38:45,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:45,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442500922] [2019-11-27 22:38:45,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:38:45,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442500922] [2019-11-27 22:38:45,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:45,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:45,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263543583] [2019-11-27 22:38:45,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:45,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:45,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:45,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:45,693 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-27 22:38:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:47,286 INFO L93 Difference]: Finished difference Result 687 states and 1203 transitions. [2019-11-27 22:38:47,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:47,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-27 22:38:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:47,318 INFO L225 Difference]: With dead ends: 687 [2019-11-27 22:38:47,318 INFO L226 Difference]: Without dead ends: 397 [2019-11-27 22:38:47,323 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-27 22:38:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-27 22:38:47,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-27 22:38:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-27 22:38:47,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-27 22:38:47,386 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 100 [2019-11-27 22:38:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:47,387 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-27 22:38:47,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-27 22:38:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-27 22:38:47,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:47,392 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:47,393 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:47,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:47,393 INFO L82 PathProgramCache]: Analyzing trace with hash -365392174, now seen corresponding path program 1 times [2019-11-27 22:38:47,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:47,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732396506] [2019-11-27 22:38:47,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:38:47,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732396506] [2019-11-27 22:38:47,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:47,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:47,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125727422] [2019-11-27 22:38:47,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:47,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:47,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:47,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:47,499 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-27 22:38:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:48,290 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-27 22:38:48,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:38:48,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-27 22:38:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:48,296 INFO L225 Difference]: With dead ends: 1054 [2019-11-27 22:38:48,297 INFO L226 Difference]: Without dead ends: 790 [2019-11-27 22:38:48,299 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-27 22:38:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-27 22:38:48,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-27 22:38:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-27 22:38:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2019-11-27 22:38:48,353 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 106 [2019-11-27 22:38:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:48,356 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2019-11-27 22:38:48,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2019-11-27 22:38:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-27 22:38:48,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:48,369 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:48,370 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:48,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:48,370 INFO L82 PathProgramCache]: Analyzing trace with hash -877508142, now seen corresponding path program 1 times [2019-11-27 22:38:48,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:48,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147150689] [2019-11-27 22:38:48,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-27 22:38:48,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147150689] [2019-11-27 22:38:48,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:48,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:48,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029043628] [2019-11-27 22:38:48,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:48,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:48,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:48,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:48,515 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 3 states. [2019-11-27 22:38:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:49,032 INFO L93 Difference]: Finished difference Result 2233 states and 3001 transitions. [2019-11-27 22:38:49,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:49,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-27 22:38:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:49,043 INFO L225 Difference]: With dead ends: 2233 [2019-11-27 22:38:49,043 INFO L226 Difference]: Without dead ends: 1445 [2019-11-27 22:38:49,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-27 22:38:49,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-27 22:38:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-27 22:38:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1496 transitions. [2019-11-27 22:38:49,074 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1496 transitions. Word has length 107 [2019-11-27 22:38:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:49,076 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1496 transitions. [2019-11-27 22:38:49,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1496 transitions. [2019-11-27 22:38:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-27 22:38:49,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:49,084 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:49,085 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:49,085 INFO L82 PathProgramCache]: Analyzing trace with hash 873346348, now seen corresponding path program 1 times [2019-11-27 22:38:49,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:49,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180920929] [2019-11-27 22:38:49,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-27 22:38:49,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180920929] [2019-11-27 22:38:49,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:49,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:49,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589678228] [2019-11-27 22:38:49,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:49,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:49,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:49,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:49,153 INFO L87 Difference]: Start difference. First operand 1183 states and 1496 transitions. Second operand 3 states. [2019-11-27 22:38:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:49,804 INFO L93 Difference]: Finished difference Result 2757 states and 3510 transitions. [2019-11-27 22:38:49,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:49,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-27 22:38:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:49,815 INFO L225 Difference]: With dead ends: 2757 [2019-11-27 22:38:49,816 INFO L226 Difference]: Without dead ends: 1576 [2019-11-27 22:38:49,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-27 22:38:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1314. [2019-11-27 22:38:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-27 22:38:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1658 transitions. [2019-11-27 22:38:49,858 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1658 transitions. Word has length 123 [2019-11-27 22:38:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:49,859 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1658 transitions. [2019-11-27 22:38:49,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1658 transitions. [2019-11-27 22:38:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-27 22:38:49,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:49,863 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:49,863 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash 5388463, now seen corresponding path program 1 times [2019-11-27 22:38:49,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:49,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872137619] [2019-11-27 22:38:49,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-27 22:38:49,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872137619] [2019-11-27 22:38:49,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:49,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:49,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264941747] [2019-11-27 22:38:49,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:49,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:49,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:49,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:49,958 INFO L87 Difference]: Start difference. First operand 1314 states and 1658 transitions. Second operand 3 states. [2019-11-27 22:38:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:50,445 INFO L93 Difference]: Finished difference Result 3281 states and 4119 transitions. [2019-11-27 22:38:50,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:50,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-27 22:38:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:50,455 INFO L225 Difference]: With dead ends: 3281 [2019-11-27 22:38:50,455 INFO L226 Difference]: Without dead ends: 1969 [2019-11-27 22:38:50,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-27 22:38:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-11-27 22:38:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-27 22:38:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1962 transitions. [2019-11-27 22:38:50,494 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1962 transitions. Word has length 134 [2019-11-27 22:38:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:50,495 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1962 transitions. [2019-11-27 22:38:50,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1962 transitions. [2019-11-27 22:38:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-27 22:38:50,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:50,499 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-27 22:38:50,499 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:50,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1459525699, now seen corresponding path program 1 times [2019-11-27 22:38:50,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:50,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101108078] [2019-11-27 22:38:50,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-27 22:38:50,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101108078] [2019-11-27 22:38:50,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:50,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:50,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341675217] [2019-11-27 22:38:50,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:38:50,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:50,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:38:50,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:38:50,613 INFO L87 Difference]: Start difference. First operand 1576 states and 1962 transitions. Second operand 4 states. [2019-11-27 22:38:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:51,456 INFO L93 Difference]: Finished difference Result 3286 states and 4070 transitions. [2019-11-27 22:38:51,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:38:51,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-27 22:38:51,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:51,465 INFO L225 Difference]: With dead ends: 3286 [2019-11-27 22:38:51,465 INFO L226 Difference]: Without dead ends: 1712 [2019-11-27 22:38:51,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:38:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2019-11-27 22:38:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1707. [2019-11-27 22:38:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-27 22:38:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2099 transitions. [2019-11-27 22:38:51,505 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2099 transitions. Word has length 142 [2019-11-27 22:38:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:51,505 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2099 transitions. [2019-11-27 22:38:51,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:38:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2099 transitions. [2019-11-27 22:38:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-27 22:38:51,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:51,511 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:51,511 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:51,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:51,512 INFO L82 PathProgramCache]: Analyzing trace with hash -822596485, now seen corresponding path program 1 times [2019-11-27 22:38:51,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:51,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176512163] [2019-11-27 22:38:51,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-27 22:38:51,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176512163] [2019-11-27 22:38:51,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:51,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:38:51,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124638647] [2019-11-27 22:38:51,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:38:51,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:51,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:38:51,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:38:51,604 INFO L87 Difference]: Start difference. First operand 1707 states and 2099 transitions. Second operand 5 states. [2019-11-27 22:38:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:52,746 INFO L93 Difference]: Finished difference Result 3805 states and 4667 transitions. [2019-11-27 22:38:52,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:38:52,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-11-27 22:38:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:52,758 INFO L225 Difference]: With dead ends: 3805 [2019-11-27 22:38:52,758 INFO L226 Difference]: Without dead ends: 2231 [2019-11-27 22:38:52,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:38:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-27 22:38:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2019-11-27 22:38:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-27 22:38:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2373 transitions. [2019-11-27 22:38:52,801 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2373 transitions. Word has length 146 [2019-11-27 22:38:52,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:52,802 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2373 transitions. [2019-11-27 22:38:52,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:38:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2373 transitions. [2019-11-27 22:38:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-27 22:38:52,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:52,806 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:52,806 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:52,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:52,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2101585002, now seen corresponding path program 1 times [2019-11-27 22:38:52,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:52,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75455222] [2019-11-27 22:38:52,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-27 22:38:52,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75455222] [2019-11-27 22:38:52,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:52,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:38:52,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950500335] [2019-11-27 22:38:52,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:52,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:52,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:52,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:52,863 INFO L87 Difference]: Start difference. First operand 1969 states and 2373 transitions. Second operand 3 states. [2019-11-27 22:38:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:53,354 INFO L93 Difference]: Finished difference Result 4067 states and 4887 transitions. [2019-11-27 22:38:53,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:53,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-27 22:38:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:53,363 INFO L225 Difference]: With dead ends: 4067 [2019-11-27 22:38:53,363 INFO L226 Difference]: Without dead ends: 1969 [2019-11-27 22:38:53,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:53,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-27 22:38:53,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-27 22:38:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-27 22:38:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2015 transitions. [2019-11-27 22:38:53,405 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2015 transitions. Word has length 149 [2019-11-27 22:38:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:53,405 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2015 transitions. [2019-11-27 22:38:53,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2015 transitions. [2019-11-27 22:38:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-27 22:38:53,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:53,409 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:53,409 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash -385356518, now seen corresponding path program 1 times [2019-11-27 22:38:53,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:53,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462476423] [2019-11-27 22:38:53,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-27 22:38:53,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462476423] [2019-11-27 22:38:53,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:53,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:38:53,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362542166] [2019-11-27 22:38:53,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:53,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:53,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:53,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:53,489 INFO L87 Difference]: Start difference. First operand 1838 states and 2015 transitions. Second operand 3 states. [2019-11-27 22:38:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:53,931 INFO L93 Difference]: Finished difference Result 3674 states and 4028 transitions. [2019-11-27 22:38:53,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:53,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-27 22:38:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:53,940 INFO L225 Difference]: With dead ends: 3674 [2019-11-27 22:38:53,940 INFO L226 Difference]: Without dead ends: 1838 [2019-11-27 22:38:53,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:38:53,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-27 22:38:53,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-27 22:38:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-27 22:38:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2010 transitions. [2019-11-27 22:38:53,982 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2010 transitions. Word has length 164 [2019-11-27 22:38:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:53,982 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2010 transitions. [2019-11-27 22:38:53,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2010 transitions. [2019-11-27 22:38:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-27 22:38:53,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:53,987 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:53,988 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:53,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:53,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1871280910, now seen corresponding path program 1 times [2019-11-27 22:38:53,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:53,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012446383] [2019-11-27 22:38:53,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-27 22:38:54,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012446383] [2019-11-27 22:38:54,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265555643] [2019-11-27 22:38:54,189 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-27 22:38:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:54,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:38:54,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:38:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-27 22:38:54,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:38:54,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-27 22:38:54,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596250282] [2019-11-27 22:38:54,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:54,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:54,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:54,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:38:54,454 INFO L87 Difference]: Start difference. First operand 1838 states and 2010 transitions. Second operand 3 states. [2019-11-27 22:38:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:54,918 INFO L93 Difference]: Finished difference Result 2757 states and 2995 transitions. [2019-11-27 22:38:54,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:54,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-27 22:38:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:54,931 INFO L225 Difference]: With dead ends: 2757 [2019-11-27 22:38:54,932 INFO L226 Difference]: Without dead ends: 2624 [2019-11-27 22:38:54,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:38:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-11-27 22:38:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1969. [2019-11-27 22:38:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-27 22:38:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2143 transitions. [2019-11-27 22:38:54,981 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2143 transitions. Word has length 193 [2019-11-27 22:38:54,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:54,982 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2143 transitions. [2019-11-27 22:38:54,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2143 transitions. [2019-11-27 22:38:54,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-27 22:38:54,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:54,987 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-11-27 22:38:55,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:55,193 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:55,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:55,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1923073630, now seen corresponding path program 1 times [2019-11-27 22:38:55,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:55,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155662053] [2019-11-27 22:38:55,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-27 22:38:55,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155662053] [2019-11-27 22:38:55,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824404638] [2019-11-27 22:38:55,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:55,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:38:55,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:38:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-27 22:38:55,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:38:55,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-27 22:38:55,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089525435] [2019-11-27 22:38:55,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:38:55,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:55,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:38:55,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:38:55,675 INFO L87 Difference]: Start difference. First operand 1969 states and 2143 transitions. Second operand 3 states. [2019-11-27 22:38:56,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:56,091 INFO L93 Difference]: Finished difference Result 1971 states and 2144 transitions. [2019-11-27 22:38:56,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:38:56,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-11-27 22:38:56,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:56,104 INFO L225 Difference]: With dead ends: 1971 [2019-11-27 22:38:56,104 INFO L226 Difference]: Without dead ends: 1969 [2019-11-27 22:38:56,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:38:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-27 22:38:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-27 22:38:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-27 22:38:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1989 transitions. [2019-11-27 22:38:56,156 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1989 transitions. Word has length 222 [2019-11-27 22:38:56,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:56,156 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1989 transitions. [2019-11-27 22:38:56,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:38:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1989 transitions. [2019-11-27 22:38:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-27 22:38:56,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:56,162 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, 4, 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, 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] [2019-11-27 22:38:56,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:38:56,370 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:56,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:56,371 INFO L82 PathProgramCache]: Analyzing trace with hash -451722141, now seen corresponding path program 1 times [2019-11-27 22:38:56,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:56,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165796656] [2019-11-27 22:38:56,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-27 22:38:57,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165796656] [2019-11-27 22:38:57,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:57,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-27 22:38:57,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265242244] [2019-11-27 22:38:57,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-27 22:38:57,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:57,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-27 22:38:57,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2019-11-27 22:38:57,291 INFO L87 Difference]: Start difference. First operand 1838 states and 1989 transitions. Second operand 13 states. [2019-11-27 22:38:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:58,754 INFO L93 Difference]: Finished difference Result 4256 states and 4613 transitions. [2019-11-27 22:38:58,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 22:38:58,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 235 [2019-11-27 22:38:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:58,766 INFO L225 Difference]: With dead ends: 4256 [2019-11-27 22:38:58,766 INFO L226 Difference]: Without dead ends: 2420 [2019-11-27 22:38:58,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-11-27 22:38:58,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-11-27 22:38:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1896. [2019-11-27 22:38:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-11-27 22:38:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2050 transitions. [2019-11-27 22:38:58,808 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2050 transitions. Word has length 235 [2019-11-27 22:38:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:58,808 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 2050 transitions. [2019-11-27 22:38:58,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-27 22:38:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2050 transitions. [2019-11-27 22:38:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-27 22:38:58,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:58,815 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:38:58,815 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:58,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:58,816 INFO L82 PathProgramCache]: Analyzing trace with hash 580910416, now seen corresponding path program 1 times [2019-11-27 22:38:58,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:58,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514818379] [2019-11-27 22:38:58,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:38:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-27 22:38:58,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514818379] [2019-11-27 22:38:58,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:38:58,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 22:38:58,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671197424] [2019-11-27 22:38:58,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:38:58,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:38:58,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:38:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:38:58,981 INFO L87 Difference]: Start difference. First operand 1896 states and 2050 transitions. Second operand 6 states. [2019-11-27 22:38:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:38:59,768 INFO L93 Difference]: Finished difference Result 4221 states and 4562 transitions. [2019-11-27 22:38:59,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:38:59,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2019-11-27 22:38:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:38:59,777 INFO L225 Difference]: With dead ends: 4221 [2019-11-27 22:38:59,778 INFO L226 Difference]: Without dead ends: 2327 [2019-11-27 22:38:59,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:38:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2019-11-27 22:38:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2027. [2019-11-27 22:38:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-11-27 22:38:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2180 transitions. [2019-11-27 22:38:59,818 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2180 transitions. Word has length 262 [2019-11-27 22:38:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:38:59,819 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 2180 transitions. [2019-11-27 22:38:59,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:38:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2180 transitions. [2019-11-27 22:38:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-11-27 22:38:59,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:38:59,826 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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, 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, 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] [2019-11-27 22:38:59,826 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:38:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:38:59,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1379127925, now seen corresponding path program 1 times [2019-11-27 22:38:59,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:38:59,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407181537] [2019-11-27 22:38:59,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:38:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-27 22:39:00,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407181537] [2019-11-27 22:39:00,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:00,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:39:00,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983829410] [2019-11-27 22:39:00,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:39:00,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:00,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:39:00,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:39:00,095 INFO L87 Difference]: Start difference. First operand 2027 states and 2180 transitions. Second operand 5 states. [2019-11-27 22:39:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:01,130 INFO L93 Difference]: Finished difference Result 4969 states and 5350 transitions. [2019-11-27 22:39:01,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:39:01,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 273 [2019-11-27 22:39:01,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:01,139 INFO L225 Difference]: With dead ends: 4969 [2019-11-27 22:39:01,139 INFO L226 Difference]: Without dead ends: 1896 [2019-11-27 22:39:01,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:39:01,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-11-27 22:39:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2019-11-27 22:39:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-11-27 22:39:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 1999 transitions. [2019-11-27 22:39:01,175 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 1999 transitions. Word has length 273 [2019-11-27 22:39:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:01,176 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 1999 transitions. [2019-11-27 22:39:01,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:39:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 1999 transitions. [2019-11-27 22:39:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-27 22:39:01,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:01,183 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2019-11-27 22:39:01,183 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:01,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:01,184 INFO L82 PathProgramCache]: Analyzing trace with hash 990654567, now seen corresponding path program 1 times [2019-11-27 22:39:01,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:01,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747065682] [2019-11-27 22:39:01,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-27 22:39:01,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747065682] [2019-11-27 22:39:01,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:01,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:39:01,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729089516] [2019-11-27 22:39:01,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:01,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:01,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:01,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:01,402 INFO L87 Difference]: Start difference. First operand 1896 states and 1999 transitions. Second operand 4 states. [2019-11-27 22:39:01,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:01,926 INFO L93 Difference]: Finished difference Result 3788 states and 4007 transitions. [2019-11-27 22:39:01,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:01,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2019-11-27 22:39:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:01,929 INFO L225 Difference]: With dead ends: 3788 [2019-11-27 22:39:01,929 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:39:01,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:39:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:39:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:39:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:39:01,936 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2019-11-27 22:39:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:01,936 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:39:01,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:39:01,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:39:01,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:39:02,167 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 104 [2019-11-27 22:39:02,373 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 110 [2019-11-27 22:39:02,958 WARN L192 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-11-27 22:39:03,588 WARN L192 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-11-27 22:39:03,593 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-27 22:39:03,593 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-27 22:39:03,593 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,594 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,594 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,594 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,594 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,594 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,594 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-27 22:39:03,595 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-27 22:39:03,595 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-27 22:39:03,595 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-27 22:39:03,595 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-27 22:39:03,595 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-27 22:39:03,595 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-27 22:39:03,596 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-27 22:39:03,596 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-27 22:39:03,596 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-27 22:39:03,596 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,596 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,596 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,597 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,597 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,597 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,597 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-27 22:39:03,597 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-27 22:39:03,598 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-27 22:39:03,598 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-27 22:39:03,598 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-27 22:39:03,598 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-27 22:39:03,598 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-27 22:39:03,598 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-27 22:39:03,599 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-27 22:39:03,599 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-27 22:39:03,599 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-27 22:39:03,599 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-27 22:39:03,599 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-27 22:39:03,599 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-27 22:39:03,600 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-27 22:39:03,600 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,600 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,600 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,600 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,600 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,601 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-27 22:39:03,601 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-27 22:39:03,601 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-27 22:39:03,601 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-27 22:39:03,601 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-27 22:39:03,601 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-27 22:39:03,602 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-27 22:39:03,602 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-27 22:39:03,602 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-27 22:39:03,603 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= 1 ~a7~0)) (.cse13 (= ~a16~0 6)) (.cse11 (= 15 ~a8~0))) (let ((.cse8 (<= ~a21~0 0)) (.cse0 (= ~a16~0 4)) (.cse4 (not .cse11)) (.cse9 (not .cse13)) (.cse10 (= ~a17~0 1)) (.cse12 (= ~a16~0 5)) (.cse1 (= ~a12~0 8)) (.cse5 (not .cse7)) (.cse2 (<= ~a17~0 0)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1))) (or (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse2 .cse3 (<= ~a20~0 0)) (and .cse4 .cse5 .cse3 .cse6) (and .cse7 .cse8 .cse9 .cse10) (and .cse7 .cse8 .cse6) (and .cse5 .cse10 .cse1 .cse3 .cse11) (and .cse7 (<= 15 ~a8~0) .cse3 .cse12) (and .cse2 .cse3 .cse12) (and .cse10 .cse3 .cse6 (not .cse0)) (and .cse4 .cse9 .cse5 .cse3) (and .cse7 .cse9 .cse2 .cse3) (and .cse7 (or (and .cse10 .cse6 .cse3) (and .cse3 .cse6 .cse12))) (and .cse5 .cse1 .cse2 .cse3 .cse11 .cse13) (and .cse5 .cse2 .cse3 .cse6)))) [2019-11-27 22:39:03,603 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,603 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,603 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,604 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,604 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,604 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-27 22:39:03,604 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-27 22:39:03,604 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-27 22:39:03,604 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-27 22:39:03,605 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-27 22:39:03,605 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-27 22:39:03,605 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-27 22:39:03,605 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-27 22:39:03,605 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-27 22:39:03,605 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-27 22:39:03,606 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-27 22:39:03,606 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-27 22:39:03,606 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-27 22:39:03,606 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-27 22:39:03,606 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,606 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,607 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,607 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,607 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,607 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-27 22:39:03,607 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-27 22:39:03,607 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-27 22:39:03,608 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-27 22:39:03,608 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-27 22:39:03,608 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-27 22:39:03,608 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-27 22:39:03,608 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-27 22:39:03,608 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-27 22:39:03,609 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,609 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,609 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,609 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,609 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-27 22:39:03,609 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,610 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-27 22:39:03,610 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-27 22:39:03,610 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-27 22:39:03,610 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-27 22:39:03,610 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-27 22:39:03,610 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-27 22:39:03,611 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-27 22:39:03,611 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:39:03,611 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-27 22:39:03,611 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-27 22:39:03,611 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-27 22:39:03,611 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-27 22:39:03,612 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-27 22:39:03,612 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-27 22:39:03,612 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,612 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse7 (= 1 ~a7~0)) (.cse13 (= ~a16~0 6)) (.cse11 (= 15 ~a8~0))) (let ((.cse8 (<= ~a21~0 0)) (.cse0 (= ~a16~0 4)) (.cse4 (not .cse11)) (.cse9 (not .cse13)) (.cse10 (= ~a17~0 1)) (.cse12 (= ~a16~0 5)) (.cse1 (= ~a12~0 8)) (.cse5 (not .cse7)) (.cse2 (<= ~a17~0 0)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1))) (or (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse2 .cse3 (<= ~a20~0 0)) (and .cse4 .cse5 .cse3 .cse6) (and .cse7 .cse8 .cse9 .cse10) (and .cse7 .cse8 .cse6) (and .cse5 .cse10 .cse1 .cse3 .cse11) (and .cse7 (<= 15 ~a8~0) .cse3 .cse12) (and .cse2 .cse3 .cse12) (and .cse10 .cse3 .cse6 (not .cse0)) (and .cse4 .cse9 .cse5 .cse3) (and .cse7 .cse9 .cse2 .cse3) (and .cse7 (or (and .cse10 .cse6 .cse3) (and .cse3 .cse6 .cse12))) (and .cse5 .cse1 .cse2 .cse3 .cse11 .cse13) (and .cse5 .cse2 .cse3 .cse6)))) [2019-11-27 22:39:03,612 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,613 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,613 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,613 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,613 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-27 22:39:03,613 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-27 22:39:03,613 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-27 22:39:03,614 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-27 22:39:03,614 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-27 22:39:03,614 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-27 22:39:03,614 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-27 22:39:03,614 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-27 22:39:03,614 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,615 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,615 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,615 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,615 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,615 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-27 22:39:03,615 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:39:03,616 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-27 22:39:03,616 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-27 22:39:03,616 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-27 22:39:03,616 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-27 22:39:03,616 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-27 22:39:03,616 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-27 22:39:03,616 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-27 22:39:03,617 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-27 22:39:03,617 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-27 22:39:03,617 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-27 22:39:03,617 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-27 22:39:03,617 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,617 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,618 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,618 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,618 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-27 22:39:03,618 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,618 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,618 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-27 22:39:03,619 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-27 22:39:03,619 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:39:03,619 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-27 22:39:03,619 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-27 22:39:03,619 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-27 22:39:03,619 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-27 22:39:03,619 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-27 22:39:03,620 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-27 22:39:03,620 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-27 22:39:03,620 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-27 22:39:03,620 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-27 22:39:03,620 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-27 22:39:03,620 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,621 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,621 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,621 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,621 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,621 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-27 22:39:03,621 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,622 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-27 22:39:03,622 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-27 22:39:03,622 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-27 22:39:03,622 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-27 22:39:03,622 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-27 22:39:03,622 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-27 22:39:03,622 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-27 22:39:03,623 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-27 22:39:03,623 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-27 22:39:03,623 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-27 22:39:03,623 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-27 22:39:03,623 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:39:03,623 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 476) no Hoare annotation was computed. [2019-11-27 22:39:03,624 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-27 22:39:03,624 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-27 22:39:03,624 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-27 22:39:03,624 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,624 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,624 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,625 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,625 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,625 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:03,625 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-27 22:39:03,625 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-27 22:39:03,625 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-27 22:39:03,625 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-27 22:39:03,626 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-27 22:39:03,626 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-27 22:39:03,626 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-27 22:39:03,626 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-27 22:39:03,626 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-27 22:39:03,626 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-27 22:39:03,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:39:03 BoogieIcfgContainer [2019-11-27 22:39:03,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:39:03,654 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:39:03,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:39:03,655 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:39:03,655 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:38:44" (3/4) ... [2019-11-27 22:39:03,659 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:39:03,698 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:39:03,699 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:39:03,903 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:39:03,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:39:03,905 INFO L168 Benchmark]: Toolchain (without parser) took 21387.26 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 533.2 MB). Free memory was 951.0 MB in the beginning and 1.3 GB in the end (delta: -340.0 MB). Peak memory consumption was 193.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:03,905 INFO L168 Benchmark]: CDTParser took 0.69 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:39:03,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:03,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:03,907 INFO L168 Benchmark]: Boogie Preprocessor took 72.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:03,907 INFO L168 Benchmark]: RCFGBuilder took 1474.57 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: 112.4 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:03,907 INFO L168 Benchmark]: TraceAbstraction took 18678.08 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 370.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -302.5 MB). Peak memory consumption was 556.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:03,908 INFO L168 Benchmark]: Witness Printer took 249.30 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:03,910 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.69 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 801.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1474.57 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: 112.4 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18678.08 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 370.7 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -302.5 MB). Peak memory consumption was 556.7 MB. Max. memory is 11.5 GB. * Witness Printer took 249.30 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 476]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a20 == 1)) || (((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1)) || ((1 == a7 && a21 <= 0) && a20 == 1)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || (((1 == a7 && 15 <= a8) && a21 == 1) && a16 == 5)) || ((a17 <= 0 && a21 == 1) && a16 == 5)) || (((a17 == 1 && a21 == 1) && a20 == 1) && !(a16 == 4))) || (((!(15 == a8) && !(a16 == 6)) && !(1 == a7)) && a21 == 1)) || (((1 == a7 && !(a16 == 6)) && a17 <= 0) && a21 == 1)) || (1 == a7 && (((a17 == 1 && a20 == 1) && a21 == 1) || ((a21 == 1 && a20 == 1) && a16 == 5)))) || (((((!(1 == a7) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a16 == 6)) || (((!(1 == a7) && a17 <= 0) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a20 == 1)) || (((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1)) || ((1 == a7 && a21 <= 0) && a20 == 1)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || (((1 == a7 && 15 <= a8) && a21 == 1) && a16 == 5)) || ((a17 <= 0 && a21 == 1) && a16 == 5)) || (((a17 == 1 && a21 == 1) && a20 == 1) && !(a16 == 4))) || (((!(15 == a8) && !(a16 == 6)) && !(1 == a7)) && a21 == 1)) || (((1 == a7 && !(a16 == 6)) && a17 <= 0) && a21 == 1)) || (1 == a7 && (((a17 == 1 && a20 == 1) && a21 == 1) || ((a21 == 1 && a20 == 1) && a16 == 5)))) || (((((!(1 == a7) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a16 == 6)) || (((!(1 == a7) && a17 <= 0) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 16.8s, OverallIterations: 15, TraceHistogramMax: 5, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, HoareTripleCheckerStatistics: 1123 SDtfs, 3017 SDslu, 162 SDs, 0 SdLazy, 7807 SolverSat, 1027 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 440 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2027occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 3056 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 58 NumberOfFragments, 437 HoareAnnotationTreeSize, 3 FomulaSimplifications, 52946 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2776 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3055 NumberOfCodeBlocks, 3055 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3038 ConstructedInterpolants, 0 QuantifiedInterpolants, 2147869 SizeOfPredicates, 2 NumberOfNonLiveVariables, 765 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 2445/2542 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...