java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label59_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 16:03:01,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 16:03:01,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 16:03:01,822 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 16:03:01,823 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 16:03:01,824 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 16:03:01,825 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 16:03:01,827 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 16:03:01,828 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 16:03:01,831 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 16:03:01,831 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 16:03:01,833 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 16:03:01,837 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 16:03:01,840 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 16:03:01,841 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 16:03:01,844 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 16:03:01,845 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 16:03:01,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 16:03:01,850 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 16:03:01,852 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 16:03:01,854 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 16:03:01,857 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 16:03:01,861 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 16:03:01,861 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 16:03:01,861 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 16:03:01,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 16:03:01,863 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 16:03:01,864 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 16:03:01,867 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 16:03:01,868 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 16:03:01,868 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 16:03:01,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 16:03:01,871 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 16:03:01,871 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 16:03:01,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 16:03:01,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 16:03:01,873 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 16:03:01,904 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 16:03:01,904 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 16:03:01,905 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 16:03:01,905 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 16:03:01,907 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 16:03:01,907 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 16:03:01,907 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 16:03:01,908 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 16:03:01,908 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 16:03:01,908 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 16:03:01,908 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 16:03:01,908 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 16:03:01,909 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 16:03:01,910 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 16:03:01,910 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 16:03:01,910 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 16:03:01,910 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 16:03:01,911 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 16:03:01,912 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 16:03:01,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 16:03:01,913 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 16:03:01,913 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 16:03:01,913 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 16:03:01,913 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 16:03:01,913 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 16:03:01,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 16:03:01,914 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 16:03:01,914 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 16:03:01,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 16:03:01,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 16:03:01,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 16:03:01,995 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 16:03:01,996 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 16:03:01,996 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label59_true-unreach-call.c [2018-10-24 16:03:02,071 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b50c6b67e/6613d6a42fec4bf3937d68a7a3cfd6fb/FLAG6f19010b6 [2018-10-24 16:03:02,684 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 16:03:02,685 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label59_true-unreach-call.c [2018-10-24 16:03:02,707 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b50c6b67e/6613d6a42fec4bf3937d68a7a3cfd6fb/FLAG6f19010b6 [2018-10-24 16:03:02,737 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/b50c6b67e/6613d6a42fec4bf3937d68a7a3cfd6fb [2018-10-24 16:03:02,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 16:03:02,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 16:03:02,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 16:03:02,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 16:03:02,760 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 16:03:02,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:03:02" (1/1) ... [2018-10-24 16:03:02,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@128929bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:02, skipping insertion in model container [2018-10-24 16:03:02,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:03:02" (1/1) ... [2018-10-24 16:03:02,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 16:03:02,851 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 16:03:03,291 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:03:03,295 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 16:03:03,397 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 16:03:03,423 INFO L193 MainTranslator]: Completed translation [2018-10-24 16:03:03,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:03 WrapperNode [2018-10-24 16:03:03,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 16:03:03,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 16:03:03,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 16:03:03,425 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 16:03:03,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:03" (1/1) ... [2018-10-24 16:03:03,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:03" (1/1) ... [2018-10-24 16:03:03,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 16:03:03,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 16:03:03,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 16:03:03,625 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 16:03:03,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:03" (1/1) ... [2018-10-24 16:03:03,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:03" (1/1) ... [2018-10-24 16:03:03,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:03" (1/1) ... [2018-10-24 16:03:03,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:03" (1/1) ... [2018-10-24 16:03:03,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:03" (1/1) ... [2018-10-24 16:03:03,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:03" (1/1) ... [2018-10-24 16:03:03,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:03" (1/1) ... [2018-10-24 16:03:03,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 16:03:03,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 16:03:03,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 16:03:03,711 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 16:03:03,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 16:03:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 16:03:03,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 16:03:03,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 16:03:07,132 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 16:03:07,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:03:07 BoogieIcfgContainer [2018-10-24 16:03:07,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 16:03:07,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 16:03:07,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 16:03:07,138 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 16:03:07,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:03:02" (1/3) ... [2018-10-24 16:03:07,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c63902c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:03:07, skipping insertion in model container [2018-10-24 16:03:07,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:03:03" (2/3) ... [2018-10-24 16:03:07,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c63902c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:03:07, skipping insertion in model container [2018-10-24 16:03:07,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:03:07" (3/3) ... [2018-10-24 16:03:07,142 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label59_true-unreach-call.c [2018-10-24 16:03:07,152 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 16:03:07,161 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 16:03:07,179 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 16:03:07,216 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 16:03:07,217 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 16:03:07,217 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 16:03:07,217 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 16:03:07,217 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 16:03:07,218 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 16:03:07,218 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 16:03:07,218 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 16:03:07,218 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 16:03:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-10-24 16:03:07,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-24 16:03:07,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:07,256 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:03:07,258 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:07,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:07,263 INFO L82 PathProgramCache]: Analyzing trace with hash -717159398, now seen corresponding path program 1 times [2018-10-24 16:03:07,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:07,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:07,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:07,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:07,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:07,850 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-10-24 16:03:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:07,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:07,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:03:07,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:03:07,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:03:07,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:07,902 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 4 states. [2018-10-24 16:03:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:10,565 INFO L93 Difference]: Finished difference Result 713 states and 1265 transitions. [2018-10-24 16:03:10,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:03:10,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-10-24 16:03:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:10,594 INFO L225 Difference]: With dead ends: 713 [2018-10-24 16:03:10,595 INFO L226 Difference]: Without dead ends: 499 [2018-10-24 16:03:10,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-10-24 16:03:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 344. [2018-10-24 16:03:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-24 16:03:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 599 transitions. [2018-10-24 16:03:10,698 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 599 transitions. Word has length 66 [2018-10-24 16:03:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:10,699 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 599 transitions. [2018-10-24 16:03:10,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:03:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 599 transitions. [2018-10-24 16:03:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-24 16:03:10,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:10,706 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:03:10,707 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:10,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:10,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1918985337, now seen corresponding path program 1 times [2018-10-24 16:03:10,708 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:10,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:10,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:10,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:10,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:10,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:10,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 16:03:11,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:03:11,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:03:11,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:11,001 INFO L87 Difference]: Start difference. First operand 344 states and 599 transitions. Second operand 4 states. [2018-10-24 16:03:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:12,920 INFO L93 Difference]: Finished difference Result 1246 states and 2268 transitions. [2018-10-24 16:03:12,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:03:12,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2018-10-24 16:03:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:12,930 INFO L225 Difference]: With dead ends: 1246 [2018-10-24 16:03:12,931 INFO L226 Difference]: Without dead ends: 904 [2018-10-24 16:03:12,935 INFO L605 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 [2018-10-24 16:03:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-10-24 16:03:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-10-24 16:03:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-10-24 16:03:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1414 transitions. [2018-10-24 16:03:13,005 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1414 transitions. Word has length 133 [2018-10-24 16:03:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:13,006 INFO L481 AbstractCegarLoop]: Abstraction has 904 states and 1414 transitions. [2018-10-24 16:03:13,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:03:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1414 transitions. [2018-10-24 16:03:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-24 16:03:13,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:13,013 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:03:13,014 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:13,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash -119858865, now seen corresponding path program 1 times [2018-10-24 16:03:13,015 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:13,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:13,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:13,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:13,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:13,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:13,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:03:13,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:03:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:03:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:13,240 INFO L87 Difference]: Start difference. First operand 904 states and 1414 transitions. Second operand 4 states. [2018-10-24 16:03:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:16,735 INFO L93 Difference]: Finished difference Result 2086 states and 3320 transitions. [2018-10-24 16:03:16,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:03:16,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-10-24 16:03:16,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:16,744 INFO L225 Difference]: With dead ends: 2086 [2018-10-24 16:03:16,744 INFO L226 Difference]: Without dead ends: 1184 [2018-10-24 16:03:16,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-10-24 16:03:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1184. [2018-10-24 16:03:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2018-10-24 16:03:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1643 transitions. [2018-10-24 16:03:16,778 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1643 transitions. Word has length 144 [2018-10-24 16:03:16,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:16,779 INFO L481 AbstractCegarLoop]: Abstraction has 1184 states and 1643 transitions. [2018-10-24 16:03:16,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:03:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1643 transitions. [2018-10-24 16:03:16,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-24 16:03:16,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:16,786 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 16:03:16,786 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:16,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:16,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1911128498, now seen corresponding path program 1 times [2018-10-24 16:03:16,787 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:16,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:16,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:16,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:16,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:17,144 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 16:03:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:17,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:17,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 16:03:17,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 16:03:17,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 16:03:17,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:17,280 INFO L87 Difference]: Start difference. First operand 1184 states and 1643 transitions. Second operand 4 states. [2018-10-24 16:03:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:19,476 INFO L93 Difference]: Finished difference Result 4046 states and 5700 transitions. [2018-10-24 16:03:19,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 16:03:19,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-10-24 16:03:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:19,491 INFO L225 Difference]: With dead ends: 4046 [2018-10-24 16:03:19,492 INFO L226 Difference]: Without dead ends: 2864 [2018-10-24 16:03:19,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 16:03:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2018-10-24 16:03:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2864. [2018-10-24 16:03:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2864 states. [2018-10-24 16:03:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 3730 transitions. [2018-10-24 16:03:19,549 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 3730 transitions. Word has length 194 [2018-10-24 16:03:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:19,550 INFO L481 AbstractCegarLoop]: Abstraction has 2864 states and 3730 transitions. [2018-10-24 16:03:19,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 16:03:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 3730 transitions. [2018-10-24 16:03:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-24 16:03:19,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:19,556 INFO L375 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 16:03:19,556 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:19,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:19,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1672247086, now seen corresponding path program 1 times [2018-10-24 16:03:19,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:19,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:19,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:19,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:19,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:19,884 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 16:03:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 129 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:20,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:03:20,150 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 16:03:20,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:20,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:03:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 129 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:20,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:03:20,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-10-24 16:03:20,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 16:03:20,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 16:03:20,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:03:20,795 INFO L87 Difference]: Start difference. First operand 2864 states and 3730 transitions. Second operand 8 states. [2018-10-24 16:03:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:29,844 INFO L93 Difference]: Finished difference Result 7412 states and 9675 transitions. [2018-10-24 16:03:29,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 16:03:29,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 216 [2018-10-24 16:03:29,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:29,864 INFO L225 Difference]: With dead ends: 7412 [2018-10-24 16:03:29,865 INFO L226 Difference]: Without dead ends: 4550 [2018-10-24 16:03:29,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-24 16:03:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2018-10-24 16:03:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4130. [2018-10-24 16:03:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4130 states. [2018-10-24 16:03:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4130 states to 4130 states and 4974 transitions. [2018-10-24 16:03:29,947 INFO L78 Accepts]: Start accepts. Automaton has 4130 states and 4974 transitions. Word has length 216 [2018-10-24 16:03:29,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:29,947 INFO L481 AbstractCegarLoop]: Abstraction has 4130 states and 4974 transitions. [2018-10-24 16:03:29,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 16:03:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 4130 states and 4974 transitions. [2018-10-24 16:03:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-24 16:03:29,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:29,954 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:03:29,954 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:29,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2135320279, now seen corresponding path program 1 times [2018-10-24 16:03:29,955 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:29,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:29,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:29,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:29,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:30,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:30,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 16:03:30,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 16:03:30,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 16:03:30,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:03:30,372 INFO L87 Difference]: Start difference. First operand 4130 states and 4974 transitions. Second operand 5 states. [2018-10-24 16:03:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:32,296 INFO L93 Difference]: Finished difference Result 9796 states and 11847 transitions. [2018-10-24 16:03:32,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 16:03:32,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 220 [2018-10-24 16:03:32,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:32,306 INFO L225 Difference]: With dead ends: 9796 [2018-10-24 16:03:32,306 INFO L226 Difference]: Without dead ends: 2384 [2018-10-24 16:03:32,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 16:03:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2018-10-24 16:03:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2104. [2018-10-24 16:03:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2104 states. [2018-10-24 16:03:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 2326 transitions. [2018-10-24 16:03:32,351 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 2326 transitions. Word has length 220 [2018-10-24 16:03:32,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:32,351 INFO L481 AbstractCegarLoop]: Abstraction has 2104 states and 2326 transitions. [2018-10-24 16:03:32,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 16:03:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 2326 transitions. [2018-10-24 16:03:32,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-24 16:03:32,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:32,357 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:03:32,358 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:32,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:32,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1388710448, now seen corresponding path program 1 times [2018-10-24 16:03:32,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:32,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:32,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:32,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:32,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:32,671 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 16:03:32,839 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-10-24 16:03:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-24 16:03:33,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 16:03:33,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 16:03:33,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 16:03:33,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 16:03:33,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-24 16:03:33,159 INFO L87 Difference]: Start difference. First operand 2104 states and 2326 transitions. Second operand 7 states. [2018-10-24 16:03:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:35,626 INFO L93 Difference]: Finished difference Result 4429 states and 4881 transitions. [2018-10-24 16:03:35,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 16:03:35,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 255 [2018-10-24 16:03:35,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:35,636 INFO L225 Difference]: With dead ends: 4429 [2018-10-24 16:03:35,637 INFO L226 Difference]: Without dead ends: 2327 [2018-10-24 16:03:35,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-24 16:03:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2018-10-24 16:03:35,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2244. [2018-10-24 16:03:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2018-10-24 16:03:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 2470 transitions. [2018-10-24 16:03:35,677 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 2470 transitions. Word has length 255 [2018-10-24 16:03:35,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:35,677 INFO L481 AbstractCegarLoop]: Abstraction has 2244 states and 2470 transitions. [2018-10-24 16:03:35,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 16:03:35,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 2470 transitions. [2018-10-24 16:03:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-10-24 16:03:35,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:35,686 INFO L375 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:03:35,686 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:35,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1108328208, now seen corresponding path program 1 times [2018-10-24 16:03:35,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:35,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:35,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:35,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:35,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:36,320 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-10-24 16:03:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 297 proven. 100 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-24 16:03:36,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:03:36,457 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 16:03:36,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:36,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:03:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 334 proven. 63 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-24 16:03:37,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:03:37,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-10-24 16:03:37,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 16:03:37,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 16:03:37,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-10-24 16:03:37,238 INFO L87 Difference]: Start difference. First operand 2244 states and 2470 transitions. Second operand 8 states. [2018-10-24 16:03:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:40,436 INFO L93 Difference]: Finished difference Result 5746 states and 6336 transitions. [2018-10-24 16:03:40,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 16:03:40,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 367 [2018-10-24 16:03:40,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:40,449 INFO L225 Difference]: With dead ends: 5746 [2018-10-24 16:03:40,449 INFO L226 Difference]: Without dead ends: 3644 [2018-10-24 16:03:40,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-24 16:03:40,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2018-10-24 16:03:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 2524. [2018-10-24 16:03:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2018-10-24 16:03:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 2740 transitions. [2018-10-24 16:03:40,498 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 2740 transitions. Word has length 367 [2018-10-24 16:03:40,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:40,499 INFO L481 AbstractCegarLoop]: Abstraction has 2524 states and 2740 transitions. [2018-10-24 16:03:40,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 16:03:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 2740 transitions. [2018-10-24 16:03:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-24 16:03:40,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:40,509 INFO L375 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:03:40,509 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:40,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1093761571, now seen corresponding path program 1 times [2018-10-24 16:03:40,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:40,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:40,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:40,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:40,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:41,014 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 16:03:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 37 proven. 424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 16:03:42,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:03:42,067 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 16:03:42,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:42,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:03:42,743 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-10-24 16:03:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 12 proven. 386 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-24 16:03:44,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:03:44,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 16 [2018-10-24 16:03:44,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-24 16:03:44,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-24 16:03:44,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-10-24 16:03:44,102 INFO L87 Difference]: Start difference. First operand 2524 states and 2740 transitions. Second operand 17 states. [2018-10-24 16:03:55,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:55,577 INFO L93 Difference]: Finished difference Result 5905 states and 6429 transitions. [2018-10-24 16:03:55,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-24 16:03:55,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 386 [2018-10-24 16:03:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:03:55,591 INFO L225 Difference]: With dead ends: 5905 [2018-10-24 16:03:55,592 INFO L226 Difference]: Without dead ends: 3523 [2018-10-24 16:03:55,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 382 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2018-10-24 16:03:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2018-10-24 16:03:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 2728. [2018-10-24 16:03:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2018-10-24 16:03:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 2941 transitions. [2018-10-24 16:03:55,650 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 2941 transitions. Word has length 386 [2018-10-24 16:03:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:03:55,651 INFO L481 AbstractCegarLoop]: Abstraction has 2728 states and 2941 transitions. [2018-10-24 16:03:55,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-24 16:03:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 2941 transitions. [2018-10-24 16:03:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-10-24 16:03:55,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:03:55,659 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 16:03:55,660 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:03:55,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:03:55,660 INFO L82 PathProgramCache]: Analyzing trace with hash 822864931, now seen corresponding path program 1 times [2018-10-24 16:03:55,660 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:03:55,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:03:55,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:55,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:55,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:03:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 341 proven. 580 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-10-24 16:03:56,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:03:56,839 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 16:03:56,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:03:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:03:56,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:03:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 822 proven. 38 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-10-24 16:03:57,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:03:57,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 9 [2018-10-24 16:03:57,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 16:03:57,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 16:03:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-24 16:03:57,543 INFO L87 Difference]: Start difference. First operand 2728 states and 2941 transitions. Second operand 10 states. [2018-10-24 16:03:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:03:59,990 INFO L93 Difference]: Finished difference Result 5413 states and 5835 transitions. [2018-10-24 16:03:59,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 16:03:59,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 555 [2018-10-24 16:03:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:04:00,003 INFO L225 Difference]: With dead ends: 5413 [2018-10-24 16:04:00,003 INFO L226 Difference]: Without dead ends: 2827 [2018-10-24 16:04:00,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 554 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-24 16:04:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2018-10-24 16:04:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2588. [2018-10-24 16:04:00,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2588 states. [2018-10-24 16:04:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2588 states to 2588 states and 2772 transitions. [2018-10-24 16:04:00,057 INFO L78 Accepts]: Start accepts. Automaton has 2588 states and 2772 transitions. Word has length 555 [2018-10-24 16:04:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:04:00,058 INFO L481 AbstractCegarLoop]: Abstraction has 2588 states and 2772 transitions. [2018-10-24 16:04:00,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 16:04:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2588 states and 2772 transitions. [2018-10-24 16:04:00,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2018-10-24 16:04:00,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 16:04:00,067 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-24 16:04:00,067 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 16:04:00,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 16:04:00,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1620667456, now seen corresponding path program 1 times [2018-10-24 16:04:00,068 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 16:04:00,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 16:04:00,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:04:00,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:04:00,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 16:04:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:04:00,554 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-24 16:04:00,760 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 16:04:01,170 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-10-24 16:04:01,572 WARN L179 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-10-24 16:04:02,000 WARN L179 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-10-24 16:04:02,473 WARN L179 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-10-24 16:04:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 715 proven. 267 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-10-24 16:04:03,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 16:04:03,145 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 16:04:03,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 16:04:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 16:04:03,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 16:04:08,824 WARN L179 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 41 DAG size of output: 20 [2018-10-24 16:04:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 798 proven. 128 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-10-24 16:04:09,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 16:04:09,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2018-10-24 16:04:09,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 16:04:09,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 16:04:09,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=142, Unknown=2, NotChecked=0, Total=182 [2018-10-24 16:04:09,934 INFO L87 Difference]: Start difference. First operand 2588 states and 2772 transitions. Second operand 14 states. [2018-10-24 16:04:17,774 WARN L179 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-10-24 16:04:20,388 WARN L179 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-10-24 16:04:23,811 WARN L179 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 32 [2018-10-24 16:04:26,634 WARN L179 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-10-24 16:04:27,927 WARN L179 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-10-24 16:04:28,866 WARN L179 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2018-10-24 16:04:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 16:04:37,851 INFO L93 Difference]: Finished difference Result 6416 states and 6856 transitions. [2018-10-24 16:04:37,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-24 16:04:37,852 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 585 [2018-10-24 16:04:37,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 16:04:37,853 INFO L225 Difference]: With dead ends: 6416 [2018-10-24 16:04:37,853 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 16:04:37,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=346, Invalid=1292, Unknown=2, NotChecked=0, Total=1640 [2018-10-24 16:04:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 16:04:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 16:04:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 16:04:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 16:04:37,859 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 585 [2018-10-24 16:04:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 16:04:37,859 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 16:04:37,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 16:04:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 16:04:37,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 16:04:37,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 16:04:37,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:37,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:37,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:37,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:37,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:37,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:37,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:37,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:37,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:37,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,348 WARN L179 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 383 DAG size of output: 284 [2018-10-24 16:04:38,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 16:04:38,792 WARN L179 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 374 DAG size of output: 274 [2018-10-24 16:04:48,871 WARN L179 SmtUtils]: Spent 10.07 s on a formula simplification. DAG size of input: 268 DAG size of output: 86 [2018-10-24 16:05:00,196 WARN L179 SmtUtils]: Spent 11.32 s on a formula simplification. DAG size of input: 259 DAG size of output: 81 [2018-10-24 16:05:00,215 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-10-24 16:05:00,215 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,216 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,216 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,216 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,216 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,216 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,216 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-10-24 16:05:00,216 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-10-24 16:05:00,216 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-24 16:05:00,216 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-24 16:05:00,217 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-24 16:05:00,217 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-24 16:05:00,217 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-24 16:05:00,217 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-24 16:05:00,217 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-10-24 16:05:00,217 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-10-24 16:05:00,217 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-10-24 16:05:00,217 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,217 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,217 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,218 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,218 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,218 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-10-24 16:05:00,218 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-10-24 16:05:00,218 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-10-24 16:05:00,218 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-10-24 16:05:00,218 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-24 16:05:00,218 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-24 16:05:00,218 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-24 16:05:00,218 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-24 16:05:00,219 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-24 16:05:00,219 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-10-24 16:05:00,219 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-10-24 16:05:00,219 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-10-24 16:05:00,219 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-10-24 16:05:00,219 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-10-24 16:05:00,219 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,219 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,219 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,220 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,220 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,220 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-10-24 16:05:00,220 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-24 16:05:00,220 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-24 16:05:00,220 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-24 16:05:00,220 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-24 16:05:00,220 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-24 16:05:00,221 INFO L421 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse6 (= ~a19~0 9))) (let ((.cse2 (not .cse6)) (.cse11 (= ~a10~0 0)) (.cse1 (<= ~a10~0 2)) (.cse0 (<= 1 ~a10~0)) (.cse5 (= ~a10~0 3)) (.cse13 (<= ~a1~0 218)) (.cse7 (= ~a12~0 0)) (.cse12 (or (not (= 5 ULTIMATE.start_calculate_output_~input)) (< 218 ~a1~0))) (.cse4 (< 0 (+ ~a1~0 13))) (.cse9 (= ~a4~0 14)) (.cse3 (<= ~a19~0 8))) (or (and .cse0 (and .cse1 .cse2)) (and .cse3 .cse4) (and .cse5 (<= ~a1~0 4) .cse6 .cse7 (exists ((v_~a1~0_346 Int)) (let ((.cse8 (mod v_~a1~0_346 299993))) (and (not (= 0 .cse8)) (<= (+ v_~a1~0_346 13) 0) (< v_~a1~0_346 0) (<= .cse8 (+ ~a1~0 600000))))) .cse9 (not (= 2 ULTIMATE.start_calculate_output_~input))) (and .cse5 (exists ((v_prenex_12 Int)) (let ((.cse10 (* 5 (div v_prenex_12 5)))) (and (<= 0 v_prenex_12) (<= (+ (div .cse10 5) 505228) ~a1~0) (<= 23 v_prenex_12) (<= 0 .cse10)))) .cse6 .cse7 .cse9) (and .cse11 .cse2) (and .cse11 .cse7 .cse12 .cse4 .cse9) (and (and .cse1 .cse7 .cse9) .cse0) (and .cse6 (= ~a10~0 4) .cse7 .cse9 (or .cse13 (not (= ULTIMATE.start_calculate_output_~input 5)))) (and .cse5 .cse13 .cse6 .cse7 .cse12 .cse4 .cse9) (and .cse3 (not (= 3 ~a10~0)))))) [2018-10-24 16:05:00,221 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-10-24 16:05:00,221 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-10-24 16:05:00,221 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-10-24 16:05:00,221 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-10-24 16:05:00,221 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,222 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,222 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,222 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,222 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,222 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-10-24 16:05:00,222 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-10-24 16:05:00,222 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-10-24 16:05:00,222 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-24 16:05:00,222 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-24 16:05:00,222 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-24 16:05:00,223 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-24 16:05:00,223 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-24 16:05:00,223 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-10-24 16:05:00,223 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-10-24 16:05:00,223 INFO L428 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2018-10-24 16:05:00,223 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-10-24 16:05:00,223 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-10-24 16:05:00,223 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-10-24 16:05:00,223 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,223 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,224 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,224 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,224 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,224 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-24 16:05:00,224 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-24 16:05:00,224 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-24 16:05:00,224 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-24 16:05:00,224 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-24 16:05:00,224 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-10-24 16:05:00,224 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-10-24 16:05:00,225 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-10-24 16:05:00,225 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-10-24 16:05:00,225 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,225 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,225 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,225 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,225 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,225 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-10-24 16:05:00,225 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-10-24 16:05:00,225 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-10-24 16:05:00,226 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-10-24 16:05:00,226 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-24 16:05:00,226 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-24 16:05:00,226 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-24 16:05:00,226 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-24 16:05:00,226 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-24 16:05:00,226 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-10-24 16:05:00,226 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-10-24 16:05:00,226 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 16:05:00,227 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-10-24 16:05:00,227 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-10-24 16:05:00,227 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse8 (= ~a19~0 9))) (let ((.cse2 (not .cse8)) (.cse4 (= ~a10~0 0)) (.cse1 (<= ~a10~0 2)) (.cse0 (<= 1 ~a10~0)) (.cse7 (= ~a10~0 3)) (.cse13 (<= ~a1~0 218)) (.cse3 (= ~a12~0 0)) (.cse12 (or (not (= 5 ULTIMATE.start_calculate_output_~input)) (< 218 ~a1~0))) (.cse6 (< 0 (+ ~a1~0 13))) (.cse10 (= ~a4~0 14)) (.cse5 (<= ~a19~0 8))) (or (and .cse0 (and .cse1 .cse2)) (and .cse3 (and (<= 23 ~a1~0) (<= ~a1~0 23) (= 14 ~a4~0) .cse4)) (and .cse5 .cse6) (and .cse7 (<= ~a1~0 4) .cse8 .cse3 (exists ((v_~a1~0_346 Int)) (let ((.cse9 (mod v_~a1~0_346 299993))) (and (not (= 0 .cse9)) (<= (+ v_~a1~0_346 13) 0) (< v_~a1~0_346 0) (<= .cse9 (+ ~a1~0 600000))))) .cse10 (not (= 2 ULTIMATE.start_calculate_output_~input))) (and .cse7 (exists ((v_prenex_12 Int)) (let ((.cse11 (* 5 (div v_prenex_12 5)))) (and (<= 0 v_prenex_12) (<= (+ (div .cse11 5) 505228) ~a1~0) (<= 23 v_prenex_12) (<= 0 .cse11)))) .cse8 .cse3 .cse10) (and .cse4 .cse2) (and .cse4 .cse3 .cse12 .cse6 .cse10) (and (and .cse1 .cse3 .cse10) .cse0) (and .cse8 (= ~a10~0 4) .cse3 .cse10 (or .cse13 (not (= ULTIMATE.start_calculate_output_~input 5)))) (and .cse7 .cse13 .cse8 .cse3 .cse12 .cse6 .cse10) (and .cse5 (not (= 3 ~a10~0)))))) [2018-10-24 16:05:00,227 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-10-24 16:05:00,227 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,227 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,228 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,228 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,228 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,228 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-10-24 16:05:00,228 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,228 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-10-24 16:05:00,228 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-10-24 16:05:00,228 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-10-24 16:05:00,228 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-24 16:05:00,228 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-24 16:05:00,229 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-24 16:05:00,229 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-24 16:05:00,229 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-24 16:05:00,229 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-24 16:05:00,229 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-10-24 16:05:00,229 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-10-24 16:05:00,229 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-10-24 16:05:00,229 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-10-24 16:05:00,229 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,229 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,229 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,229 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,230 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,230 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,230 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-10-24 16:05:00,230 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-10-24 16:05:00,230 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-10-24 16:05:00,230 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 16:05:00,230 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-24 16:05:00,230 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-24 16:05:00,230 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-24 16:05:00,230 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-24 16:05:00,231 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-24 16:05:00,231 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-24 16:05:00,231 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-10-24 16:05:00,231 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-10-24 16:05:00,231 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-10-24 16:05:00,231 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-10-24 16:05:00,231 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-10-24 16:05:00,231 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-10-24 16:05:00,231 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,231 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,232 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,232 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,232 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,232 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,232 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-10-24 16:05:00,232 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-24 16:05:00,232 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-24 16:05:00,232 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-24 16:05:00,232 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-24 16:05:00,232 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-24 16:05:00,233 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 16:05:00,233 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-24 16:05:00,233 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-10-24 16:05:00,233 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-10-24 16:05:00,233 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-10-24 16:05:00,233 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-10-24 16:05:00,233 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-10-24 16:05:00,233 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-10-24 16:05:00,233 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,233 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,234 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,234 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,234 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,234 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,234 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-10-24 16:05:00,234 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-10-24 16:05:00,234 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-10-24 16:05:00,234 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-24 16:05:00,235 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-24 16:05:00,235 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-24 16:05:00,235 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-24 16:05:00,235 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-24 16:05:00,235 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-24 16:05:00,235 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-10-24 16:05:00,235 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-10-24 16:05:00,235 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 16:05:00,236 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 199) no Hoare annotation was computed. [2018-10-24 16:05:00,236 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-10-24 16:05:00,236 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,236 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,236 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,236 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,236 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,236 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 574) no Hoare annotation was computed. [2018-10-24 16:05:00,236 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-10-24 16:05:00,236 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-10-24 16:05:00,237 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-10-24 16:05:00,237 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-24 16:05:00,237 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-24 16:05:00,237 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-24 16:05:00,237 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-24 16:05:00,237 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-24 16:05:00,237 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-24 16:05:00,237 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-10-24 16:05:00,237 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-10-24 16:05:00,237 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-10-24 16:05:00,245 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,246 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,247 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,247 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,247 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,247 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,258 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,258 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,259 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,259 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,259 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,259 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,260 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,260 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,262 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,263 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,263 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,263 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,264 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,264 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,264 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,264 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,266 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,266 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,267 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,268 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:05:00 BoogieIcfgContainer [2018-10-24 16:05:00,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 16:05:00,272 INFO L168 Benchmark]: Toolchain (without parser) took 117522.63 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -673.4 MB). Peak memory consumption was 907.3 MB. Max. memory is 7.1 GB. [2018-10-24 16:05:00,274 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 16:05:00,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-24 16:05:00,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 199.19 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-24 16:05:00,276 INFO L168 Benchmark]: Boogie Preprocessor took 86.24 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 16:05:00,277 INFO L168 Benchmark]: RCFGBuilder took 3423.03 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 131.5 MB). Peak memory consumption was 131.5 MB. Max. memory is 7.1 GB. [2018-10-24 16:05:00,278 INFO L168 Benchmark]: TraceAbstraction took 113136.60 ms. Allocated memory was 2.2 GB in the beginning and 3.1 GB in the end (delta: 860.4 MB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -30.5 MB). Peak memory consumption was 829.9 MB. Max. memory is 7.1 GB. [2018-10-24 16:05:00,289 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 671.79 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 199.19 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 86.24 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3423.03 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 131.5 MB). Peak memory consumption was 131.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 113136.60 ms. Allocated memory was 2.2 GB in the beginning and 3.1 GB in the end (delta: 860.4 MB). Free memory was 2.0 GB in the beginning and 2.1 GB in the end (delta: -30.5 MB). Peak memory consumption was 829.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 199]: 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 [2018-10-24 16:05:00,303 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,303 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,304 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,304 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,304 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,304 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,305 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,305 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,307 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,307 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,307 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,307 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,308 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,308 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,308 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,308 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] Derived loop invariant: ((((((((((1 <= a10 && a10 <= 2 && !(a19 == 9)) || (a12 == 0 && ((23 <= a1 && a1 <= 23) && 14 == a4) && a10 == 0)) || (a19 <= 8 && 0 < a1 + 13)) || ((((((a10 == 3 && a1 <= 4) && a19 == 9) && a12 == 0) && (\exists v_~a1~0_346 : int :: ((!(0 == v_~a1~0_346 % 299993) && v_~a1~0_346 + 13 <= 0) && v_~a1~0_346 < 0) && v_~a1~0_346 % 299993 <= a1 + 600000)) && a4 == 14) && !(2 == input))) || ((((a10 == 3 && (\exists v_prenex_12 : int :: ((0 <= v_prenex_12 && 5 * (v_prenex_12 / 5) / 5 + 505228 <= a1) && 23 <= v_prenex_12) && 0 <= 5 * (v_prenex_12 / 5))) && a19 == 9) && a12 == 0) && a4 == 14)) || (a10 == 0 && !(a19 == 9))) || ((((a10 == 0 && a12 == 0) && (!(5 == input) || 218 < a1)) && 0 < a1 + 13) && a4 == 14)) || (((a10 <= 2 && a12 == 0) && a4 == 14) && 1 <= a10)) || ((((a19 == 9 && a10 == 4) && a12 == 0) && a4 == 14) && (a1 <= 218 || !(input == 5)))) || ((((((a10 == 3 && a1 <= 218) && a19 == 9) && a12 == 0) && (!(5 == input) || 218 < a1)) && 0 < a1 + 13) && a4 == 14)) || (a19 <= 8 && !(3 == a10)) - InvariantResult [Line: 20]: Loop Invariant [2018-10-24 16:05:00,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,310 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,311 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,312 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_346,QUANTIFIED] [2018-10-24 16:05:00,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-10-24 16:05:00,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] Derived loop invariant: (((((((((1 <= a10 && a10 <= 2 && !(a19 == 9)) || (a19 <= 8 && 0 < a1 + 13)) || ((((((a10 == 3 && a1 <= 4) && a19 == 9) && a12 == 0) && (\exists v_~a1~0_346 : int :: ((!(0 == v_~a1~0_346 % 299993) && v_~a1~0_346 + 13 <= 0) && v_~a1~0_346 < 0) && v_~a1~0_346 % 299993 <= a1 + 600000)) && a4 == 14) && !(2 == input))) || ((((a10 == 3 && (\exists v_prenex_12 : int :: ((0 <= v_prenex_12 && 5 * (v_prenex_12 / 5) / 5 + 505228 <= a1) && 23 <= v_prenex_12) && 0 <= 5 * (v_prenex_12 / 5))) && a19 == 9) && a12 == 0) && a4 == 14)) || (a10 == 0 && !(a19 == 9))) || ((((a10 == 0 && a12 == 0) && (!(5 == input) || 218 < a1)) && 0 < a1 + 13) && a4 == 14)) || (((a10 <= 2 && a12 == 0) && a4 == 14) && 1 <= a10)) || ((((a19 == 9 && a10 == 4) && a12 == 0) && a4 == 14) && (a1 <= 218 || !(input == 5)))) || ((((((a10 == 3 && a1 <= 218) && a19 == 9) && a12 == 0) && (!(5 == input) || 218 < a1)) && 0 < a1 + 13) && a4 == 14)) || (a19 <= 8 && !(3 == a10)) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 207 locations, 1 error locations. SAFE Result, 113.0s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 68.9s AutomataDifference, 0.0s DeadEndRemovalTime, 22.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1221 SDtfs, 9097 SDslu, 1299 SDs, 0 SdLazy, 30364 SolverSat, 2722 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 49.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2270 GetRequests, 2136 SyntacticMatches, 12 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 24.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4130occurred in iteration=5, 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.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 3092 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 140 NumberOfFragments, 432 HoareAnnotationTreeSize, 3 FomulaSimplifications, 115467 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 24586 FormulaSimplificationTreeSizeReductionInter, 21.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 5230 NumberOfCodeBlocks, 5230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 5214 ConstructedInterpolants, 464 QuantifiedInterpolants, 20571945 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2730 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 5460/7574 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...