java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:35:17,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:35:17,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:35:17,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:35:17,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:35:17,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:35:17,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:35:17,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:35:17,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:35:17,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:35:17,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:35:17,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:35:17,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:35:17,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:35:17,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:35:17,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:35:17,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:35:17,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:35:17,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:35:17,877 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:35:17,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:35:17,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:35:17,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:35:17,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:35:17,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:35:17,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:35:17,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:35:17,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:35:17,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:35:17,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:35:17,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:35:17,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:35:17,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:35:17,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:35:17,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:35:17,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:35:17,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:35:17,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:35:17,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:35:17,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:35:17,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:35:17,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 20:35:17,933 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:35:17,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:35:17,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:35:17,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:35:17,937 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:35:17,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:35:17,937 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:35:17,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:35:17,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:35:17,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:35:17,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:35:17,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:35:17,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:35:17,938 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:35:17,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:35:17,939 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:35:17,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:35:17,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:35:17,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:35:17,941 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:35:17,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:35:17,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:35:17,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:35:17,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:35:17,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:35:17,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:35:17,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:35:17,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:35:17,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:35:17,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:35:17,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:35:17,990 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:35:17,991 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:35:17,991 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:35:17,992 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label28.c [2019-09-07 20:35:18,049 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f0c8398f/e399317c9d544446b36847524f195dcb/FLAG18fbb9538 [2019-09-07 20:35:18,700 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:35:18,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label28.c [2019-09-07 20:35:18,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f0c8398f/e399317c9d544446b36847524f195dcb/FLAG18fbb9538 [2019-09-07 20:35:18,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f0c8398f/e399317c9d544446b36847524f195dcb [2019-09-07 20:35:18,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:35:18,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:35:18,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:35:18,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:35:18,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:35:18,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:35:18" (1/1) ... [2019-09-07 20:35:18,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@194b4a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:35:18, skipping insertion in model container [2019-09-07 20:35:18,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:35:18" (1/1) ... [2019-09-07 20:35:18,894 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:35:18,969 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:35:19,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:35:19,782 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:35:20,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:35:20,056 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:35:20,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:35:20 WrapperNode [2019-09-07 20:35:20,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:35:20,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:35:20,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:35:20,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:35:20,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:35:20" (1/1) ... [2019-09-07 20:35:20,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:35:20" (1/1) ... [2019-09-07 20:35:20,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:35:20" (1/1) ... [2019-09-07 20:35:20,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:35:20" (1/1) ... [2019-09-07 20:35:20,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:35:20" (1/1) ... [2019-09-07 20:35:20,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:35:20" (1/1) ... [2019-09-07 20:35:20,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:35:20" (1/1) ... [2019-09-07 20:35:20,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:35:20,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:35:20,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:35:20,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:35:20,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:35:20" (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-09-07 20:35:20,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:35:20,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:35:20,342 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:35:20,342 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:35:20,342 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:35:20,342 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:35:20,343 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:35:20,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:35:20,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:35:20,343 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:35:20,344 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:35:20,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:35:20,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:35:23,307 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:35:23,307 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:35:23,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:35:23 BoogieIcfgContainer [2019-09-07 20:35:23,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:35:23,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:35:23,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:35:23,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:35:23,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:35:18" (1/3) ... [2019-09-07 20:35:23,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f36a1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:35:23, skipping insertion in model container [2019-09-07 20:35:23,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:35:20" (2/3) ... [2019-09-07 20:35:23,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f36a1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:35:23, skipping insertion in model container [2019-09-07 20:35:23,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:35:23" (3/3) ... [2019-09-07 20:35:23,318 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label28.c [2019-09-07 20:35:23,329 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:35:23,337 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:35:23,355 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:35:23,392 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:35:23,393 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:35:23,393 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:35:23,393 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:35:23,394 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:35:23,394 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:35:23,394 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:35:23,394 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:35:23,394 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:35:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:35:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-07 20:35:23,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:35:23,432 INFO L399 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] [2019-09-07 20:35:23,434 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:35:23,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:35:23,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1729511136, now seen corresponding path program 1 times [2019-09-07 20:35:23,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:35:23,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:35:23,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:23,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:35:23,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:35:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:35:23,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:35:23,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:35:23,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:35:23,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:35:23,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:35:23,862 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 3 states. [2019-09-07 20:35:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:35:26,689 INFO L93 Difference]: Finished difference Result 1191 states and 2149 transitions. [2019-09-07 20:35:26,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:35:26,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-09-07 20:35:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:35:26,713 INFO L225 Difference]: With dead ends: 1191 [2019-09-07 20:35:26,714 INFO L226 Difference]: Without dead ends: 692 [2019-09-07 20:35:26,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:35:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-09-07 20:35:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2019-09-07 20:35:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-09-07 20:35:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1154 transitions. [2019-09-07 20:35:26,825 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1154 transitions. Word has length 38 [2019-09-07 20:35:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:35:26,826 INFO L475 AbstractCegarLoop]: Abstraction has 690 states and 1154 transitions. [2019-09-07 20:35:26,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:35:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1154 transitions. [2019-09-07 20:35:26,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 20:35:26,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:35:26,832 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:35:26,833 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:35:26,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:35:26,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1320950948, now seen corresponding path program 1 times [2019-09-07 20:35:26,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:35:26,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:35:26,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:26,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:35:26,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:35:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:35:27,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:35:27,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:35:27,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:35:27,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:35:27,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:35:27,078 INFO L87 Difference]: Start difference. First operand 690 states and 1154 transitions. Second operand 6 states. [2019-09-07 20:35:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:35:31,550 INFO L93 Difference]: Finished difference Result 2057 states and 3487 transitions. [2019-09-07 20:35:31,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:35:31,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-09-07 20:35:31,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:35:31,561 INFO L225 Difference]: With dead ends: 2057 [2019-09-07 20:35:31,561 INFO L226 Difference]: Without dead ends: 1373 [2019-09-07 20:35:31,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:35:31,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2019-09-07 20:35:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1342. [2019-09-07 20:35:31,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-07 20:35:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2245 transitions. [2019-09-07 20:35:31,635 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2245 transitions. Word has length 111 [2019-09-07 20:35:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:35:31,638 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 2245 transitions. [2019-09-07 20:35:31,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:35:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2245 transitions. [2019-09-07 20:35:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-07 20:35:31,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:35:31,652 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:35:31,653 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:35:31,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:35:31,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1532585933, now seen corresponding path program 1 times [2019-09-07 20:35:31,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:35:31,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:35:31,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:31,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:35:31,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:35:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:35:31,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:35:31,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:35:31,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:35:31,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:35:31,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:35:31,880 INFO L87 Difference]: Start difference. First operand 1342 states and 2245 transitions. Second operand 5 states. [2019-09-07 20:35:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:35:36,003 INFO L93 Difference]: Finished difference Result 3990 states and 6801 transitions. [2019-09-07 20:35:36,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:35:36,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-09-07 20:35:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:35:36,023 INFO L225 Difference]: With dead ends: 3990 [2019-09-07 20:35:36,023 INFO L226 Difference]: Without dead ends: 2654 [2019-09-07 20:35:36,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:35:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-07 20:35:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2615. [2019-09-07 20:35:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2615 states. [2019-09-07 20:35:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 3768 transitions. [2019-09-07 20:35:36,133 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 3768 transitions. Word has length 114 [2019-09-07 20:35:36,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:35:36,142 INFO L475 AbstractCegarLoop]: Abstraction has 2615 states and 3768 transitions. [2019-09-07 20:35:36,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:35:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 3768 transitions. [2019-09-07 20:35:36,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-07 20:35:36,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:35:36,145 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:35:36,146 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:35:36,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:35:36,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1482212639, now seen corresponding path program 1 times [2019-09-07 20:35:36,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:35:36,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:35:36,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:36,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:35:36,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:35:36,315 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:35:36,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:35:36,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:35:36,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:35:36,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:35:36,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:35:36,317 INFO L87 Difference]: Start difference. First operand 2615 states and 3768 transitions. Second operand 6 states. [2019-09-07 20:35:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:35:40,206 INFO L93 Difference]: Finished difference Result 6572 states and 9809 transitions. [2019-09-07 20:35:40,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:35:40,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-09-07 20:35:40,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:35:40,234 INFO L225 Difference]: With dead ends: 6572 [2019-09-07 20:35:40,234 INFO L226 Difference]: Without dead ends: 3963 [2019-09-07 20:35:40,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:35:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2019-09-07 20:35:40,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3910. [2019-09-07 20:35:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3910 states. [2019-09-07 20:35:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3910 states to 3910 states and 5486 transitions. [2019-09-07 20:35:40,377 INFO L78 Accepts]: Start accepts. Automaton has 3910 states and 5486 transitions. Word has length 124 [2019-09-07 20:35:40,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:35:40,378 INFO L475 AbstractCegarLoop]: Abstraction has 3910 states and 5486 transitions. [2019-09-07 20:35:40,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:35:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3910 states and 5486 transitions. [2019-09-07 20:35:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-07 20:35:40,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:35:40,380 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:35:40,380 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:35:40,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:35:40,381 INFO L82 PathProgramCache]: Analyzing trace with hash 934964196, now seen corresponding path program 1 times [2019-09-07 20:35:40,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:35:40,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:35:40,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:40,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:35:40,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:35:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:35:40,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:35:40,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:35:40,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:35:40,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:35:40,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:35:40,527 INFO L87 Difference]: Start difference. First operand 3910 states and 5486 transitions. Second operand 5 states. [2019-09-07 20:35:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:35:45,945 INFO L93 Difference]: Finished difference Result 10080 states and 14344 transitions. [2019-09-07 20:35:45,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:35:45,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-07 20:35:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:35:45,981 INFO L225 Difference]: With dead ends: 10080 [2019-09-07 20:35:45,981 INFO L226 Difference]: Without dead ends: 6176 [2019-09-07 20:35:45,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:35:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6176 states. [2019-09-07 20:35:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6176 to 6153. [2019-09-07 20:35:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2019-09-07 20:35:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8483 transitions. [2019-09-07 20:35:46,188 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8483 transitions. Word has length 134 [2019-09-07 20:35:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:35:46,188 INFO L475 AbstractCegarLoop]: Abstraction has 6153 states and 8483 transitions. [2019-09-07 20:35:46,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:35:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8483 transitions. [2019-09-07 20:35:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-07 20:35:46,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:35:46,191 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:35:46,191 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:35:46,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:35:46,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1847889797, now seen corresponding path program 1 times [2019-09-07 20:35:46,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:35:46,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:35:46,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:46,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:35:46,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:35:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:35:46,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:35:46,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:35:46,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:35:46,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:35:46,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:35:46,344 INFO L87 Difference]: Start difference. First operand 6153 states and 8483 transitions. Second operand 4 states. [2019-09-07 20:35:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:35:50,603 INFO L93 Difference]: Finished difference Result 17390 states and 25968 transitions. [2019-09-07 20:35:50,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:35:50,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-09-07 20:35:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:35:50,655 INFO L225 Difference]: With dead ends: 17390 [2019-09-07 20:35:50,655 INFO L226 Difference]: Without dead ends: 11550 [2019-09-07 20:35:50,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09-07 20:35:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11550 states. [2019-09-07 20:35:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11550 to 11543. [2019-09-07 20:35:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11543 states. [2019-09-07 20:35:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11543 states to 11543 states and 16881 transitions. [2019-09-07 20:35:50,994 INFO L78 Accepts]: Start accepts. Automaton has 11543 states and 16881 transitions. Word has length 149 [2019-09-07 20:35:50,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:35:50,996 INFO L475 AbstractCegarLoop]: Abstraction has 11543 states and 16881 transitions. [2019-09-07 20:35:50,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:35:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 11543 states and 16881 transitions. [2019-09-07 20:35:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-07 20:35:51,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:35:51,001 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:35:51,001 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:35:51,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:35:51,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1907783618, now seen corresponding path program 1 times [2019-09-07 20:35:51,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:35:51,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:35:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:51,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:35:51,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:35:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-07 20:35:51,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:35:51,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:35:51,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:35:51,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:35:51,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:35:51,179 INFO L87 Difference]: Start difference. First operand 11543 states and 16881 transitions. Second operand 4 states. [2019-09-07 20:35:56,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:35:56,496 INFO L93 Difference]: Finished difference Result 29334 states and 43920 transitions. [2019-09-07 20:35:56,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:35:56,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-07 20:35:56,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:35:56,572 INFO L225 Difference]: With dead ends: 29334 [2019-09-07 20:35:56,572 INFO L226 Difference]: Without dead ends: 18104 [2019-09-07 20:35:56,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09-07 20:35:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18104 states. [2019-09-07 20:35:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18104 to 17762. [2019-09-07 20:35:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17762 states. [2019-09-07 20:35:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17762 states to 17762 states and 25808 transitions. [2019-09-07 20:35:56,993 INFO L78 Accepts]: Start accepts. Automaton has 17762 states and 25808 transitions. Word has length 194 [2019-09-07 20:35:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:35:56,993 INFO L475 AbstractCegarLoop]: Abstraction has 17762 states and 25808 transitions. [2019-09-07 20:35:56,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:35:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 17762 states and 25808 transitions. [2019-09-07 20:35:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-07 20:35:57,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:35:57,000 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:35:57,001 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:35:57,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:35:57,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2071151099, now seen corresponding path program 1 times [2019-09-07 20:35:57,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:35:57,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:35:57,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:57,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:35:57,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:35:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:35:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 140 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:35:57,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:35:57,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:35:57,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:35:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:35:57,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:35:57,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:35:57,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:35:57,702 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:35:57,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:35:57,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:35:57,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:35:57,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:35:57,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:35:57,709 INFO L87 Difference]: Start difference. First operand 17762 states and 25808 transitions. Second operand 9 states. [2019-09-07 20:36:02,073 WARN L188 SmtUtils]: Spent 853.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-09-07 20:36:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:36:07,983 INFO L93 Difference]: Finished difference Result 46824 states and 69303 transitions. [2019-09-07 20:36:07,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 20:36:07,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2019-09-07 20:36:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:36:08,100 INFO L225 Difference]: With dead ends: 46824 [2019-09-07 20:36:08,100 INFO L226 Difference]: Without dead ends: 25583 [2019-09-07 20:36:08,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2019-09-07 20:36:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25583 states. [2019-09-07 20:36:08,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25583 to 23077. [2019-09-07 20:36:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23077 states. [2019-09-07 20:36:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23077 states to 23077 states and 30122 transitions. [2019-09-07 20:36:08,855 INFO L78 Accepts]: Start accepts. Automaton has 23077 states and 30122 transitions. Word has length 224 [2019-09-07 20:36:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:36:08,856 INFO L475 AbstractCegarLoop]: Abstraction has 23077 states and 30122 transitions. [2019-09-07 20:36:08,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:36:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 23077 states and 30122 transitions. [2019-09-07 20:36:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-09-07 20:36:08,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:36:08,865 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:36:08,865 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:36:08,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:36:08,866 INFO L82 PathProgramCache]: Analyzing trace with hash -862059873, now seen corresponding path program 1 times [2019-09-07 20:36:08,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:36:08,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:36:08,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:08,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:36:08,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:36:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 156 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:36:09,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:36:09,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:36:09,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:36:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:36:09,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:36:09,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:36:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 156 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-07 20:36:09,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:36:09,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:36:09,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:36:09,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:36:09,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:36:09,785 INFO L87 Difference]: Start difference. First operand 23077 states and 30122 transitions. Second operand 9 states. [2019-09-07 20:36:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:36:15,424 INFO L93 Difference]: Finished difference Result 62988 states and 92198 transitions. [2019-09-07 20:36:15,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 20:36:15,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 420 [2019-09-07 20:36:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:36:15,618 INFO L225 Difference]: With dead ends: 62988 [2019-09-07 20:36:15,619 INFO L226 Difference]: Without dead ends: 40224 [2019-09-07 20:36:15,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:36:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40224 states. [2019-09-07 20:36:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40224 to 36997. [2019-09-07 20:36:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36997 states. [2019-09-07 20:36:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36997 states to 36997 states and 53251 transitions. [2019-09-07 20:36:16,912 INFO L78 Accepts]: Start accepts. Automaton has 36997 states and 53251 transitions. Word has length 420 [2019-09-07 20:36:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:36:16,914 INFO L475 AbstractCegarLoop]: Abstraction has 36997 states and 53251 transitions. [2019-09-07 20:36:16,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:36:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 36997 states and 53251 transitions. [2019-09-07 20:36:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2019-09-07 20:36:16,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:36:16,938 INFO L399 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:36:16,938 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:36:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:36:16,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1985454439, now seen corresponding path program 1 times [2019-09-07 20:36:16,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:36:16,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:36:16,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:16,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:36:16,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:36:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 332 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 20:36:18,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:36:18,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:36:18,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:36:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:36:18,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:36:18,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:36:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 332 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 20:36:18,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:36:18,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:36:18,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:36:18,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:36:18,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:36:18,759 INFO L87 Difference]: Start difference. First operand 36997 states and 53251 transitions. Second operand 9 states. [2019-09-07 20:36:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:36:25,496 INFO L93 Difference]: Finished difference Result 79250 states and 123852 transitions. [2019-09-07 20:36:25,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:36:25,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 513 [2019-09-07 20:36:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:36:25,682 INFO L225 Difference]: With dead ends: 79250 [2019-09-07 20:36:25,682 INFO L226 Difference]: Without dead ends: 42566 [2019-09-07 20:36:25,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:36:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42566 states. [2019-09-07 20:36:26,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42566 to 41483. [2019-09-07 20:36:26,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41483 states. [2019-09-07 20:36:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41483 states to 41483 states and 57378 transitions. [2019-09-07 20:36:26,885 INFO L78 Accepts]: Start accepts. Automaton has 41483 states and 57378 transitions. Word has length 513 [2019-09-07 20:36:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:36:26,886 INFO L475 AbstractCegarLoop]: Abstraction has 41483 states and 57378 transitions. [2019-09-07 20:36:26,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:36:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 41483 states and 57378 transitions. [2019-09-07 20:36:26,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2019-09-07 20:36:26,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:36:26,903 INFO L399 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:36:26,903 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:36:26,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:36:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1787418104, now seen corresponding path program 1 times [2019-09-07 20:36:26,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:36:26,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:36:26,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:26,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:36:26,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:36:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 206 proven. 261 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:36:28,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:36:28,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:36:28,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:36:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:36:28,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:36:28,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:36:28,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:36:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 437 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-07 20:36:28,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:36:28,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 20:36:28,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:36:28,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:36:28,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:36:28,776 INFO L87 Difference]: Start difference. First operand 41483 states and 57378 transitions. Second operand 14 states. [2019-09-07 20:36:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:36:40,426 INFO L93 Difference]: Finished difference Result 78055 states and 103418 transitions. [2019-09-07 20:36:40,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 20:36:40,427 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 542 [2019-09-07 20:36:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:36:40,550 INFO L225 Difference]: With dead ends: 78055 [2019-09-07 20:36:40,551 INFO L226 Difference]: Without dead ends: 36253 [2019-09-07 20:36:40,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 572 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=504, Invalid=2148, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 20:36:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36253 states. [2019-09-07 20:36:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36253 to 35131. [2019-09-07 20:36:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35131 states. [2019-09-07 20:36:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35131 states to 35131 states and 42520 transitions. [2019-09-07 20:36:41,419 INFO L78 Accepts]: Start accepts. Automaton has 35131 states and 42520 transitions. Word has length 542 [2019-09-07 20:36:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:36:41,420 INFO L475 AbstractCegarLoop]: Abstraction has 35131 states and 42520 transitions. [2019-09-07 20:36:41,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:36:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 35131 states and 42520 transitions. [2019-09-07 20:36:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2019-09-07 20:36:41,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:36:41,430 INFO L399 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:36:41,431 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:36:41,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:36:41,431 INFO L82 PathProgramCache]: Analyzing trace with hash 328707242, now seen corresponding path program 1 times [2019-09-07 20:36:41,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:36:41,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:36:41,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:41,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:36:41,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:36:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-09-07 20:36:42,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:36:42,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:36:42,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:36:42,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:36:42,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:36:42,096 INFO L87 Difference]: Start difference. First operand 35131 states and 42520 transitions. Second operand 4 states. [2019-09-07 20:36:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:36:45,532 INFO L93 Difference]: Finished difference Result 72141 states and 87139 transitions. [2019-09-07 20:36:45,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:36:45,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 579 [2019-09-07 20:36:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:36:45,646 INFO L225 Difference]: With dead ends: 72141 [2019-09-07 20:36:45,646 INFO L226 Difference]: Without dead ends: 36685 [2019-09-07 20:36:45,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09-07 20:36:45,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36685 states. [2019-09-07 20:36:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36685 to 34457. [2019-09-07 20:36:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34457 states. [2019-09-07 20:36:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34457 states to 34457 states and 41336 transitions. [2019-09-07 20:36:46,391 INFO L78 Accepts]: Start accepts. Automaton has 34457 states and 41336 transitions. Word has length 579 [2019-09-07 20:36:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:36:46,393 INFO L475 AbstractCegarLoop]: Abstraction has 34457 states and 41336 transitions. [2019-09-07 20:36:46,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:36:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 34457 states and 41336 transitions. [2019-09-07 20:36:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2019-09-07 20:36:46,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:36:46,407 INFO L399 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:36:46,407 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:36:46,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:36:46,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1693310260, now seen corresponding path program 1 times [2019-09-07 20:36:46,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:36:46,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:36:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:46,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:36:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:36:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 286 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 20:36:47,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:36:47,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:36:47,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:36:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:36:47,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:36:47,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:36:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 286 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 20:36:47,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:36:47,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:36:47,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:36:47,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:36:47,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:36:47,438 INFO L87 Difference]: Start difference. First operand 34457 states and 41336 transitions. Second operand 9 states. [2019-09-07 20:36:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:36:51,689 INFO L93 Difference]: Finished difference Result 64872 states and 76366 transitions. [2019-09-07 20:36:51,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 20:36:51,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 601 [2019-09-07 20:36:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:36:51,765 INFO L225 Difference]: With dead ends: 64872 [2019-09-07 20:36:51,765 INFO L226 Difference]: Without dead ends: 30728 [2019-09-07 20:36:51,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:36:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30728 states. [2019-09-07 20:36:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30728 to 28441. [2019-09-07 20:36:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28441 states. [2019-09-07 20:36:52,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28441 states to 28441 states and 31382 transitions. [2019-09-07 20:36:52,264 INFO L78 Accepts]: Start accepts. Automaton has 28441 states and 31382 transitions. Word has length 601 [2019-09-07 20:36:52,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:36:52,265 INFO L475 AbstractCegarLoop]: Abstraction has 28441 states and 31382 transitions. [2019-09-07 20:36:52,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:36:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 28441 states and 31382 transitions. [2019-09-07 20:36:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2019-09-07 20:36:52,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:36:52,288 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:36:52,288 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:36:52,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:36:52,289 INFO L82 PathProgramCache]: Analyzing trace with hash -682264862, now seen corresponding path program 1 times [2019-09-07 20:36:52,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:36:52,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:36:52,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:52,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:36:52,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:36:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 138 proven. 2 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2019-09-07 20:36:52,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:36:52,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:36:52,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:36:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:36:52,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:36:52,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:36:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-09-07 20:36:53,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:36:53,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:36:53,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:36:53,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:36:53,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:36:53,282 INFO L87 Difference]: Start difference. First operand 28441 states and 31382 transitions. Second operand 3 states. [2019-09-07 20:36:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:36:54,938 INFO L93 Difference]: Finished difference Result 56867 states and 62757 transitions. [2019-09-07 20:36:54,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:36:54,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 688 [2019-09-07 20:36:54,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:36:54,997 INFO L225 Difference]: With dead ends: 56867 [2019-09-07 20:36:54,997 INFO L226 Difference]: Without dead ends: 28739 [2019-09-07 20:36:55,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 689 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-09-07 20:36:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28739 states. [2019-09-07 20:36:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28739 to 28432. [2019-09-07 20:36:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28432 states. [2019-09-07 20:36:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28432 states to 28432 states and 31347 transitions. [2019-09-07 20:36:55,341 INFO L78 Accepts]: Start accepts. Automaton has 28432 states and 31347 transitions. Word has length 688 [2019-09-07 20:36:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:36:55,342 INFO L475 AbstractCegarLoop]: Abstraction has 28432 states and 31347 transitions. [2019-09-07 20:36:55,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:36:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 28432 states and 31347 transitions. [2019-09-07 20:36:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2019-09-07 20:36:55,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:36:55,357 INFO L399 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:36:55,358 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:36:55,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:36:55,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1366037352, now seen corresponding path program 1 times [2019-09-07 20:36:55,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:36:55,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:36:55,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:55,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:36:55,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:36:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:36:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2019-09-07 20:36:56,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:36:56,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:36:56,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:36:56,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:36:56,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:36:56,491 INFO L87 Difference]: Start difference. First operand 28432 states and 31347 transitions. Second operand 4 states. [2019-09-07 20:36:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:36:59,842 INFO L93 Difference]: Finished difference Result 68872 states and 76348 transitions. [2019-09-07 20:36:59,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:36:59,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 687 [2019-09-07 20:36:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:36:59,945 INFO L225 Difference]: With dead ends: 68872 [2019-09-07 20:36:59,945 INFO L226 Difference]: Without dead ends: 40753 [2019-09-07 20:36:59,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09-07 20:37:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40753 states. [2019-09-07 20:37:00,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40753 to 35212. [2019-09-07 20:37:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35212 states. [2019-09-07 20:37:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35212 states to 35212 states and 38269 transitions. [2019-09-07 20:37:00,475 INFO L78 Accepts]: Start accepts. Automaton has 35212 states and 38269 transitions. Word has length 687 [2019-09-07 20:37:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:37:00,475 INFO L475 AbstractCegarLoop]: Abstraction has 35212 states and 38269 transitions. [2019-09-07 20:37:00,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:37:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 35212 states and 38269 transitions. [2019-09-07 20:37:00,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2019-09-07 20:37:00,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:37:00,500 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 20:37:00,501 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:37:00,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:37:00,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1663803785, now seen corresponding path program 1 times [2019-09-07 20:37:00,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:37:00,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:37:00,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:37:00,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:37:00,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:37:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:37:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 177 proven. 650 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2019-09-07 20:37:01,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:37:01,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:37:01,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:37:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:37:01,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:37:01,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:37:01,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:37:01,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:37:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1228 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 1061 trivial. 0 not checked. [2019-09-07 20:37:02,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:37:02,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-09-07 20:37:02,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:37:02,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:37:02,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:37:02,442 INFO L87 Difference]: Start difference. First operand 35212 states and 38269 transitions. Second operand 11 states. [2019-09-07 20:37:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:37:17,628 INFO L93 Difference]: Finished difference Result 90159 states and 98298 transitions. [2019-09-07 20:37:17,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 20:37:17,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 780 [2019-09-07 20:37:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:37:17,713 INFO L225 Difference]: With dead ends: 90159 [2019-09-07 20:37:17,713 INFO L226 Difference]: Without dead ends: 55260 [2019-09-07 20:37:17,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=416, Invalid=1936, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 20:37:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55260 states. [2019-09-07 20:37:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55260 to 49253. [2019-09-07 20:37:18,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49253 states. [2019-09-07 20:37:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49253 states to 49253 states and 52712 transitions. [2019-09-07 20:37:18,275 INFO L78 Accepts]: Start accepts. Automaton has 49253 states and 52712 transitions. Word has length 780 [2019-09-07 20:37:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:37:18,276 INFO L475 AbstractCegarLoop]: Abstraction has 49253 states and 52712 transitions. [2019-09-07 20:37:18,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:37:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 49253 states and 52712 transitions. [2019-09-07 20:37:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2019-09-07 20:37:18,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:37:18,316 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:37:18,316 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:37:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:37:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash 841193403, now seen corresponding path program 1 times [2019-09-07 20:37:18,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:37:18,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:37:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:37:18,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:37:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:37:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:37:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1461 backedges. 506 proven. 112 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2019-09-07 20:37:19,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:37:19,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:37:19,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:37:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:37:19,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:37:19,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:37:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1461 backedges. 1085 proven. 2 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2019-09-07 20:37:21,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:37:21,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-09-07 20:37:21,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:37:21,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:37:21,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:37:21,044 INFO L87 Difference]: Start difference. First operand 49253 states and 52712 transitions. Second operand 9 states. [2019-09-07 20:37:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:37:27,674 INFO L93 Difference]: Finished difference Result 113531 states and 122913 transitions. [2019-09-07 20:37:27,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:37:27,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 967 [2019-09-07 20:37:27,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:37:27,768 INFO L225 Difference]: With dead ends: 113531 [2019-09-07 20:37:27,768 INFO L226 Difference]: Without dead ends: 53250 [2019-09-07 20:37:27,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 988 GetRequests, 973 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:37:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53250 states. [2019-09-07 20:37:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53250 to 41816. [2019-09-07 20:37:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41816 states. [2019-09-07 20:37:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41816 states to 41816 states and 43642 transitions. [2019-09-07 20:37:28,320 INFO L78 Accepts]: Start accepts. Automaton has 41816 states and 43642 transitions. Word has length 967 [2019-09-07 20:37:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:37:28,320 INFO L475 AbstractCegarLoop]: Abstraction has 41816 states and 43642 transitions. [2019-09-07 20:37:28,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:37:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 41816 states and 43642 transitions. [2019-09-07 20:37:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1099 [2019-09-07 20:37:28,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:37:28,491 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:37:28,491 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:37:28,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:37:28,492 INFO L82 PathProgramCache]: Analyzing trace with hash 369858186, now seen corresponding path program 1 times [2019-09-07 20:37:28,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:37:28,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:37:28,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:37:28,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:37:28,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:37:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:37:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 205 proven. 1195 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2019-09-07 20:37:30,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:37:30,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:37:30,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:37:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:37:31,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:37:31,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:37:31,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:37:31,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:37:31,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:37:31,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:37:31,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:37:31,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:37:31,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:37:31,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:37:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 1757 trivial. 0 not checked. [2019-09-07 20:37:32,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:37:32,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2019-09-07 20:37:32,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:37:32,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:37:32,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:37:32,190 INFO L87 Difference]: Start difference. First operand 41816 states and 43642 transitions. Second operand 13 states. [2019-09-07 20:37:46,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:37:46,113 INFO L93 Difference]: Finished difference Result 94237 states and 98206 transitions. [2019-09-07 20:37:46,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 20:37:46,114 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1098 [2019-09-07 20:37:46,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:37:46,115 INFO L225 Difference]: With dead ends: 94237 [2019-09-07 20:37:46,116 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 20:37:46,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1199 GetRequests, 1140 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=688, Invalid=2972, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 20:37:46,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 20:37:46,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 20:37:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 20:37:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 20:37:46,184 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1098 [2019-09-07 20:37:46,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:37:46,185 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 20:37:46,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:37:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 20:37:46,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 20:37:46,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 20:37:50,877 WARN L188 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 1177 DAG size of output: 843 [2019-09-07 20:37:53,134 WARN L188 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 1177 DAG size of output: 843 [2019-09-07 20:38:12,369 WARN L188 SmtUtils]: Spent 18.26 s on a formula simplification. DAG size of input: 1154 DAG size of output: 212 [2019-09-07 20:38:30,044 WARN L188 SmtUtils]: Spent 17.62 s on a formula simplification. DAG size of input: 1103 DAG size of output: 216 [2019-09-07 20:38:39,586 WARN L188 SmtUtils]: Spent 9.52 s on a formula simplification. DAG size of input: 737 DAG size of output: 161 [2019-09-07 20:38:49,057 WARN L188 SmtUtils]: Spent 9.46 s on a formula simplification. DAG size of input: 737 DAG size of output: 161 [2019-09-07 20:39:14,703 WARN L188 SmtUtils]: Spent 25.59 s on a formula simplification. DAG size of input: 1163 DAG size of output: 231 [2019-09-07 20:39:14,707 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:39:14,708 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a29~0 |old(~a29~0)|) (= ~a2~0 |old(~a2~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|)) [2019-09-07 20:39:14,708 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:39:14,708 INFO L443 ceAbstractionStarter]: For program point calculate_output2EXIT(lines 1658 1758) no Hoare annotation was computed. [2019-09-07 20:39:14,708 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,708 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,709 INFO L439 ceAbstractionStarter]: At program point calculate_output2ENTRY(lines 1658 1758) the Hoare annotation is: (let ((.cse9 (not (<= (+ |old(~a0~0)| 61) 0))) (.cse0 (not (< 0 (+ |old(~a4~0)| 86)))) (.cse43 (+ |old(~a29~0)| 144))) (let ((.cse39 (+ |old(~a29~0)| 127)) (.cse38 (= 4 ~a2~0)) (.cse37 (and .cse9 .cse0 (= 1 |old(~a2~0)|) (not (< 0 .cse43)))) (.cse4 (not (<= |old(~a2~0)| 1))) (.cse36 (= ~a2~0 |old(~a2~0)|)) (.cse42 (+ |old(~a29~0)| 16)) (.cse11 (= 3 |old(~a2~0)|)) (.cse30 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse34 (= 4 |old(~a2~0)|)) (.cse17 (= 2 ~a2~0)) (.cse32 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse8 (not (= 2 |old(~a2~0)|))) (.cse16 (= ~a29~0 |old(~a29~0)|)) (.cse31 (= 3 ~a2~0)) (.cse19 (= ~a4~0 |old(~a4~0)|)) (.cse18 (= ~a0~0 |old(~a0~0)|))) (let ((.cse25 (and (and .cse16 .cse31 .cse19) .cse18)) (.cse20 (or .cse32 .cse8)) (.cse5 (and .cse16 .cse17 .cse18 .cse19)) (.cse33 (not (<= (+ |old(~a29~0)| 145) 0))) (.cse27 (or .cse11 .cse30 .cse34)) (.cse10 (not (<= 0 (+ |old(~a29~0)| 192415)))) (.cse21 (not (<= .cse43 0))) (.cse2 (not (< 0 .cse42))) (.cse15 (not (<= .cse42 0))) (.cse13 (not (<= 3 |old(~a2~0)|))) (.cse7 (not (<= (+ |old(~a0~0)| 104) 0))) (.cse3 (and .cse16 .cse36 .cse18 .cse19)) (.cse14 (or .cse32 .cse37 .cse4)) (.cse29 (and .cse16 .cse38 .cse18 .cse19)) (.cse28 (not .cse34)) (.cse35 (not (<= .cse39 0))) (.cse26 (forall ((v_~a0~0_834 Int)) (let ((.cse41 (div v_~a0~0_834 5))) (let ((.cse40 (+ (* 123 .cse41) 123))) (or (not (<= |old(~a0~0)| (+ (* 5 (div .cse40 10)) 5))) (= (mod (+ (* 3 .cse41) 3) 10) 0) (not (< v_~a0~0_834 0)) (not (< .cse40 0)) (not (<= (+ v_~a0~0_834 61) 0)) (= (mod v_~a0~0_834 5) 0)))))) (.cse23 (and .cse16 .cse18 .cse31 .cse19)) (.cse22 (not (<= 0 (+ |old(~a0~0)| 83)))) (.cse1 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse12 (not (< 0 (+ |old(~a0~0)| 98)))) (.cse6 (not (<= 0 .cse39))) (.cse24 (not .cse11))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse3 .cse4) (or .cse3 (or .cse10 .cse9 .cse0 .cse11 .cse1 .cse12 .cse13)) (or .cse3 .cse6 .cse14 .cse15) (or .cse9 .cse0 .cse1 .cse2 .cse8 .cse5) (or (and .cse16 (and .cse17 .cse18 .cse19)) (or .cse20 .cse21)) (or .cse1 .cse2 .cse22 .cse23 .cse24) (or (or .cse2 .cse24) .cse1 .cse25 .cse26) (or .cse27 .cse1 .cse5 .cse8) (or .cse9 .cse23 .cse1 (not (<= 0 (+ |old(~a4~0)| 74))) .cse24) (or .cse10 .cse28 .cse1 .cse7 .cse29 .cse15) (or .cse29 .cse1 (or .cse0 .cse28 .cse30 .cse6)) (or .cse9 (and .cse16 (and .cse31 .cse19) .cse18) (or .cse32 .cse12 .cse24)) (or .cse25 (or .cse32 .cse24 .cse33)) (or .cse3 (or .cse1 .cse7 .cse4)) (or (or .cse1 (or .cse8 .cse21) .cse22) (and .cse18 (and .cse16 (and .cse17 .cse19)))) (or .cse0 .cse1 .cse30 .cse23 .cse24) (or .cse28 .cse1 .cse2 .cse22 .cse29) (or .cse20 .cse5 .cse6) (or .cse32 .cse11 .cse7 .cse34 .cse3) (or (and (or (or .cse1 .cse24 .cse33) .cse7) (or .cse0 .cse1 .cse35 .cse7 .cse24)) (and (and .cse18 .cse19) .cse16 .cse36)) (or .cse3 .cse10 .cse1 .cse27) (or .cse10 .cse28 .cse32 .cse29) (or .cse29 (or .cse28 .cse1 (not (<= 96176 |old(~a29~0)|)) .cse12)) (or (or .cse1 (or .cse37 .cse4 .cse21)) (and (and .cse16 .cse36 .cse19) .cse18)) (or .cse3 (or .cse11 .cse1 .cse13 .cse7 .cse15) .cse6) (or (or (or .cse32 .cse2) .cse24) (and .cse16 .cse18 .cse19 .cse31)) (or .cse0 .cse1 .cse2 .cse7 .cse24 .cse23) (or (or (or .cse28 .cse32) .cse12) (and (and .cse38 .cse19) .cse16 .cse18)) (or .cse32 .cse30 .cse3) (or .cse11 .cse1 .cse2 .cse3 .cse13 .cse34) (or (or .cse9 .cse1 .cse12 .cse4 .cse15) .cse3) (or .cse0 .cse11 .cse1 .cse13 .cse7 .cse34 .cse3) (or .cse9 .cse3 .cse14) (or .cse29 (or .cse0 .cse28 .cse1) .cse26) (or .cse1 .cse35 .cse26 .cse24 .cse23) (or .cse23 (and (or .cse9 .cse1 .cse6 .cse22 .cse24) (or .cse9 .cse0 .cse1 .cse12 .cse6 .cse24))))))) [2019-09-07 20:39:14,709 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,709 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,709 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,709 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,709 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,710 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,710 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,710 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-09-07 20:39:14,710 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-09-07 20:39:14,710 INFO L443 ceAbstractionStarter]: For program point calculate_output2FINAL(lines 1658 1758) no Hoare annotation was computed. [2019-09-07 20:39:14,711 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,711 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,711 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,711 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,711 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-09-07 20:39:14,711 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-09-07 20:39:14,712 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-09-07 20:39:14,712 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,712 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,712 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,712 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,712 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,712 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,712 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,712 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,712 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-09-07 20:39:14,712 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-09-07 20:39:14,713 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-07 20:39:14,713 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-09-07 20:39:14,713 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-09-07 20:39:14,713 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,713 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,713 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,713 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,713 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,713 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,713 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,714 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,714 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,714 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,714 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-07 20:39:14,714 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-09-07 20:39:14,714 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-09-07 20:39:14,714 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,714 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,714 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,714 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,715 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,715 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,715 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,715 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,715 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,715 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-09-07 20:39:14,715 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,715 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-09-07 20:39:14,715 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,715 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,715 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,716 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-09-07 20:39:14,716 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,716 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-09-07 20:39:14,716 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-09-07 20:39:14,716 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-07 20:39:14,716 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-07 20:39:14,716 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,716 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,716 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,716 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,717 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,717 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,717 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,717 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,717 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,717 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,717 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,717 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-09-07 20:39:14,717 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,718 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,719 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,719 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,719 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,719 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,719 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,719 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-09-07 20:39:14,719 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,719 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-09-07 20:39:14,719 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-09-07 20:39:14,719 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,719 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,720 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,720 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,720 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,720 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,720 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,720 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,720 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,720 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,721 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,721 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,721 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-09-07 20:39:14,721 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,721 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-09-07 20:39:14,721 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-09-07 20:39:14,721 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-09-07 20:39:14,721 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-07 20:39:14,721 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-09-07 20:39:14,721 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-09-07 20:39:14,722 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,722 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,722 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,722 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,722 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,722 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,722 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,722 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,723 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,723 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,723 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,723 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,723 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,723 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,723 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-09-07 20:39:14,723 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,723 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-07 20:39:14,724 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-09-07 20:39:14,724 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,724 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,724 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,724 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,724 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,724 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,724 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,724 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,724 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,725 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,725 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-09-07 20:39:14,725 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-07 20:39:14,725 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,725 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-09-07 20:39:14,725 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,725 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,725 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,725 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-09-07 20:39:14,725 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-09-07 20:39:14,726 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-09-07 20:39:14,726 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-09-07 20:39:14,726 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,727 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 23 1656) the Hoare annotation is: (let ((.cse8 (= 3 |old(~a2~0)|)) (.cse39 (+ |old(~a29~0)| 16))) (let ((.cse7 (not (<= |old(~a2~0)| 1))) (.cse23 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse18 (not (= 2 |old(~a2~0)|))) (.cse42 (= 2 ~a2~0)) (.cse10 (= 4 |old(~a2~0)|)) (.cse41 (= ~a2~0 |old(~a2~0)|)) (.cse27 (= 3 ~a2~0)) (.cse2 (not (< 0 .cse39))) (.cse5 (not (< 0 (+ |old(~a4~0)| 86)))) (.cse13 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse4 (not .cse8)) (.cse25 (= ~a29~0 |old(~a29~0)|)) (.cse26 (= ~a0~0 |old(~a0~0)|)) (.cse36 (= 4 ~a2~0)) (.cse28 (= ~a4~0 |old(~a4~0)|)) (.cse40 (+ |old(~a29~0)| 127))) (let ((.cse29 (not (<= (+ |old(~a29~0)| 145) 0))) (.cse30 (not (<= .cse40 0))) (.cse24 (and .cse25 .cse26 .cse36 .cse28)) (.cse34 (and (or .cse13 .cse2 .cse4) (or .cse5 .cse13 .cse4))) (.cse35 (and (let ((.cse45 (<= (+ ~a0~0 147) 0))) (or (and .cse25 (< 0 (+ ~a4~0 86)) .cse41 .cse45 .cse27 .cse28) (and .cse25 (< 0 (+ ~a29~0 16)) .cse41 .cse45 .cse27 .cse28))) .cse26)) (.cse31 (forall ((v_~a0~0_834 Int)) (let ((.cse44 (div v_~a0~0_834 5))) (let ((.cse43 (+ (* 123 .cse44) 123))) (or (not (<= |old(~a0~0)| (+ (* 5 (div .cse43 10)) 5))) (= (mod (+ (* 3 .cse44) 3) 10) 0) (not (< v_~a0~0_834 0)) (not (< .cse43 0)) (not (<= (+ v_~a0~0_834 61) 0)) (= (mod v_~a0~0_834 5) 0)))))) (.cse16 (not (<= 0 (+ |old(~a29~0)| 192415)))) (.cse20 (or .cse8 .cse13 .cse10)) (.cse9 (not (<= 3 |old(~a2~0)|))) (.cse19 (and .cse25 .cse42 .cse26 .cse28)) (.cse33 (or .cse23 .cse18)) (.cse38 (and (and .cse25 .cse42 .cse28) .cse26)) (.cse32 (not (<= (+ |old(~a29~0)| 144) 0))) (.cse12 (not .cse10)) (.cse15 (and .cse25 .cse36 .cse26 .cse28)) (.cse21 (not (<= (+ |old(~a0~0)| 104) 0))) (.cse0 (and .cse25 .cse26 .cse27 .cse28)) (.cse3 (not (<= 0 (+ |old(~a0~0)| 83)))) (.cse11 (not (<= (+ |old(~a0~0)| 61) 0))) (.cse1 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse17 (not (< 0 (+ |old(~a0~0)| 98)))) (.cse6 (and .cse25 .cse41 .cse26 .cse28)) (.cse14 (not (<= 0 .cse40))) (.cse37 (or .cse23 .cse7)) (.cse22 (not (<= .cse39 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse1 .cse2 .cse6 .cse7) (or .cse8 .cse1 .cse2 .cse9 .cse10 .cse6) (or .cse11 .cse5 .cse1 .cse6 .cse7) (or .cse1 (or .cse5 .cse12 .cse13 .cse14) .cse15) (or .cse6 (or .cse16 .cse11 .cse5 .cse8 .cse1 .cse17 .cse9)) (or .cse11 .cse5 .cse1 .cse2 .cse18 .cse19) (or .cse20 .cse1 .cse19 .cse18) (or .cse6 (or .cse8 .cse1 .cse14 .cse9 .cse21 .cse22)) (or .cse11 .cse0 .cse1 (not (<= 0 (+ |old(~a4~0)| 74))) .cse4) (or .cse16 .cse12 .cse1 .cse21 .cse15 .cse22) (or .cse16 .cse12 .cse23 .cse24) (or .cse6 (or .cse1 .cse21 .cse7)) (or (and .cse25 .cse26 (and .cse27 .cse28)) (or .cse23 .cse4 .cse29)) (or .cse1 .cse0 .cse30 .cse31 .cse4) (or .cse0 (and (or (or .cse1 .cse4 .cse29) .cse21) (or .cse5 .cse1 .cse30 .cse21 .cse4))) (or .cse11 (or .cse23 .cse17 .cse4) (and (and .cse25 .cse27 .cse28) .cse26)) (or .cse24 (or .cse12 .cse1 (not (<= 96176 |old(~a29~0)|)) .cse17)) (or .cse6 (or .cse1 (or .cse7 .cse32))) (or .cse19 .cse33 .cse14) (or .cse34 .cse1 .cse35 .cse31) (or .cse34 .cse35 .cse1 .cse22) (or (or (or .cse23 .cse2) .cse4) (and .cse25 .cse26 .cse28 .cse27)) (or (or .cse17 (or .cse12 .cse23)) (and .cse25 .cse26 (and .cse36 .cse28))) (or .cse5 .cse1 .cse2 .cse21 .cse4 .cse0) (or .cse23 .cse13 .cse6) (or (or .cse11 .cse1 .cse17 .cse7 .cse22) .cse6) (or (and .cse25 (and .cse26 .cse36 .cse28)) (or .cse5 .cse12 .cse1) .cse31) (or .cse11 .cse6 .cse37) (or .cse16 .cse6 .cse1 .cse20) (or .cse5 .cse8 .cse1 .cse9 .cse21 .cse10 .cse6) (or .cse5 .cse1 .cse14 .cse19 .cse21 .cse18) (or .cse38 (or .cse33 .cse32)) (or .cse38 (or .cse1 (or .cse18 .cse32) .cse3)) (or .cse12 .cse1 .cse2 .cse15 .cse3) (or .cse23 .cse8 .cse6 .cse21 .cse10) (or .cse0 (and (or .cse11 .cse1 .cse14 .cse3 .cse4) (or .cse11 .cse5 .cse1 .cse17 .cse14 .cse4))) (or .cse6 .cse14 .cse37 .cse22))))) [2019-09-07 20:39:14,727 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,727 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,727 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,727 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,727 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,727 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,727 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,727 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,727 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-09-07 20:39:14,728 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-09-07 20:39:14,728 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-09-07 20:39:14,728 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,728 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-09-07 20:39:14,728 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-09-07 20:39:14,728 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,728 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,728 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,728 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,728 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,729 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,729 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,729 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,729 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,729 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 103) no Hoare annotation was computed. [2019-09-07 20:39:14,729 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,729 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,729 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,729 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,730 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-09-07 20:39:14,730 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-09-07 20:39:14,730 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-09-07 20:39:14,730 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,730 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,730 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,730 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,730 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,730 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,730 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,731 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,731 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,731 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,731 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,731 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-09-07 20:39:14,731 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,731 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-09-07 20:39:14,731 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,731 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-09-07 20:39:14,731 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-09-07 20:39:14,731 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-09-07 20:39:14,732 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,732 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-09-07 20:39:14,732 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-09-07 20:39:14,732 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,732 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-09-07 20:39:14,732 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-09-07 20:39:14,732 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,732 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-09-07 20:39:14,733 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-09-07 20:39:14,733 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,733 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,733 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,733 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,733 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,733 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,733 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,733 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,734 INFO L439 ceAbstractionStarter]: At program point L1655(line 1655) the Hoare annotation is: (let ((.cse14 (= 3 |old(~a2~0)|)) (.cse45 (+ |old(~a29~0)| 16))) (let ((.cse31 (= 4 ~a2~0)) (.cse8 (= 2 ~a2~0)) (.cse44 (+ |old(~a29~0)| 127)) (.cse32 (= 4 |old(~a2~0)|)) (.cse4 (not (<= |old(~a2~0)| 1))) (.cse7 (= ~a29~0 |old(~a29~0)|)) (.cse38 (= ~a2~0 |old(~a2~0)|)) (.cse29 (= 3 ~a2~0)) (.cse11 (= ~a4~0 |old(~a4~0)|)) (.cse10 (= ~a0~0 |old(~a0~0)|)) (.cse2 (not (< 0 .cse45))) (.cse0 (not (< 0 (+ |old(~a4~0)| 86)))) (.cse28 (not (<= (+ |old(~a0~0)| 147) 0))) (.cse22 (not .cse14)) (.cse47 (< 0 (+ ~a29~0 16))) (.cse40 (< 0 (+ ~a4~0 86))) (.cse41 (<= (+ ~a0~0 61) 0)) (.cse30 (not (<= (+ |old(~a4~0)| 89) 0))) (.cse17 (not (= 2 |old(~a2~0)|)))) (let ((.cse6 (or .cse30 .cse17)) (.cse9 (or .cse47 .cse40 (not (= 3 calculate_output_~input)) .cse41)) (.cse20 (not (<= 0 (+ |old(~a0~0)| 83)))) (.cse33 (and (or .cse28 .cse2 .cse22) (or .cse0 .cse28 .cse22))) (.cse34 (and (let ((.cse46 (<= (+ ~a0~0 147) 0))) (or (and .cse7 .cse40 .cse38 .cse46 .cse29 .cse11) (and .cse7 .cse47 .cse38 .cse46 .cse29 .cse11))) .cse10)) (.cse15 (not (< 0 (+ |old(~a0~0)| 98)))) (.cse25 (not (<= .cse45 0))) (.cse5 (not (<= (+ |old(~a0~0)| 61) 0))) (.cse36 (or .cse30 .cse4)) (.cse13 (not (<= 0 (+ |old(~a29~0)| 192415)))) (.cse23 (or .cse14 .cse28 .cse32)) (.cse16 (not (<= 3 |old(~a2~0)|))) (.cse3 (and .cse7 .cse38 .cse10 .cse11)) (.cse37 (not (<= (+ |old(~a29~0)| 145) 0))) (.cse12 (not (<= 0 .cse44))) (.cse18 (and .cse7 .cse8 .cse10 .cse11)) (.cse24 (not (<= (+ |old(~a0~0)| 104) 0))) (.cse27 (and .cse7 .cse31 .cse10 .cse11)) (.cse26 (not .cse32)) (.cse39 (not (<= .cse44 0))) (.cse35 (forall ((v_~a0~0_834 Int)) (let ((.cse43 (div v_~a0~0_834 5))) (let ((.cse42 (+ (* 123 .cse43) 123))) (or (not (<= |old(~a0~0)| (+ (* 5 (div .cse42 10)) 5))) (= (mod (+ (* 3 .cse43) 3) 10) 0) (not (< v_~a0~0_834 0)) (not (< .cse42 0)) (not (<= (+ v_~a0~0_834 61) 0)) (= (mod v_~a0~0_834 5) 0)))))) (.cse21 (and .cse7 .cse10 .cse29 .cse11)) (.cse1 (not (<= (+ |old(~a4~0)| 42) 0))) (.cse19 (not (<= (+ |old(~a29~0)| 144) 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse0 .cse1 .cse3 .cse4) (or .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (or .cse3 (or .cse13 .cse5 .cse0 .cse14 .cse1 .cse15 .cse16)) (or .cse5 .cse0 .cse1 .cse2 .cse17 .cse18) (or (and .cse7 (and .cse8 .cse10 .cse11)) (or .cse6 .cse19)) (or .cse1 .cse2 .cse20 .cse21 .cse22) (or .cse23 .cse1 .cse18 .cse17) (or .cse3 (or .cse14 .cse1 .cse12 .cse16 .cse24 .cse25)) (or .cse5 .cse21 .cse1 (not (<= 0 (+ |old(~a4~0)| 74))) .cse22) (or .cse13 .cse26 .cse1 .cse24 .cse27 .cse25) (or .cse27 .cse1 (or .cse0 .cse26 .cse28 .cse12)) (or .cse5 (and .cse7 (and .cse29 .cse11) .cse10) (or .cse30 .cse15 .cse22)) (or .cse3 (or .cse1 .cse24 .cse4)) (or (or .cse1 (or .cse17 .cse19) .cse20) (and .cse10 (and .cse7 (and .cse8 .cse11)) .cse9)) (or .cse26 .cse1 .cse2 .cse20 .cse27) (or (or .cse15 (or .cse26 .cse30)) (and (and .cse31 .cse11) .cse7 .cse10)) (or (and .cse7 .cse10 .cse31 .cse11) (or .cse26 .cse1 (not (<= 96176 |old(~a29~0)|)) .cse15)) (or .cse30 .cse14 .cse24 .cse32 .cse3) (or .cse13 .cse26 .cse30 .cse27) (or (and (or .cse5 .cse1 .cse12 .cse20 .cse22) (or .cse5 .cse0 .cse1 .cse15 .cse12 .cse22)) .cse21) (or .cse33 .cse1 .cse34 .cse35) (or .cse33 .cse34 .cse1 .cse25) (or (or (or .cse30 .cse2) .cse22) (and .cse7 .cse10 .cse11 .cse29)) (or .cse0 .cse1 .cse2 .cse24 .cse22 .cse21) (or .cse30 .cse28 .cse3) (or .cse14 .cse1 .cse2 .cse3 .cse16 .cse32) (or (or .cse5 .cse1 .cse15 .cse4 .cse25) .cse3) (or .cse12 .cse36 .cse25 .cse3) (or .cse5 .cse3 .cse36) (or (or .cse30 .cse22 .cse37) (and (and .cse7 .cse29 .cse11) .cse10)) (or .cse13 .cse3 .cse1 .cse23) (or .cse0 .cse14 .cse1 .cse16 .cse24 .cse32 .cse3) (or (and (and .cse10 .cse11) .cse7 .cse38) (and (or (or .cse1 .cse22 .cse37) .cse24) (or .cse0 .cse1 .cse39 .cse24 .cse22))) (or .cse0 .cse1 .cse12 .cse18 .cse24 .cse17) (or .cse27 (or .cse0 .cse26 .cse1) .cse35) (or .cse1 .cse39 .cse35 .cse22 .cse21) (or (and (and .cse7 .cse38 .cse11 (or .cse40 (not (= 1 ~a2~0)) .cse41)) .cse10) (or .cse1 (or .cse4 .cse19))))))) [2019-09-07 20:39:14,735 INFO L443 ceAbstractionStarter]: For program point L1655-1(line 1655) no Hoare annotation was computed. [2019-09-07 20:39:14,735 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,735 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-07 20:39:14,735 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-07 20:39:14,735 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-09-07 20:39:14,735 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,735 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,735 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,735 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,736 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,736 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,737 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,737 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,737 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,737 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,737 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-09-07 20:39:14,737 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-09-07 20:39:14,737 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,737 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,737 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-09-07 20:39:14,738 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-09-07 20:39:14,738 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-07 20:39:14,738 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,738 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,738 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,738 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-09-07 20:39:14,738 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-09-07 20:39:14,738 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,738 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,739 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,739 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,739 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,739 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,739 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,739 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,739 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,739 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-09-07 20:39:14,739 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-09-07 20:39:14,740 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,740 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,740 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,740 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,740 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,740 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,740 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,740 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-09-07 20:39:14,740 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,740 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-09-07 20:39:14,740 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,740 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,741 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-09-07 20:39:14,742 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,743 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,744 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-09-07 20:39:14,745 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,746 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-09-07 20:39:14,746 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,746 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-09-07 20:39:14,746 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,746 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,746 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-07 20:39:14,746 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-09-07 20:39:14,746 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-07 20:39:14,746 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,746 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,746 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,747 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,747 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,747 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,747 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,747 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-09-07 20:39:14,747 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-09-07 20:39:14,747 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-09-07 20:39:14,747 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-09-07 20:39:14,747 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,748 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,748 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,748 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,748 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,748 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,748 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-09-07 20:39:14,748 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-09-07 20:39:14,748 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-09-07 20:39:14,748 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,749 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,749 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,749 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,749 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,749 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-09-07 20:39:14,749 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-09-07 20:39:14,749 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,749 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,749 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,749 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-09-07 20:39:14,750 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-09-07 20:39:14,750 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-09-07 20:39:14,750 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,750 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-09-07 20:39:14,750 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 20:39:14,750 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,750 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-07 20:39:14,750 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,750 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,751 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,751 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,751 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,751 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,751 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-09-07 20:39:14,751 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,751 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-09-07 20:39:14,751 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-09-07 20:39:14,751 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 20:39:14,751 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~a4~0 89) 0) (<= 0 (+ ~a0~0 83)) (<= ~a2~0 1) (= (+ ~a29~0 127) 0)) [2019-09-07 20:39:14,752 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 20:39:14,752 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 20:39:14,752 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1760 1776) the Hoare annotation is: (or (not (= 0 (+ |old(~a29~0)| 127))) (not (<= |old(~a2~0)| 1)) (not (<= (+ |old(~a4~0)| 89) 0)) (not (<= 0 (+ |old(~a0~0)| 83))) (and (= ~a2~0 |old(~a2~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a4~0 |old(~a4~0)|) (= (+ ~a29~0 127) 0))) [2019-09-07 20:39:14,752 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1760 1776) no Hoare annotation was computed. [2019-09-07 20:39:14,752 INFO L439 ceAbstractionStarter]: At program point L1774(line 1774) the Hoare annotation is: (let ((.cse18 (<= (+ ~a4~0 89) 0)) (.cse12 (<= ~a2~0 1)) (.cse27 (+ ~a29~0 16)) (.cse24 (+ ~a29~0 127))) (let ((.cse7 (<= (+ ~a29~0 145) 0)) (.cse6 (<= 0 .cse24)) (.cse16 (= 2 ~a2~0)) (.cse10 (<= (+ ~a0~0 147) 0)) (.cse5 (<= .cse27 0)) (.cse11 (<= 0 (+ ~a29~0 192415))) (.cse22 (<= 0 (+ ~a0~0 83))) (.cse15 (<= 3 ~a2~0)) (.cse1 (< 0 .cse27)) (.cse9 (< 0 (+ ~a4~0 86))) (.cse4 (and (and (and .cse18 (<= 0 (+ |old(~a0~0)| 146))) (<= |old(~a2~0)| 2)) .cse12)) (.cse19 (= 4 ~a2~0)) (.cse21 (<= (+ ~a29~0 144) 0)) (.cse20 (< 0 (+ ~a0~0 98))) (.cse17 (<= (+ ~a0~0 61) 0)) (.cse3 (<= (+ ~a4~0 42) 0)) (.cse0 (exists ((v_~a0~0_834 Int)) (let ((.cse25 (div v_~a0~0_834 5))) (let ((.cse26 (+ (* 123 .cse25) 123))) (and (not (= (mod (+ (* 3 .cse25) 3) 10) 0)) (<= ~a0~0 (+ (* 5 (div .cse26 10)) 5)) (< v_~a0~0_834 0) (< .cse26 0) (<= (+ v_~a0~0_834 61) 0) (not (= (mod v_~a0~0_834 5) 0))))))) (.cse23 (<= .cse24 0)) (.cse2 (= 3 ~a2~0)) (.cse13 (not (= ~a2~0 4))) (.cse8 (<= (+ ~a0~0 104) 0)) (.cse14 (not (= ~a2~0 3)))) (or (and .cse0 (and (and .cse1 .cse2) .cse3)) (and .cse4 .cse5 .cse6) (and .cse3 .cse7 .cse8 .cse2) (and .cse9 .cse10 .cse3 .cse11) (and .cse1 .cse9 .cse3 .cse12) (and .cse3 .cse13 .cse1 .cse14 .cse15) (not (<= |old(~a2~0)| 1)) (not (<= 0 (+ |old(~a0~0)| 83))) (and .cse1 .cse9 .cse16 .cse17 .cse3) (and .cse0 (and .cse9 .cse3)) (and .cse18 .cse7 .cse2) (and (and .cse18 .cse6) .cse16) (and .cse18 .cse10) (and (and .cse18 .cse19) .cse20) (and .cse10 .cse16 .cse3) (and (and .cse21 .cse16) .cse22 .cse3) (and .cse8 .cse5 .cse19 .cse3 .cse11) (and .cse13 .cse9 .cse8 .cse3 .cse23 .cse15) (and .cse9 .cse8 .cse16 .cse6 .cse3) (and .cse8 .cse5 .cse6 .cse3 .cse14 .cse15) (and .cse9 .cse17 .cse3 .cse12) (and (or (and .cse9 .cse6 .cse3 .cse2 .cse20) (and .cse22 .cse3 .cse2 .cse6)) .cse17) (and .cse8 .cse3 .cse12) (and .cse9 .cse17 .cse3 .cse14 .cse20 .cse15 .cse11) (not (= 0 (+ |old(~a29~0)| 127))) (and (and .cse1 .cse18) .cse2) (and (and .cse5 .cse3 .cse20 .cse12) .cse17) (and .cse18 .cse19 .cse11) (and .cse18 .cse21 .cse16) (and .cse10 .cse5 .cse3 .cse14 .cse11) (and .cse22 .cse1 .cse3 .cse15) (and .cse1 .cse9 .cse8 .cse3 .cse2) (and .cse4 .cse17) (and (<= 96176 ~a29~0) .cse3 .cse19 .cse20) (and .cse3 (and .cse21 .cse12)) (and .cse3 (<= 0 (+ ~a4~0 74)) .cse2 .cse17) (and (and .cse18 .cse2 .cse20) .cse17) (and .cse3 .cse0 .cse23 .cse2) (not (<= (+ |old(~a4~0)| 89) 0)) (and .cse18 .cse13 .cse8 .cse14)))) [2019-09-07 20:39:14,753 INFO L443 ceAbstractionStarter]: For program point L1774-1(line 1774) no Hoare annotation was computed. [2019-09-07 20:39:14,753 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-09-07 20:39:14,753 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse18 (<= (+ ~a4~0 89) 0)) (.cse12 (<= ~a2~0 1)) (.cse27 (+ ~a29~0 16)) (.cse24 (+ ~a29~0 127))) (let ((.cse7 (<= (+ ~a29~0 145) 0)) (.cse6 (<= 0 .cse24)) (.cse16 (= 2 ~a2~0)) (.cse10 (<= (+ ~a0~0 147) 0)) (.cse5 (<= .cse27 0)) (.cse11 (<= 0 (+ ~a29~0 192415))) (.cse22 (<= 0 (+ ~a0~0 83))) (.cse15 (<= 3 ~a2~0)) (.cse1 (< 0 .cse27)) (.cse9 (< 0 (+ ~a4~0 86))) (.cse4 (and (and (and .cse18 (<= 0 (+ |old(~a0~0)| 146))) (<= |old(~a2~0)| 2)) .cse12)) (.cse19 (= 4 ~a2~0)) (.cse21 (<= (+ ~a29~0 144) 0)) (.cse20 (< 0 (+ ~a0~0 98))) (.cse17 (<= (+ ~a0~0 61) 0)) (.cse3 (<= (+ ~a4~0 42) 0)) (.cse0 (exists ((v_~a0~0_834 Int)) (let ((.cse25 (div v_~a0~0_834 5))) (let ((.cse26 (+ (* 123 .cse25) 123))) (and (not (= (mod (+ (* 3 .cse25) 3) 10) 0)) (<= ~a0~0 (+ (* 5 (div .cse26 10)) 5)) (< v_~a0~0_834 0) (< .cse26 0) (<= (+ v_~a0~0_834 61) 0) (not (= (mod v_~a0~0_834 5) 0))))))) (.cse23 (<= .cse24 0)) (.cse2 (= 3 ~a2~0)) (.cse13 (not (= ~a2~0 4))) (.cse8 (<= (+ ~a0~0 104) 0)) (.cse14 (not (= ~a2~0 3)))) (or (and .cse0 (and (and .cse1 .cse2) .cse3)) (and .cse4 .cse5 .cse6) (and .cse3 .cse7 .cse8 .cse2) (and .cse9 .cse10 .cse3 .cse11) (and .cse1 .cse9 .cse3 .cse12) (and .cse3 .cse13 .cse1 .cse14 .cse15) (not (<= |old(~a2~0)| 1)) (not (<= 0 (+ |old(~a0~0)| 83))) (and .cse1 .cse9 .cse16 .cse17 .cse3) (and .cse0 (and .cse9 .cse3)) (and .cse18 .cse7 .cse2) (and (and .cse18 .cse6) .cse16) (and .cse18 .cse10) (and (and .cse18 .cse19) .cse20) (and .cse10 .cse16 .cse3) (and (and .cse21 .cse16) .cse22 .cse3) (and .cse8 .cse5 .cse19 .cse3 .cse11) (and .cse13 .cse9 .cse8 .cse3 .cse23 .cse15) (and .cse9 .cse8 .cse16 .cse6 .cse3) (and .cse8 .cse5 .cse6 .cse3 .cse14 .cse15) (and .cse9 .cse17 .cse3 .cse12) (and (or (and .cse9 .cse6 .cse3 .cse2 .cse20) (and .cse22 .cse3 .cse2 .cse6)) .cse17) (and .cse8 .cse3 .cse12) (and .cse9 .cse17 .cse3 .cse14 .cse20 .cse15 .cse11) (not (= 0 (+ |old(~a29~0)| 127))) (and (and .cse1 .cse18) .cse2) (and (and .cse5 .cse3 .cse20 .cse12) .cse17) (and .cse18 .cse19 .cse11) (and .cse18 .cse21 .cse16) (and .cse10 .cse5 .cse3 .cse14 .cse11) (and .cse22 .cse1 .cse3 .cse15) (and .cse1 .cse9 .cse8 .cse3 .cse2) (and .cse4 .cse17) (and (<= 96176 ~a29~0) .cse3 .cse19 .cse20) (and .cse3 (and .cse21 .cse12)) (and .cse3 (<= 0 (+ ~a4~0 74)) .cse2 .cse17) (and (and .cse18 .cse2 .cse20) .cse17) (and .cse3 .cse0 .cse23 .cse2) (not (<= (+ |old(~a4~0)| 89) 0)) (and .cse18 .cse13 .cse8 .cse14)))) [2019-09-07 20:39:14,753 INFO L443 ceAbstractionStarter]: For program point L1766-3(lines 1760 1776) no Hoare annotation was computed. [2019-09-07 20:39:14,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 08:39:14 BoogieIcfgContainer [2019-09-07 20:39:14,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 20:39:14,802 INFO L168 Benchmark]: Toolchain (without parser) took 235922.81 ms. Allocated memory was 140.0 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 82.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-09-07 20:39:14,803 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 20:39:14,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1177.35 ms. Allocated memory was 140.0 MB in the beginning and 205.5 MB in the end (delta: 65.5 MB). Free memory was 81.9 MB in the beginning and 110.1 MB in the end (delta: -28.2 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-09-07 20:39:14,804 INFO L168 Benchmark]: Boogie Preprocessor took 209.77 ms. Allocated memory is still 205.5 MB. Free memory was 110.1 MB in the beginning and 97.1 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-09-07 20:39:14,805 INFO L168 Benchmark]: RCFGBuilder took 3041.31 ms. Allocated memory was 205.5 MB in the beginning and 273.2 MB in the end (delta: 67.6 MB). Free memory was 97.1 MB in the beginning and 88.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. [2019-09-07 20:39:14,806 INFO L168 Benchmark]: TraceAbstraction took 231490.09 ms. Allocated memory was 273.2 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 88.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-09-07 20:39:14,810 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.21 ms. Allocated memory is still 140.0 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1177.35 ms. Allocated memory was 140.0 MB in the beginning and 205.5 MB in the end (delta: 65.5 MB). Free memory was 81.9 MB in the beginning and 110.1 MB in the end (delta: -28.2 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 209.77 ms. Allocated memory is still 205.5 MB. Free memory was 110.1 MB in the beginning and 97.1 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3041.31 ms. Allocated memory was 205.5 MB in the beginning and 273.2 MB in the end (delta: 67.6 MB). Free memory was 97.1 MB in the beginning and 88.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 231490.09 ms. Allocated memory was 273.2 MB in the beginning and 2.9 GB in the end (delta: 2.6 GB). Free memory was 88.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 103]: 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: 1766]: Loop Invariant [2019-09-07 20:39:14,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] [2019-09-07 20:39:14,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_834,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((\exists v_~a0~0_834 : int :: ((((!((3 * (v_~a0~0_834 / 5) + 3) % 10 == 0) && a0 <= 5 * ((123 * (v_~a0~0_834 / 5) + 123) / 10) + 5) && v_~a0~0_834 < 0) && 123 * (v_~a0~0_834 / 5) + 123 < 0) && v_~a0~0_834 + 61 <= 0) && !(v_~a0~0_834 % 5 == 0)) && (0 < a29 + 16 && 3 == a2) && a4 + 42 <= 0) || (((((a4 + 89 <= 0 && 0 <= \old(a0) + 146) && \old(a2) <= 2) && a2 <= 1) && a29 + 16 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && a29 + 145 <= 0) && a0 + 104 <= 0) && 3 == a2)) || (((0 < a4 + 86 && a0 + 147 <= 0) && a4 + 42 <= 0) && 0 <= a29 + 192415)) || (((0 < a29 + 16 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 <= 1)) || ((((a4 + 42 <= 0 && !(a2 == 4)) && 0 < a29 + 16) && !(a2 == 3)) && 3 <= a2)) || !(\old(a2) <= 1)) || !(0 <= \old(a0) + 83)) || ((((0 < a29 + 16 && 0 < a4 + 86) && 2 == a2) && a0 + 61 <= 0) && a4 + 42 <= 0)) || ((\exists v_~a0~0_834 : int :: ((((!((3 * (v_~a0~0_834 / 5) + 3) % 10 == 0) && a0 <= 5 * ((123 * (v_~a0~0_834 / 5) + 123) / 10) + 5) && v_~a0~0_834 < 0) && 123 * (v_~a0~0_834 / 5) + 123 < 0) && v_~a0~0_834 + 61 <= 0) && !(v_~a0~0_834 % 5 == 0)) && 0 < a4 + 86 && a4 + 42 <= 0)) || ((a4 + 89 <= 0 && a29 + 145 <= 0) && 3 == a2)) || ((a4 + 89 <= 0 && 0 <= a29 + 127) && 2 == a2)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((a4 + 89 <= 0 && 4 == a2) && 0 < a0 + 98)) || ((a0 + 147 <= 0 && 2 == a2) && a4 + 42 <= 0)) || (((a29 + 144 <= 0 && 2 == a2) && 0 <= a0 + 83) && a4 + 42 <= 0)) || ((((a0 + 104 <= 0 && a29 + 16 <= 0) && 4 == a2) && a4 + 42 <= 0) && 0 <= a29 + 192415)) || (((((!(a2 == 4) && 0 < a4 + 86) && a0 + 104 <= 0) && a4 + 42 <= 0) && a29 + 127 <= 0) && 3 <= a2)) || ((((0 < a4 + 86 && a0 + 104 <= 0) && 2 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0)) || (((((a0 + 104 <= 0 && a29 + 16 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0) && !(a2 == 3)) && 3 <= a2)) || (((0 < a4 + 86 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 <= 1)) || ((((((0 < a4 + 86 && 0 <= a29 + 127) && a4 + 42 <= 0) && 3 == a2) && 0 < a0 + 98) || (((0 <= a0 + 83 && a4 + 42 <= 0) && 3 == a2) && 0 <= a29 + 127)) && a0 + 61 <= 0)) || ((a0 + 104 <= 0 && a4 + 42 <= 0) && a2 <= 1)) || ((((((0 < a4 + 86 && a0 + 61 <= 0) && a4 + 42 <= 0) && !(a2 == 3)) && 0 < a0 + 98) && 3 <= a2) && 0 <= a29 + 192415)) || !(0 == \old(a29) + 127)) || ((0 < a29 + 16 && a4 + 89 <= 0) && 3 == a2)) || ((((a29 + 16 <= 0 && a4 + 42 <= 0) && 0 < a0 + 98) && a2 <= 1) && a0 + 61 <= 0)) || ((a4 + 89 <= 0 && 4 == a2) && 0 <= a29 + 192415)) || ((a4 + 89 <= 0 && a29 + 144 <= 0) && 2 == a2)) || ((((a0 + 147 <= 0 && a29 + 16 <= 0) && a4 + 42 <= 0) && !(a2 == 3)) && 0 <= a29 + 192415)) || (((0 <= a0 + 83 && 0 < a29 + 16) && a4 + 42 <= 0) && 3 <= a2)) || ((((0 < a29 + 16 && 0 < a4 + 86) && a0 + 104 <= 0) && a4 + 42 <= 0) && 3 == a2)) || ((((a4 + 89 <= 0 && 0 <= \old(a0) + 146) && \old(a2) <= 2) && a2 <= 1) && a0 + 61 <= 0)) || (((96176 <= a29 && a4 + 42 <= 0) && 4 == a2) && 0 < a0 + 98)) || (a4 + 42 <= 0 && a29 + 144 <= 0 && a2 <= 1)) || (((a4 + 42 <= 0 && 0 <= a4 + 74) && 3 == a2) && a0 + 61 <= 0)) || (((a4 + 89 <= 0 && 3 == a2) && 0 < a0 + 98) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && (\exists v_~a0~0_834 : int :: ((((!((3 * (v_~a0~0_834 / 5) + 3) % 10 == 0) && a0 <= 5 * ((123 * (v_~a0~0_834 / 5) + 123) / 10) + 5) && v_~a0~0_834 < 0) && 123 * (v_~a0~0_834 / 5) + 123 < 0) && v_~a0~0_834 + 61 <= 0) && !(v_~a0~0_834 % 5 == 0))) && a29 + 127 <= 0) && 3 == a2)) || !(\old(a4) + 89 <= 0)) || (((a4 + 89 <= 0 && !(a2 == 4)) && a0 + 104 <= 0) && !(a2 == 3)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 437 locations, 1 error locations. SAFE Result, 231.3s OverallTime, 18 OverallIterations, 7 TraceHistogramMax, 115.2s AutomataDifference, 0.0s DeadEndRemovalTime, 88.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 3360 SDtfs, 33241 SDslu, 4206 SDs, 0 SdLazy, 64200 SolverSat, 9454 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 87.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6276 GetRequests, 5994 SyntacticMatches, 4 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2945 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49253occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 36239 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 5984 PreInvPairs, 6719 NumberOfFragments, 7130 HoareAnnotationTreeSize, 5984 FomulaSimplifications, 607162 FormulaSimplificationTreeSizeReduction, 7.7s HoareSimplificationTime, 9 FomulaSimplificationsInter, 496251 FormulaSimplificationTreeSizeReductionInter, 80.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 13796 NumberOfCodeBlocks, 13796 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 13769 ConstructedInterpolants, 73 QuantifiedInterpolants, 23039319 SizeOfPredicates, 8 NumberOfNonLiveVariables, 8114 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 27 InterpolantComputations, 13 PerfectInterpolantSequences, 13453/15691 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...