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/Problem10_label23.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 18:10:04,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 18:10:04,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 18:10:04,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 18:10:04,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 18:10:04,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 18:10:04,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 18:10:04,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 18:10:04,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 18:10:04,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 18:10:04,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 18:10:04,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 18:10:04,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 18:10:04,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 18:10:04,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 18:10:04,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 18:10:04,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 18:10:04,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 18:10:04,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 18:10:04,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 18:10:04,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 18:10:04,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 18:10:04,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 18:10:04,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 18:10:04,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 18:10:04,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 18:10:04,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 18:10:04,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 18:10:04,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 18:10:04,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 18:10:04,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 18:10:04,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 18:10:04,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 18:10:04,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 18:10:04,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 18:10:04,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 18:10:04,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 18:10:04,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 18:10:04,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 18:10:04,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 18:10:04,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 18:10:04,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 18:10:04,917 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 18:10:04,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 18:10:04,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 18:10:04,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 18:10:04,919 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 18:10:04,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 18:10:04,919 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 18:10:04,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 18:10:04,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 18:10:04,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 18:10:04,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 18:10:04,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 18:10:04,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 18:10:04,921 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 18:10:04,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 18:10:04,921 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 18:10:04,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 18:10:04,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 18:10:04,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 18:10:04,922 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 18:10:04,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 18:10:04,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 18:10:04,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 18:10:04,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 18:10:04,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 18:10:04,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 18:10:04,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 18:10:04,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 18:10:04,924 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 18:10:04,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 18:10:04,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 18:10:04,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 18:10:04,972 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 18:10:04,972 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 18:10:04,973 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label23.c [2019-09-07 18:10:05,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f7a8f65/57d3d8f47dce45ea9be69eb4dfc266ef/FLAG8aa8f3f6e [2019-09-07 18:10:05,595 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 18:10:05,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label23.c [2019-09-07 18:10:05,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f7a8f65/57d3d8f47dce45ea9be69eb4dfc266ef/FLAG8aa8f3f6e [2019-09-07 18:10:05,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9f7a8f65/57d3d8f47dce45ea9be69eb4dfc266ef [2019-09-07 18:10:05,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 18:10:05,918 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 18:10:05,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 18:10:05,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 18:10:05,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 18:10:05,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:10:05" (1/1) ... [2019-09-07 18:10:05,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635b5632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:10:05, skipping insertion in model container [2019-09-07 18:10:05,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:10:05" (1/1) ... [2019-09-07 18:10:05,937 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 18:10:05,996 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 18:10:06,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:10:06,624 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 18:10:06,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:10:06,723 INFO L192 MainTranslator]: Completed translation [2019-09-07 18:10:06,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:10:06 WrapperNode [2019-09-07 18:10:06,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 18:10:06,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 18:10:06,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 18:10:06,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 18:10:06,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:10:06" (1/1) ... [2019-09-07 18:10:06,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:10:06" (1/1) ... [2019-09-07 18:10:06,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:10:06" (1/1) ... [2019-09-07 18:10:06,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:10:06" (1/1) ... [2019-09-07 18:10:06,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:10:06" (1/1) ... [2019-09-07 18:10:06,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:10:06" (1/1) ... [2019-09-07 18:10:06,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:10:06" (1/1) ... [2019-09-07 18:10:06,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 18:10:06,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 18:10:06,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 18:10:06,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 18:10:06,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:10:06" (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 18:10:06,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 18:10:06,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 18:10:06,926 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 18:10:06,926 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 18:10:06,927 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 18:10:06,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 18:10:06,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 18:10:06,928 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 18:10:06,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 18:10:06,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 18:10:06,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 18:10:08,203 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 18:10:08,203 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 18:10:08,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:10:08 BoogieIcfgContainer [2019-09-07 18:10:08,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 18:10:08,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 18:10:08,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 18:10:08,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 18:10:08,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 06:10:05" (1/3) ... [2019-09-07 18:10:08,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea6235a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:10:08, skipping insertion in model container [2019-09-07 18:10:08,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:10:06" (2/3) ... [2019-09-07 18:10:08,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea6235a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:10:08, skipping insertion in model container [2019-09-07 18:10:08,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:10:08" (3/3) ... [2019-09-07 18:10:08,214 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label23.c [2019-09-07 18:10:08,224 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 18:10:08,233 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 18:10:08,250 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 18:10:08,285 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 18:10:08,285 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 18:10:08,286 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 18:10:08,286 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 18:10:08,286 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 18:10:08,286 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 18:10:08,286 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 18:10:08,286 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 18:10:08,287 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 18:10:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2019-09-07 18:10:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 18:10:08,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:10:08,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:10:08,336 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:10:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:10:08,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2063812481, now seen corresponding path program 1 times [2019-09-07 18:10:08,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:10:08,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:10:08,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:08,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:08,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:08,704 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 18:10:08,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:10:08,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 18:10:08,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:10:08,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:10:08,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:10:08,729 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 3 states. [2019-09-07 18:10:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:10:09,910 INFO L93 Difference]: Finished difference Result 571 states and 989 transitions. [2019-09-07 18:10:09,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:10:09,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-07 18:10:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:10:09,932 INFO L225 Difference]: With dead ends: 571 [2019-09-07 18:10:09,932 INFO L226 Difference]: Without dead ends: 294 [2019-09-07 18:10:09,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 18:10:09,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-07 18:10:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-09-07 18:10:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-07 18:10:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 446 transitions. [2019-09-07 18:10:10,033 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 446 transitions. Word has length 52 [2019-09-07 18:10:10,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:10:10,034 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 446 transitions. [2019-09-07 18:10:10,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:10:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 446 transitions. [2019-09-07 18:10:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-07 18:10:10,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:10:10,042 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:10:10,042 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:10:10,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:10:10,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1911288886, now seen corresponding path program 1 times [2019-09-07 18:10:10,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:10:10,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:10:10,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:10,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:10,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:10:10,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:10:10,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 18:10:10,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 18:10:10,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 18:10:10,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 18:10:10,254 INFO L87 Difference]: Start difference. First operand 294 states and 446 transitions. Second operand 5 states. [2019-09-07 18:10:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:10:11,272 INFO L93 Difference]: Finished difference Result 888 states and 1367 transitions. [2019-09-07 18:10:11,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 18:10:11,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2019-09-07 18:10:11,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:10:11,281 INFO L225 Difference]: With dead ends: 888 [2019-09-07 18:10:11,281 INFO L226 Difference]: Without dead ends: 600 [2019-09-07 18:10:11,284 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 18:10:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-09-07 18:10:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 592. [2019-09-07 18:10:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-07 18:10:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 867 transitions. [2019-09-07 18:10:11,357 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 867 transitions. Word has length 134 [2019-09-07 18:10:11,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:10:11,358 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 867 transitions. [2019-09-07 18:10:11,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 18:10:11,358 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 867 transitions. [2019-09-07 18:10:11,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-07 18:10:11,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:10:11,364 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, 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] [2019-09-07 18:10:11,365 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:10:11,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:10:11,365 INFO L82 PathProgramCache]: Analyzing trace with hash 614464170, now seen corresponding path program 1 times [2019-09-07 18:10:11,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:10:11,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:10:11,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:11,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:11,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:10:11,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:10:11,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:10:11,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:10:11,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:10:11,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:10:11,569 INFO L87 Difference]: Start difference. First operand 592 states and 867 transitions. Second operand 6 states. [2019-09-07 18:10:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:10:12,542 INFO L93 Difference]: Finished difference Result 1490 states and 2245 transitions. [2019-09-07 18:10:12,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:10:12,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-07 18:10:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:10:12,553 INFO L225 Difference]: With dead ends: 1490 [2019-09-07 18:10:12,554 INFO L226 Difference]: Without dead ends: 904 [2019-09-07 18:10:12,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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 18:10:12,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-09-07 18:10:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 890. [2019-09-07 18:10:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-09-07 18:10:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1300 transitions. [2019-09-07 18:10:12,593 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1300 transitions. Word has length 150 [2019-09-07 18:10:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:10:12,594 INFO L475 AbstractCegarLoop]: Abstraction has 890 states and 1300 transitions. [2019-09-07 18:10:12,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:10:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1300 transitions. [2019-09-07 18:10:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-07 18:10:12,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:10:12,600 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, 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] [2019-09-07 18:10:12,601 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:10:12,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:10:12,601 INFO L82 PathProgramCache]: Analyzing trace with hash 628433146, now seen corresponding path program 1 times [2019-09-07 18:10:12,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:10:12,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:10:12,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:12,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:12,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:10:12,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:10:12,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:10:12,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:10:12,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:10:12,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:10:12,791 INFO L87 Difference]: Start difference. First operand 890 states and 1300 transitions. Second operand 6 states. [2019-09-07 18:10:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:10:13,819 INFO L93 Difference]: Finished difference Result 2104 states and 3183 transitions. [2019-09-07 18:10:13,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:10:13,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2019-09-07 18:10:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:10:13,828 INFO L225 Difference]: With dead ends: 2104 [2019-09-07 18:10:13,829 INFO L226 Difference]: Without dead ends: 1220 [2019-09-07 18:10:13,832 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 18:10:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2019-09-07 18:10:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1192. [2019-09-07 18:10:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-09-07 18:10:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1616 transitions. [2019-09-07 18:10:13,878 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1616 transitions. Word has length 174 [2019-09-07 18:10:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:10:13,879 INFO L475 AbstractCegarLoop]: Abstraction has 1192 states and 1616 transitions. [2019-09-07 18:10:13,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:10:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1616 transitions. [2019-09-07 18:10:13,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-07 18:10:13,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:10:13,885 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:10:13,885 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:10:13,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:10:13,886 INFO L82 PathProgramCache]: Analyzing trace with hash 880887528, now seen corresponding path program 1 times [2019-09-07 18:10:13,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:10:13,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:10:13,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:13,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:13,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 167 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:10:14,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:10:14,395 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 18:10:14,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:14,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:10:14,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:10:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 167 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:10:14,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:10:14,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 18:10:14,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 18:10:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 18:10:14,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-09-07 18:10:14,650 INFO L87 Difference]: Start difference. First operand 1192 states and 1616 transitions. Second operand 15 states. [2019-09-07 18:10:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:10:19,057 INFO L93 Difference]: Finished difference Result 3369 states and 4994 transitions. [2019-09-07 18:10:19,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 18:10:19,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 213 [2019-09-07 18:10:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:10:19,075 INFO L225 Difference]: With dead ends: 3369 [2019-09-07 18:10:19,076 INFO L226 Difference]: Without dead ends: 2013 [2019-09-07 18:10:19,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=457, Invalid=1435, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 18:10:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2019-09-07 18:10:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1794. [2019-09-07 18:10:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2019-09-07 18:10:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2319 transitions. [2019-09-07 18:10:19,179 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2319 transitions. Word has length 213 [2019-09-07 18:10:19,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:10:19,179 INFO L475 AbstractCegarLoop]: Abstraction has 1794 states and 2319 transitions. [2019-09-07 18:10:19,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 18:10:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2319 transitions. [2019-09-07 18:10:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-07 18:10:19,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:10:19,185 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, 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, 1, 1, 1, 1, 1, 1, 1, 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 18:10:19,186 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:10:19,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:10:19,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1030862380, now seen corresponding path program 1 times [2019-09-07 18:10:19,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:10:19,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:10:19,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:19,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:19,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-07 18:10:19,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:10:19,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:10:19,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:10:19,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:10:19,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:10:19,387 INFO L87 Difference]: Start difference. First operand 1794 states and 2319 transitions. Second operand 4 states. [2019-09-07 18:10:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:10:20,476 INFO L93 Difference]: Finished difference Result 4450 states and 5820 transitions. [2019-09-07 18:10:20,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:10:20,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-09-07 18:10:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:10:20,495 INFO L225 Difference]: With dead ends: 4450 [2019-09-07 18:10:20,496 INFO L226 Difference]: Without dead ends: 2666 [2019-09-07 18:10:20,502 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 18:10:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-09-07 18:10:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 1941. [2019-09-07 18:10:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2019-09-07 18:10:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2382 transitions. [2019-09-07 18:10:20,569 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2382 transitions. Word has length 227 [2019-09-07 18:10:20,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:10:20,570 INFO L475 AbstractCegarLoop]: Abstraction has 1941 states and 2382 transitions. [2019-09-07 18:10:20,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:10:20,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2382 transitions. [2019-09-07 18:10:20,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-07 18:10:20,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:10:20,576 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, 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, 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 18:10:20,576 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:10:20,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:10:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash -746901927, now seen corresponding path program 1 times [2019-09-07 18:10:20,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:10:20,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:10:20,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:20,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:20,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 170 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:10:20,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:10:20,784 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 18:10:20,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:20,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 18:10:20,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:10:21,017 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-07 18:10:21,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 18:10:21,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2019-09-07 18:10:21,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 18:10:21,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 18:10:21,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 18:10:21,034 INFO L87 Difference]: Start difference. First operand 1941 states and 2382 transitions. Second operand 8 states. [2019-09-07 18:10:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:10:23,257 INFO L93 Difference]: Finished difference Result 5045 states and 6719 transitions. [2019-09-07 18:10:23,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 18:10:23,258 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 230 [2019-09-07 18:10:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:10:23,286 INFO L225 Difference]: With dead ends: 5045 [2019-09-07 18:10:23,287 INFO L226 Difference]: Without dead ends: 3110 [2019-09-07 18:10:23,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-09-07 18:10:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2019-09-07 18:10:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3016. [2019-09-07 18:10:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-09-07 18:10:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3789 transitions. [2019-09-07 18:10:23,431 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3789 transitions. Word has length 230 [2019-09-07 18:10:23,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:10:23,432 INFO L475 AbstractCegarLoop]: Abstraction has 3016 states and 3789 transitions. [2019-09-07 18:10:23,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 18:10:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3789 transitions. [2019-09-07 18:10:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-09-07 18:10:23,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:10:23,492 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:10:23,493 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:10:23,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:10:23,493 INFO L82 PathProgramCache]: Analyzing trace with hash -62605745, now seen corresponding path program 1 times [2019-09-07 18:10:23,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:10:23,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:10:23,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:23,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:23,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 199 proven. 74 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 18:10:23,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:10:23,885 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 18:10:23,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:24,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 18:10:24,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:10:24,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 18:10:24,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 18:10:24,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:10:24,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:10:24,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:10:24,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:10:24,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:10:24,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:10:24,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:10:24,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:10:24,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:10:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 323 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 18:10:24,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:10:24,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-09-07 18:10:24,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 18:10:24,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 18:10:24,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-07 18:10:24,594 INFO L87 Difference]: Start difference. First operand 3016 states and 3789 transitions. Second operand 13 states. [2019-09-07 18:10:30,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:10:30,425 INFO L93 Difference]: Finished difference Result 7387 states and 9540 transitions. [2019-09-07 18:10:30,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 18:10:30,426 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 361 [2019-09-07 18:10:30,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:10:30,450 INFO L225 Difference]: With dead ends: 7387 [2019-09-07 18:10:30,451 INFO L226 Difference]: Without dead ends: 4520 [2019-09-07 18:10:30,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 360 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=652, Invalid=2888, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 18:10:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2019-09-07 18:10:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 3747. [2019-09-07 18:10:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3747 states. [2019-09-07 18:10:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3747 states to 3747 states and 4384 transitions. [2019-09-07 18:10:30,583 INFO L78 Accepts]: Start accepts. Automaton has 3747 states and 4384 transitions. Word has length 361 [2019-09-07 18:10:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:10:30,584 INFO L475 AbstractCegarLoop]: Abstraction has 3747 states and 4384 transitions. [2019-09-07 18:10:30,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 18:10:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3747 states and 4384 transitions. [2019-09-07 18:10:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-07 18:10:30,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:10:30,601 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:10:30,601 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:10:30,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:10:30,602 INFO L82 PathProgramCache]: Analyzing trace with hash -261894538, now seen corresponding path program 1 times [2019-09-07 18:10:30,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:10:30,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:10:30,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:30,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:30,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 217 proven. 119 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-07 18:10:31,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:10:31,025 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 18:10:31,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:31,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:10:31,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:10:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 300 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-07 18:10:31,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:10:31,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 18:10:31,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:10:31,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:10:31,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:10:31,281 INFO L87 Difference]: Start difference. First operand 3747 states and 4384 transitions. Second operand 11 states. [2019-09-07 18:10:34,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:10:34,371 INFO L93 Difference]: Finished difference Result 9659 states and 11287 transitions. [2019-09-07 18:10:34,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 18:10:34,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 390 [2019-09-07 18:10:34,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:10:34,389 INFO L225 Difference]: With dead ends: 9659 [2019-09-07 18:10:34,390 INFO L226 Difference]: Without dead ends: 4007 [2019-09-07 18:10:34,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 404 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2019-09-07 18:10:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4007 states. [2019-09-07 18:10:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4007 to 2984. [2019-09-07 18:10:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2984 states. [2019-09-07 18:10:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 3308 transitions. [2019-09-07 18:10:34,490 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 3308 transitions. Word has length 390 [2019-09-07 18:10:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:10:34,491 INFO L475 AbstractCegarLoop]: Abstraction has 2984 states and 3308 transitions. [2019-09-07 18:10:34,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:10:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 3308 transitions. [2019-09-07 18:10:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-07 18:10:34,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:10:34,505 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 18:10:34,506 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:10:34,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:10:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1415462442, now seen corresponding path program 1 times [2019-09-07 18:10:34,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:10:34,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:10:34,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:34,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:10:34,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:10:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:10:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-09-07 18:10:34,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:10:34,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 18:10:34,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:10:34,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:10:34,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:10:34,798 INFO L87 Difference]: Start difference. First operand 2984 states and 3308 transitions. Second operand 3 states. [2019-09-07 18:10:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:10:35,406 INFO L93 Difference]: Finished difference Result 4144 states and 4653 transitions. [2019-09-07 18:10:35,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:10:35,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 392 [2019-09-07 18:10:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:10:35,434 INFO L225 Difference]: With dead ends: 4144 [2019-09-07 18:10:35,434 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 18:10:35,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 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 18:10:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 18:10:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 18:10:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 18:10:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 18:10:35,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 392 [2019-09-07 18:10:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:10:35,443 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 18:10:35,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:10:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 18:10:35,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 18:10:35,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 18:10:36,596 WARN L188 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 276 [2019-09-07 18:10:37,316 WARN L188 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 276 [2019-09-07 18:10:39,242 WARN L188 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 261 DAG size of output: 66 [2019-09-07 18:10:41,493 WARN L188 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 279 DAG size of output: 74 [2019-09-07 18:10:43,660 WARN L188 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 279 DAG size of output: 74 [2019-09-07 18:10:43,663 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 18:10:43,664 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a10~0 |old(~a10~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a1~0 |old(~a1~0)|)) [2019-09-07 18:10:43,664 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 18:10:43,664 INFO L443 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-09-07 18:10:43,664 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,664 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,664 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,664 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,665 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,665 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,665 INFO L443 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-09-07 18:10:43,665 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-09-07 18:10:43,665 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-09-07 18:10:43,665 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-09-07 18:10:43,665 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-07 18:10:43,665 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-09-07 18:10:43,666 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-09-07 18:10:43,666 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-07 18:10:43,666 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-09-07 18:10:43,666 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-09-07 18:10:43,666 INFO L443 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-09-07 18:10:43,666 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,666 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,666 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,666 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,666 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,667 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-09-07 18:10:43,667 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-09-07 18:10:43,667 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-09-07 18:10:43,667 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-09-07 18:10:43,667 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-09-07 18:10:43,667 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-09-07 18:10:43,667 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-09-07 18:10:43,667 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-09-07 18:10:43,667 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-09-07 18:10:43,668 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-09-07 18:10:43,668 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-09-07 18:10:43,668 INFO L443 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-09-07 18:10:43,668 INFO L443 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-09-07 18:10:43,668 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-09-07 18:10:43,668 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,668 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,668 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,668 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,668 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,669 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-09-07 18:10:43,669 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-09-07 18:10:43,669 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-09-07 18:10:43,669 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-07 18:10:43,669 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-09-07 18:10:43,669 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-09-07 18:10:43,669 INFO L443 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-09-07 18:10:43,669 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-09-07 18:10:43,670 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-09-07 18:10:43,670 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-09-07 18:10:43,670 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,670 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,670 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,670 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,670 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,670 INFO L443 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-09-07 18:10:43,670 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-09-07 18:10:43,671 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-09-07 18:10:43,671 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-09-07 18:10:43,671 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-09-07 18:10:43,671 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-09-07 18:10:43,671 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-07 18:10:43,671 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-09-07 18:10:43,671 INFO L443 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-09-07 18:10:43,671 INFO L443 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-09-07 18:10:43,671 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-09-07 18:10:43,672 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-09-07 18:10:43,672 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-09-07 18:10:43,672 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,672 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,672 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,672 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,672 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,672 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-09-07 18:10:43,673 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-09-07 18:10:43,673 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-09-07 18:10:43,673 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-09-07 18:10:43,673 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-09-07 18:10:43,673 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-09-07 18:10:43,673 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-09-07 18:10:43,673 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-09-07 18:10:43,673 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-09-07 18:10:43,673 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,673 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,674 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,674 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,674 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,674 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,674 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,674 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-09-07 18:10:43,674 INFO L443 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-09-07 18:10:43,674 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-09-07 18:10:43,674 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-09-07 18:10:43,674 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-09-07 18:10:43,674 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-09-07 18:10:43,674 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-09-07 18:10:43,674 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-09-07 18:10:43,675 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-09-07 18:10:43,675 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-09-07 18:10:43,675 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-09-07 18:10:43,675 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-09-07 18:10:43,675 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-09-07 18:10:43,675 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,675 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,675 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,675 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,676 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-09-07 18:10:43,676 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,676 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,676 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-09-07 18:10:43,676 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-09-07 18:10:43,676 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-09-07 18:10:43,676 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-09-07 18:10:43,676 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-09-07 18:10:43,676 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-07 18:10:43,677 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-09-07 18:10:43,677 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-09-07 18:10:43,677 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-09-07 18:10:43,677 INFO L443 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-09-07 18:10:43,677 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-09-07 18:10:43,677 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-09-07 18:10:43,677 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-09-07 18:10:43,677 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,677 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,678 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,678 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,678 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,678 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,678 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-09-07 18:10:43,678 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-09-07 18:10:43,678 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-09-07 18:10:43,678 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-09-07 18:10:43,678 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-09-07 18:10:43,678 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-07 18:10:43,679 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-09-07 18:10:43,679 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-09-07 18:10:43,679 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-09-07 18:10:43,679 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-09-07 18:10:43,679 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-09-07 18:10:43,680 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse10 (= ~a10~0 |old(~a10~0)|)) (.cse9 (= 10 |old(~a19~0)|)) (.cse12 (= ~a1~0 |old(~a1~0)|)) (.cse11 (= ~a19~0 |old(~a19~0)|))) (let ((.cse4 (and .cse12 (= ~a10~0 2) .cse11)) (.cse0 (or .cse9 (not (= 2 |old(~a10~0)|)))) (.cse6 (not (<= |old(~a10~0)| 1))) (.cse8 (= 7 |old(~a19~0)|)) (.cse1 (not (<= |old(~a19~0)| 8))) (.cse7 (= 8 |old(~a19~0)|)) (.cse5 (and .cse12 .cse10 .cse11)) (.cse2 (not (= 14 ~a4~0))) (.cse3 (not (= 0 ~a12~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 (not (<= 0 (+ |old(~a1~0)| 12))) .cse2 .cse3 (= 0 |old(~a10~0)|)) (or .cse4 (or .cse0 .cse2 .cse3 (not (<= |old(~a1~0)| 32)))) (or (not .cse7) .cse5 (or (= 3 |old(~a10~0)|) .cse2 .cse3)) (or .cse5 (or .cse8 .cse9 .cse2 .cse3 (not (< 218 |old(~a1~0)|)))) (or (or .cse8 .cse6) (and .cse10 .cse11 .cse12) .cse2 .cse3) (or .cse8 .cse5 .cse1 .cse2 .cse3 .cse7) (or .cse5 .cse2 .cse3 (not (= 9 |old(~a19~0)|)))))) [2019-09-07 18:10:43,680 INFO L443 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-09-07 18:10:43,680 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-09-07 18:10:43,680 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-09-07 18:10:43,680 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,680 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,680 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,680 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,680 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,681 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,681 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-09-07 18:10:43,681 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-09-07 18:10:43,681 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-09-07 18:10:43,681 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-09-07 18:10:43,681 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-09-07 18:10:43,681 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-09-07 18:10:43,681 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-07 18:10:43,681 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-09-07 18:10:43,681 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-09-07 18:10:43,682 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-09-07 18:10:43,682 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-09-07 18:10:43,682 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-09-07 18:10:43,682 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-09-07 18:10:43,682 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,682 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,682 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,682 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,683 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,683 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,683 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-09-07 18:10:43,683 INFO L443 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-09-07 18:10:43,683 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-09-07 18:10:43,683 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-09-07 18:10:43,683 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-09-07 18:10:43,683 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-09-07 18:10:43,683 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-09-07 18:10:43,683 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-09-07 18:10:43,683 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-09-07 18:10:43,683 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-09-07 18:10:43,684 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-09-07 18:10:43,684 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2019-09-07 18:10:43,684 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-09-07 18:10:43,684 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,684 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,684 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,684 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,684 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,684 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-09-07 18:10:43,684 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-09-07 18:10:43,684 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-09-07 18:10:43,684 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-09-07 18:10:43,685 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-09-07 18:10:43,685 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-09-07 18:10:43,685 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-09-07 18:10:43,685 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-09-07 18:10:43,685 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-09-07 18:10:43,685 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-07 18:10:43,685 INFO L443 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-09-07 18:10:43,685 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-09-07 18:10:43,685 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-09-07 18:10:43,685 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 18:10:43,685 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a19~0 7)) (= 14 ~a4~0) (not (= ~a19~0 8)) (= ~a12~0 0) (= 23 ~a1~0) (not (= ~a10~0 1)) (not (= 10 ~a19~0)) (<= ~a10~0 1)) [2019-09-07 18:10:43,685 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 18:10:43,685 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 18:10:43,686 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (and (= ~a10~0 |old(~a10~0)|) (= 23 ~a1~0) (= ~a19~0 |old(~a19~0)|)) (= 7 |old(~a19~0)|) (= 10 |old(~a19~0)|) (not (= 14 ~a4~0)) (not (= 0 ~a12~0)) (not (= 23 |old(~a1~0)|)) (= 8 |old(~a19~0)|) (= 1 |old(~a10~0)|) (not (<= |old(~a10~0)| 1))) [2019-09-07 18:10:43,686 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2019-09-07 18:10:43,686 INFO L439 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse9 (not (= 10 ~a19~0)))) (let ((.cse3 (<= ~a19~0 8)) (.cse2 (= ~a19~0 |old(~a19~0)|)) (.cse6 (not (= ~a10~0 0))) (.cse4 (and (= ~a10~0 2) (= ~a12~0 0) .cse9)) (.cse7 (= ~a19~0 8)) (.cse8 (not (= ~a19~0 7))) (.cse5 (<= ~a10~0 1)) (.cse0 (= 9 |old(~a19~0)|)) (.cse1 (= 0 |old(~a10~0)|))) (or (not (= 23 |old(~a1~0)|)) (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1 .cse4) (not (<= |old(~a10~0)| 1)) (and .cse5 .cse0 .cse1 .cse6 (<= 0 (+ ~a1~0 12))) (not (= 0 ~a12~0)) (and (= ~a10~0 1) .cse7) (and .cse8 (not .cse7) .cse3 .cse0 .cse1 .cse6) (and (= ~a10~0 |old(~a10~0)|) .cse2 (= ~a1~0 |old(~a1~0)|)) (= 7 |old(~a19~0)|) (and .cse0 (and (< 218 ~a1~0) .cse8 .cse1 .cse9 .cse6)) (and (and .cse4 (<= ~a1~0 32)) .cse0 .cse1) (= 1 |old(~a10~0)|) (and (not (= ~a10~0 3)) .cse0 .cse7 .cse1) (and (and (and .cse8 .cse5) (<= ~a1~0 218)) .cse0 .cse1) (= 10 |old(~a19~0)|) (not (= 14 ~a4~0)) (= 8 |old(~a19~0)|)))) [2019-09-07 18:10:43,686 INFO L443 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2019-09-07 18:10:43,686 INFO L443 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-09-07 18:10:43,686 INFO L439 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse9 (not (= 10 ~a19~0)))) (let ((.cse3 (<= ~a19~0 8)) (.cse2 (= ~a19~0 |old(~a19~0)|)) (.cse6 (not (= ~a10~0 0))) (.cse4 (and (= ~a10~0 2) (= ~a12~0 0) .cse9)) (.cse7 (= ~a19~0 8)) (.cse8 (not (= ~a19~0 7))) (.cse5 (<= ~a10~0 1)) (.cse0 (= 9 |old(~a19~0)|)) (.cse1 (= 0 |old(~a10~0)|))) (or (not (= 23 |old(~a1~0)|)) (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse1 .cse4) (not (<= |old(~a10~0)| 1)) (and .cse5 .cse0 .cse1 .cse6 (<= 0 (+ ~a1~0 12))) (not (= 0 ~a12~0)) (and (= ~a10~0 1) .cse7) (and .cse8 (not .cse7) .cse3 .cse0 .cse1 .cse6) (and (= ~a10~0 |old(~a10~0)|) .cse2 (= ~a1~0 |old(~a1~0)|)) (= 7 |old(~a19~0)|) (and .cse0 (and (< 218 ~a1~0) .cse8 .cse1 .cse9 .cse6)) (and (and .cse4 (<= ~a1~0 32)) .cse0 .cse1) (= 1 |old(~a10~0)|) (and (not (= ~a10~0 3)) .cse0 .cse7 .cse1) (and (and (and .cse8 .cse5) (<= ~a1~0 218)) .cse0 .cse1) (= 10 |old(~a19~0)|) (not (= 14 ~a4~0)) (= 8 |old(~a19~0)|)))) [2019-09-07 18:10:43,686 INFO L443 ceAbstractionStarter]: For program point L582-3(lines 576 592) no Hoare annotation was computed. [2019-09-07 18:10:43,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 06:10:43 BoogieIcfgContainer [2019-09-07 18:10:43,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 18:10:43,712 INFO L168 Benchmark]: Toolchain (without parser) took 37793.43 ms. Allocated memory was 139.5 MB in the beginning and 733.5 MB in the end (delta: 594.0 MB). Free memory was 85.7 MB in the beginning and 447.6 MB in the end (delta: -361.9 MB). Peak memory consumption was 606.8 MB. Max. memory is 7.1 GB. [2019-09-07 18:10:43,713 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 18:10:43,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.46 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 85.5 MB in the beginning and 159.8 MB in the end (delta: -74.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2019-09-07 18:10:43,715 INFO L168 Benchmark]: Boogie Preprocessor took 113.09 ms. Allocated memory is still 200.3 MB. Free memory was 159.8 MB in the beginning and 155.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2019-09-07 18:10:43,716 INFO L168 Benchmark]: RCFGBuilder took 1366.80 ms. Allocated memory was 200.3 MB in the beginning and 224.4 MB in the end (delta: 24.1 MB). Free memory was 155.4 MB in the beginning and 172.3 MB in the end (delta: -16.9 MB). Peak memory consumption was 86.5 MB. Max. memory is 7.1 GB. [2019-09-07 18:10:43,717 INFO L168 Benchmark]: TraceAbstraction took 35503.50 ms. Allocated memory was 224.4 MB in the beginning and 733.5 MB in the end (delta: 509.1 MB). Free memory was 172.3 MB in the beginning and 447.6 MB in the end (delta: -275.3 MB). Peak memory consumption was 608.4 MB. Max. memory is 7.1 GB. [2019-09-07 18:10:43,721 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.24 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.46 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 85.5 MB in the beginning and 159.8 MB in the end (delta: -74.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.09 ms. Allocated memory is still 200.3 MB. Free memory was 159.8 MB in the beginning and 155.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1366.80 ms. Allocated memory was 200.3 MB in the beginning and 224.4 MB in the end (delta: 24.1 MB). Free memory was 155.4 MB in the beginning and 172.3 MB in the end (delta: -16.9 MB). Peak memory consumption was 86.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35503.50 ms. Allocated memory was 224.4 MB in the beginning and 733.5 MB in the end (delta: 509.1 MB). Free memory was 172.3 MB in the beginning and 447.6 MB in the end (delta: -275.3 MB). Peak memory consumption was 608.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 142]: 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: 582]: Loop Invariant Derived loop invariant: ((((((((((((((((!(23 == \old(a1)) || ((9 == \old(a19) && 0 == \old(a10)) && a19 == \old(a19))) || (((a19 <= 8 && 9 == \old(a19)) && 0 == \old(a10)) && (a10 == 2 && a12 == 0) && !(10 == a19))) || !(\old(a10) <= 1)) || ((((a10 <= 1 && 9 == \old(a19)) && 0 == \old(a10)) && !(a10 == 0)) && 0 <= a1 + 12)) || !(0 == a12)) || (a10 == 1 && a19 == 8)) || (((((!(a19 == 7) && !(a19 == 8)) && a19 <= 8) && 9 == \old(a19)) && 0 == \old(a10)) && !(a10 == 0))) || ((a10 == \old(a10) && a19 == \old(a19)) && a1 == \old(a1))) || 7 == \old(a19)) || (9 == \old(a19) && (((218 < a1 && !(a19 == 7)) && 0 == \old(a10)) && !(10 == a19)) && !(a10 == 0))) || (((((a10 == 2 && a12 == 0) && !(10 == a19)) && a1 <= 32) && 9 == \old(a19)) && 0 == \old(a10))) || 1 == \old(a10)) || (((!(a10 == 3) && 9 == \old(a19)) && a19 == 8) && 0 == \old(a10))) || ((((!(a19 == 7) && a10 <= 1) && a1 <= 218) && 9 == \old(a19)) && 0 == \old(a10))) || 10 == \old(a19)) || !(14 == a4)) || 8 == \old(a19) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. SAFE Result, 35.4s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 21.7s AutomataDifference, 0.0s DeadEndRemovalTime, 8.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 364 SDtfs, 7489 SDslu, 666 SDs, 0 SdLazy, 14897 SolverSat, 2678 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1407 GetRequests, 1242 SyntacticMatches, 5 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3747occurred in iteration=8, 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: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 2884 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 158 PreInvPairs, 258 NumberOfFragments, 703 HoareAnnotationTreeSize, 158 FomulaSimplifications, 92859 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 82132 FormulaSimplificationTreeSizeReductionInter, 6.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 3517 NumberOfCodeBlocks, 3517 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3503 ConstructedInterpolants, 0 QuantifiedInterpolants, 4078085 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1968 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 2817/3020 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...