./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem10_label49_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem10_label49_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2ee6781c62be40fa372129eaacaba9832af3ce9 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 03:32:37,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:32:37,688 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:32:37,701 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:32:37,701 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:32:37,703 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:32:37,704 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:32:37,706 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:32:37,708 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:32:37,709 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:32:37,710 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:32:37,710 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:32:37,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:32:37,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:32:37,714 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:32:37,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:32:37,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:32:37,718 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:32:37,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:32:37,722 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:32:37,723 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:32:37,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:32:37,727 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:32:37,727 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:32:37,727 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:32:37,728 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:32:37,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:32:37,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:32:37,731 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:32:37,733 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:32:37,733 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:32:37,734 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:32:37,734 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:32:37,734 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:32:37,735 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:32:37,737 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:32:37,737 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:32:37,760 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:32:37,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:32:37,761 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:32:37,762 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:32:37,762 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:32:37,762 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:32:37,762 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:32:37,762 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:32:37,762 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:32:37,763 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:32:37,764 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:32:37,764 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:32:37,764 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:32:37,764 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:32:37,764 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:32:37,765 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:32:37,765 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:32:37,766 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:32:37,766 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:32:37,766 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:32:37,766 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:32:37,766 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:32:37,766 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:32:37,767 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:32:37,768 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:32:37,768 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:32:37,768 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:32:37,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:32:37,768 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2ee6781c62be40fa372129eaacaba9832af3ce9 [2019-01-12 03:32:37,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:32:37,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:32:37,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:32:37,839 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:32:37,839 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:32:37,840 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem10_label49_true-unreach-call.c [2019-01-12 03:32:37,896 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dca317ae/453cb753028e424d9401416438b9a5fa/FLAG647ac8846 [2019-01-12 03:32:38,534 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:32:38,537 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem10_label49_true-unreach-call.c [2019-01-12 03:32:38,555 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dca317ae/453cb753028e424d9401416438b9a5fa/FLAG647ac8846 [2019-01-12 03:32:38,758 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dca317ae/453cb753028e424d9401416438b9a5fa [2019-01-12 03:32:38,762 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:32:38,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:32:38,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:32:38,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:32:38,769 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:32:38,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:32:38" (1/1) ... [2019-01-12 03:32:38,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c850f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:38, skipping insertion in model container [2019-01-12 03:32:38,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:32:38" (1/1) ... [2019-01-12 03:32:38,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:32:38,854 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:32:39,380 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:32:39,386 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:32:39,510 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:32:39,532 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:32:39,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:39 WrapperNode [2019-01-12 03:32:39,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:32:39,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:32:39,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:32:39,535 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:32:39,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:39" (1/1) ... [2019-01-12 03:32:39,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:39" (1/1) ... [2019-01-12 03:32:39,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:32:39,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:32:39,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:32:39,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:32:39,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:39" (1/1) ... [2019-01-12 03:32:39,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:39" (1/1) ... [2019-01-12 03:32:39,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:39" (1/1) ... [2019-01-12 03:32:39,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:39" (1/1) ... [2019-01-12 03:32:39,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:39" (1/1) ... [2019-01-12 03:32:39,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:39" (1/1) ... [2019-01-12 03:32:39,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:39" (1/1) ... [2019-01-12 03:32:39,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:32:39,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:32:39,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:32:39,867 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:32:39,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:32:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:32:39,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:32:42,935 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:32:42,936 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:32:42,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:32:42 BoogieIcfgContainer [2019-01-12 03:32:42,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:32:42,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:32:42,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:32:42,942 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:32:42,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:32:38" (1/3) ... [2019-01-12 03:32:42,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:32:42, skipping insertion in model container [2019-01-12 03:32:42,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:39" (2/3) ... [2019-01-12 03:32:42,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@624d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:32:42, skipping insertion in model container [2019-01-12 03:32:42,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:32:42" (3/3) ... [2019-01-12 03:32:42,946 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label49_true-unreach-call.c [2019-01-12 03:32:42,957 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:32:42,966 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:32:42,983 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:32:43,019 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:32:43,020 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:32:43,020 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:32:43,020 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:32:43,020 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:32:43,020 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:32:43,021 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:32:43,021 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:32:43,021 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:32:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-01-12 03:32:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 03:32:43,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:43,053 INFO L402 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] [2019-01-12 03:32:43,055 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:43,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:43,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1644072970, now seen corresponding path program 1 times [2019-01-12 03:32:43,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:43,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:43,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:43,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:43,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:43,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:43,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:32:43,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:43,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:43,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:43,420 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-01-12 03:32:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:46,236 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-01-12 03:32:46,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:46,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-01-12 03:32:46,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:46,256 INFO L225 Difference]: With dead ends: 694 [2019-01-12 03:32:46,257 INFO L226 Difference]: Without dead ends: 421 [2019-01-12 03:32:46,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:46,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-12 03:32:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-01-12 03:32:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-12 03:32:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 586 transitions. [2019-01-12 03:32:46,387 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 586 transitions. Word has length 22 [2019-01-12 03:32:46,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:46,388 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 586 transitions. [2019-01-12 03:32:46,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:46,388 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 586 transitions. [2019-01-12 03:32:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-12 03:32:46,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:46,392 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:32:46,392 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:46,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:46,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1869682614, now seen corresponding path program 1 times [2019-01-12 03:32:46,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:46,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:46,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:46,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:46,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:46,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:32:46,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:32:46,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:47,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:32:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-12 03:32:47,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:32:47,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-01-12 03:32:47,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:32:47,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:32:47,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:32:47,157 INFO L87 Difference]: Start difference. First operand 421 states and 586 transitions. Second operand 7 states. [2019-01-12 03:32:49,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:49,485 INFO L93 Difference]: Finished difference Result 1813 states and 2495 transitions. [2019-01-12 03:32:49,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:32:49,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-01-12 03:32:49,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:49,494 INFO L225 Difference]: With dead ends: 1813 [2019-01-12 03:32:49,495 INFO L226 Difference]: Without dead ends: 1394 [2019-01-12 03:32:49,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:32:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-01-12 03:32:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 699. [2019-01-12 03:32:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-01-12 03:32:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 949 transitions. [2019-01-12 03:32:49,543 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 949 transitions. Word has length 88 [2019-01-12 03:32:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:49,543 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 949 transitions. [2019-01-12 03:32:49,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:32:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 949 transitions. [2019-01-12 03:32:49,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-12 03:32:49,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:49,552 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:32:49,553 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:49,553 INFO L82 PathProgramCache]: Analyzing trace with hash 799483047, now seen corresponding path program 1 times [2019-01-12 03:32:49,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:49,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:49,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:49,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:49,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:49,907 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 03:32:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-12 03:32:50,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:50,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:32:50,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:50,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:50,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:50,002 INFO L87 Difference]: Start difference. First operand 699 states and 949 transitions. Second operand 4 states. [2019-01-12 03:32:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:52,320 INFO L93 Difference]: Finished difference Result 1952 states and 2697 transitions. [2019-01-12 03:32:52,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:52,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-01-12 03:32:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:52,329 INFO L225 Difference]: With dead ends: 1952 [2019-01-12 03:32:52,330 INFO L226 Difference]: Without dead ends: 1394 [2019-01-12 03:32:52,331 INFO L631 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 [2019-01-12 03:32:52,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-01-12 03:32:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 977. [2019-01-12 03:32:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-01-12 03:32:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1227 transitions. [2019-01-12 03:32:52,362 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1227 transitions. Word has length 157 [2019-01-12 03:32:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:52,363 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1227 transitions. [2019-01-12 03:32:52,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1227 transitions. [2019-01-12 03:32:52,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-12 03:32:52,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:52,372 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:32:52,372 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:52,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:52,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1913542173, now seen corresponding path program 1 times [2019-01-12 03:32:52,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:52,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:52,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:52,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:52,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:52,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:52,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:32:52,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:52,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:52,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:52,653 INFO L87 Difference]: Start difference. First operand 977 states and 1227 transitions. Second operand 4 states. [2019-01-12 03:32:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:54,463 INFO L93 Difference]: Finished difference Result 1952 states and 2492 transitions. [2019-01-12 03:32:54,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:54,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-01-12 03:32:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:54,472 INFO L225 Difference]: With dead ends: 1952 [2019-01-12 03:32:54,472 INFO L226 Difference]: Without dead ends: 1116 [2019-01-12 03:32:54,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:54,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-01-12 03:32:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2019-01-12 03:32:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2019-01-12 03:32:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1321 transitions. [2019-01-12 03:32:54,501 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1321 transitions. Word has length 220 [2019-01-12 03:32:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:54,502 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1321 transitions. [2019-01-12 03:32:54,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1321 transitions. [2019-01-12 03:32:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-01-12 03:32:54,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:54,508 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:32:54,508 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:54,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:54,509 INFO L82 PathProgramCache]: Analyzing trace with hash 298360043, now seen corresponding path program 1 times [2019-01-12 03:32:54,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:54,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:54,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:54,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:54,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:32:54,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:32:54,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:32:54,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:32:54,959 INFO L87 Difference]: Start difference. First operand 1116 states and 1321 transitions. Second operand 5 states. [2019-01-12 03:32:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:57,037 INFO L93 Difference]: Finished difference Result 3064 states and 3659 transitions. [2019-01-12 03:32:57,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:32:57,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 229 [2019-01-12 03:32:57,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:57,044 INFO L225 Difference]: With dead ends: 3064 [2019-01-12 03:32:57,045 INFO L226 Difference]: Without dead ends: 1116 [2019-01-12 03:32:57,047 INFO L631 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 [2019-01-12 03:32:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-01-12 03:32:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2019-01-12 03:32:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2019-01-12 03:32:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1233 transitions. [2019-01-12 03:32:57,068 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1233 transitions. Word has length 229 [2019-01-12 03:32:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:57,069 INFO L480 AbstractCegarLoop]: Abstraction has 1116 states and 1233 transitions. [2019-01-12 03:32:57,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:32:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1233 transitions. [2019-01-12 03:32:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-01-12 03:32:57,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:57,073 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:32:57,074 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1307309551, now seen corresponding path program 1 times [2019-01-12 03:32:57,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:57,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:57,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:57,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:57,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:57,681 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 03:32:57,976 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-01-12 03:32:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 142 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:58,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:32:58,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:32:58,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:58,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:32:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-01-12 03:32:58,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:32:58,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 03:32:58,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:32:58,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:32:58,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:32:58,472 INFO L87 Difference]: Start difference. First operand 1116 states and 1233 transitions. Second operand 7 states. [2019-01-12 03:33:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:03,570 INFO L93 Difference]: Finished difference Result 3905 states and 4402 transitions. [2019-01-12 03:33:03,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:33:03,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2019-01-12 03:33:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:03,591 INFO L225 Difference]: With dead ends: 3905 [2019-01-12 03:33:03,592 INFO L226 Difference]: Without dead ends: 2784 [2019-01-12 03:33:03,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:33:03,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2019-01-12 03:33:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2367. [2019-01-12 03:33:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-01-12 03:33:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2624 transitions. [2019-01-12 03:33:03,652 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2624 transitions. Word has length 265 [2019-01-12 03:33:03,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:03,652 INFO L480 AbstractCegarLoop]: Abstraction has 2367 states and 2624 transitions. [2019-01-12 03:33:03,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:33:03,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2624 transitions. [2019-01-12 03:33:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-01-12 03:33:03,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:03,661 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 03:33:03,662 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:03,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1440717452, now seen corresponding path program 1 times [2019-01-12 03:33:03,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:03,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:03,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:03,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:04,191 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-12 03:33:04,452 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 03:33:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 256 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:04,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:33:04,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:33:04,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:04,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:33:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:04,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:33:04,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-01-12 03:33:04,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:33:04,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:33:04,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:33:04,956 INFO L87 Difference]: Start difference. First operand 2367 states and 2624 transitions. Second operand 8 states. [2019-01-12 03:33:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:07,658 INFO L93 Difference]: Finished difference Result 5288 states and 5919 transitions. [2019-01-12 03:33:07,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 03:33:07,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 270 [2019-01-12 03:33:07,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:07,673 INFO L225 Difference]: With dead ends: 5288 [2019-01-12 03:33:07,674 INFO L226 Difference]: Without dead ends: 3062 [2019-01-12 03:33:07,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:33:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2019-01-12 03:33:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 2228. [2019-01-12 03:33:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2019-01-12 03:33:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2377 transitions. [2019-01-12 03:33:07,734 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2377 transitions. Word has length 270 [2019-01-12 03:33:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:07,736 INFO L480 AbstractCegarLoop]: Abstraction has 2228 states and 2377 transitions. [2019-01-12 03:33:07,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:33:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2377 transitions. [2019-01-12 03:33:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-01-12 03:33:07,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:07,742 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:07,742 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:07,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:07,743 INFO L82 PathProgramCache]: Analyzing trace with hash -876938456, now seen corresponding path program 1 times [2019-01-12 03:33:07,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:07,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:07,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:07,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:07,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:08,328 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-12 03:33:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 270 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:08,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:33:08,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:33:08,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:08,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:33:10,761 WARN L181 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 118 DAG size of output: 16 [2019-01-12 03:33:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-01-12 03:33:10,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:33:10,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-01-12 03:33:10,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:33:10,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:33:10,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:33:10,934 INFO L87 Difference]: Start difference. First operand 2228 states and 2377 transitions. Second operand 7 states. [2019-01-12 03:33:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:17,789 INFO L93 Difference]: Finished difference Result 5981 states and 6454 transitions. [2019-01-12 03:33:17,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 03:33:17,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 283 [2019-01-12 03:33:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:17,790 INFO L225 Difference]: With dead ends: 5981 [2019-01-12 03:33:17,790 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:33:17,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-01-12 03:33:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:33:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:33:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:33:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:33:17,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 283 [2019-01-12 03:33:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:17,799 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:33:17,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:33:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:33:17,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:33:17,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:33:18,898 WARN L181 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 64 [2019-01-12 03:33:19,470 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 64 [2019-01-12 03:33:19,474 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-01-12 03:33:19,475 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,475 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,475 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,475 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,475 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,475 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,475 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-01-12 03:33:19,475 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-01-12 03:33:19,475 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 03:33:19,475 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 03:33:19,476 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 03:33:19,476 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 03:33:19,476 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 03:33:19,476 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 03:33:19,476 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-01-12 03:33:19,476 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-01-12 03:33:19,476 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-01-12 03:33:19,476 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,476 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,476 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,477 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,477 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,477 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-01-12 03:33:19,477 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-01-12 03:33:19,477 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-01-12 03:33:19,477 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-01-12 03:33:19,477 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 03:33:19,477 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 03:33:19,477 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 03:33:19,477 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 03:33:19,477 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 03:33:19,478 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-01-12 03:33:19,478 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-01-12 03:33:19,478 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-01-12 03:33:19,478 INFO L448 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-01-12 03:33:19,478 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-01-12 03:33:19,478 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,478 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,478 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,478 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,478 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,478 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-01-12 03:33:19,479 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 03:33:19,479 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 03:33:19,479 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 03:33:19,479 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 03:33:19,479 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 03:33:19,480 INFO L444 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse7 (not (= ~a10~0 2))) (.cse10 (not (= ~a19~0 10))) (.cse4 (= ~a19~0 8))) (let ((.cse1 (exists ((v_prenex_2 Int)) (let ((.cse12 (* 9 v_prenex_2))) (let ((.cse11 (div .cse12 10))) (and (<= ~a1~0 (+ (mod .cse11 25) 12)) (<= 0 .cse12) (<= 0 .cse11)))))) (.cse3 (<= (+ ~a1~0 437977) 0)) (.cse0 (<= 1 ~a10~0)) (.cse8 (= ~a12~0 0)) (.cse9 (= ~a4~0 14)) (.cse2 (and .cse10 (not .cse4))) (.cse5 (and .cse7 .cse10)) (.cse6 (= ~a10~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and .cse1 .cse4 (< 0 (+ ~a1~0 13))) (and .cse5 .cse0) (and (<= ~a19~0 8) .cse2) (and (or .cse6 (and .cse7 .cse3 (not (= ~a19~0 9)))) (<= ~a1~0 218)) (and (<= 505232 ~a1~0) .cse8 .cse4 .cse9) (and (< 218 ~a1~0) .cse0 .cse8 .cse9 .cse2) (= ~a10~0 1) (and .cse5 .cse4) (and .cse10 .cse6)))) [2019-01-12 03:33:19,480 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-01-12 03:33:19,480 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-01-12 03:33:19,480 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-01-12 03:33:19,480 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-01-12 03:33:19,480 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,480 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,480 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,480 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,480 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,481 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-01-12 03:33:19,481 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-01-12 03:33:19,481 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-01-12 03:33:19,481 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 03:33:19,481 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 03:33:19,481 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 03:33:19,481 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 03:33:19,481 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 03:33:19,481 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-01-12 03:33:19,481 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-01-12 03:33:19,482 INFO L451 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-01-12 03:33:19,482 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-01-12 03:33:19,482 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-01-12 03:33:19,482 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-01-12 03:33:19,482 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,482 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,482 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,482 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,482 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,482 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 03:33:19,482 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 03:33:19,482 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 03:33:19,483 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 03:33:19,483 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 03:33:19,483 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-01-12 03:33:19,483 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-01-12 03:33:19,483 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-01-12 03:33:19,483 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-01-12 03:33:19,483 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,483 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,483 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,483 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,483 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,484 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-01-12 03:33:19,484 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-01-12 03:33:19,484 INFO L448 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-01-12 03:33:19,484 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-01-12 03:33:19,484 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 03:33:19,484 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 03:33:19,484 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 03:33:19,484 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 03:33:19,484 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 03:33:19,484 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-01-12 03:33:19,485 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-01-12 03:33:19,485 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:33:19,485 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-01-12 03:33:19,485 INFO L444 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse7 (not (= ~a10~0 2))) (.cse10 (not (= ~a19~0 10))) (.cse4 (= ~a19~0 8))) (let ((.cse1 (exists ((v_prenex_2 Int)) (let ((.cse12 (* 9 v_prenex_2))) (let ((.cse11 (div .cse12 10))) (and (<= ~a1~0 (+ (mod .cse11 25) 12)) (<= 0 .cse12) (<= 0 .cse11)))))) (.cse3 (<= (+ ~a1~0 437977) 0)) (.cse0 (<= 1 ~a10~0)) (.cse8 (= ~a12~0 0)) (.cse9 (= ~a4~0 14)) (.cse2 (and .cse10 (not .cse4))) (.cse5 (and .cse7 .cse10)) (.cse6 (= ~a10~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and .cse1 .cse4 (< 0 (+ ~a1~0 13))) (and .cse5 .cse0) (and (<= ~a19~0 8) .cse2) (and (or .cse6 (and .cse7 .cse3 (not (= ~a19~0 9)))) (<= ~a1~0 218)) (and (<= 505232 ~a1~0) .cse8 .cse4 .cse9) (and (< 218 ~a1~0) .cse0 .cse8 .cse9 .cse2) (= ~a10~0 1) (and .cse5 .cse4) (and .cse10 .cse6)))) [2019-01-12 03:33:19,485 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-01-12 03:33:19,485 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,485 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,485 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,485 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,485 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 03:33:19,486 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,486 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,486 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-01-12 03:33:19,486 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-01-12 03:33:19,486 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-01-12 03:33:19,486 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 03:33:19,486 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 03:33:19,486 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 03:33:19,486 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 03:33:19,486 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 03:33:19,486 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 03:33:19,487 INFO L448 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-01-12 03:33:19,487 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-01-12 03:33:19,487 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-01-12 03:33:19,487 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-01-12 03:33:19,487 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,487 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,487 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,487 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,487 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,487 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,487 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-01-12 03:33:19,488 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-01-12 03:33:19,488 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-01-12 03:33:19,488 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:33:19,488 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 03:33:19,488 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 03:33:19,488 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 03:33:19,488 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 03:33:19,488 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 03:33:19,488 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 03:33:19,488 INFO L448 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-01-12 03:33:19,488 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-01-12 03:33:19,489 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-01-12 03:33:19,489 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-01-12 03:33:19,489 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-01-12 03:33:19,489 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-01-12 03:33:19,489 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,489 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,489 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,489 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,489 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,489 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,489 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-01-12 03:33:19,490 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 03:33:19,490 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 03:33:19,490 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 03:33:19,490 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 03:33:19,490 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 03:33:19,490 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:33:19,490 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 03:33:19,490 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-01-12 03:33:19,490 INFO L448 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-01-12 03:33:19,490 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-01-12 03:33:19,490 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-01-12 03:33:19,491 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-01-12 03:33:19,491 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-01-12 03:33:19,491 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,491 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,491 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,491 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,491 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,491 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,491 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-01-12 03:33:19,491 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-01-12 03:33:19,491 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-01-12 03:33:19,492 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 03:33:19,492 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 03:33:19,492 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 03:33:19,492 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 03:33:19,492 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 03:33:19,492 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 03:33:19,492 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-01-12 03:33:19,492 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-01-12 03:33:19,492 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:33:19,492 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2019-01-12 03:33:19,493 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-01-12 03:33:19,493 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,493 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,493 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,493 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,494 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,494 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:33:19,494 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-01-12 03:33:19,494 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-01-12 03:33:19,494 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-01-12 03:33:19,494 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 03:33:19,494 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 03:33:19,494 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 03:33:19,494 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 03:33:19,495 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 03:33:19,495 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 03:33:19,495 INFO L448 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-01-12 03:33:19,495 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-01-12 03:33:19,495 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-01-12 03:33:19,512 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,526 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,527 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:33:19 BoogieIcfgContainer [2019-01-12 03:33:19,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:33:19,563 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:33:19,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:33:19,565 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:33:19,566 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:32:42" (3/4) ... [2019-01-12 03:33:19,570 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:33:19,607 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:33:19,609 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:33:19,645 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 <= a10 && (\exists v_prenex_2 : int :: (a1 <= 9 * v_prenex_2 / 10 % 25 + 12 && 0 <= 9 * v_prenex_2) && 0 <= 9 * v_prenex_2 / 10)) && !(a19 == 10) && !(a19 == 8)) || (a1 + 437977 <= 0 && a19 == 8)) || (((\exists v_prenex_2 : int :: (a1 <= 9 * v_prenex_2 / 10 % 25 + 12 && 0 <= 9 * v_prenex_2) && 0 <= 9 * v_prenex_2 / 10) && a19 == 8) && 0 < a1 + 13)) || ((!(a10 == 2) && !(a19 == 10)) && 1 <= a10)) || (a19 <= 8 && !(a19 == 10) && !(a19 == 8))) || ((a10 == 0 || ((!(a10 == 2) && a1 + 437977 <= 0) && !(a19 == 9))) && a1 <= 218)) || (((505232 <= a1 && a12 == 0) && a19 == 8) && a4 == 14)) || ((((218 < a1 && 1 <= a10) && a12 == 0) && a4 == 14) && !(a19 == 10) && !(a19 == 8))) || a10 == 1) || ((!(a10 == 2) && !(a19 == 10)) && a19 == 8)) || (!(a19 == 10) && a10 == 0) [2019-01-12 03:33:19,650 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 <= a10 && (\exists v_prenex_2 : int :: (a1 <= 9 * v_prenex_2 / 10 % 25 + 12 && 0 <= 9 * v_prenex_2) && 0 <= 9 * v_prenex_2 / 10)) && !(a19 == 10) && !(a19 == 8)) || (a1 + 437977 <= 0 && a19 == 8)) || (((\exists v_prenex_2 : int :: (a1 <= 9 * v_prenex_2 / 10 % 25 + 12 && 0 <= 9 * v_prenex_2) && 0 <= 9 * v_prenex_2 / 10) && a19 == 8) && 0 < a1 + 13)) || ((!(a10 == 2) && !(a19 == 10)) && 1 <= a10)) || (a19 <= 8 && !(a19 == 10) && !(a19 == 8))) || ((a10 == 0 || ((!(a10 == 2) && a1 + 437977 <= 0) && !(a19 == 9))) && a1 <= 218)) || (((505232 <= a1 && a12 == 0) && a19 == 8) && a4 == 14)) || ((((218 < a1 && 1 <= a10) && a12 == 0) && a4 == 14) && !(a19 == 10) && !(a19 == 8))) || a10 == 1) || ((!(a10 == 2) && !(a19 == 10)) && a19 == 8)) || (!(a19 == 10) && a10 == 0) [2019-01-12 03:33:19,810 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:33:19,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:33:19,811 INFO L168 Benchmark]: Toolchain (without parser) took 41047.76 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 477.1 MB). Free memory was 951.4 MB in the beginning and 1.4 GB in the end (delta: -466.5 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2019-01-12 03:33:19,811 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:33:19,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.80 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:33:19,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 203.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-01-12 03:33:19,814 INFO L168 Benchmark]: Boogie Preprocessor took 128.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:33:19,814 INFO L168 Benchmark]: RCFGBuilder took 3071.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.3 MB in the end (delta: 114.3 MB). Peak memory consumption was 114.3 MB. Max. memory is 11.5 GB. [2019-01-12 03:33:19,814 INFO L168 Benchmark]: TraceAbstraction took 36624.22 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 355.5 MB). Free memory was 987.3 MB in the beginning and 1.4 GB in the end (delta: -457.4 MB). Peak memory consumption was 563.4 MB. Max. memory is 11.5 GB. [2019-01-12 03:33:19,816 INFO L168 Benchmark]: Witness Printer took 246.49 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-01-12 03:33:19,819 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 767.80 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 203.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 128.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3071.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.3 MB in the end (delta: 114.3 MB). Peak memory consumption was 114.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36624.22 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 355.5 MB). Free memory was 987.3 MB in the beginning and 1.4 GB in the end (delta: -457.4 MB). Peak memory consumption was 563.4 MB. Max. memory is 11.5 GB. * Witness Printer took 246.49 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: 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 [2019-01-12 03:33:19,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((1 <= a10 && (\exists v_prenex_2 : int :: (a1 <= 9 * v_prenex_2 / 10 % 25 + 12 && 0 <= 9 * v_prenex_2) && 0 <= 9 * v_prenex_2 / 10)) && !(a19 == 10) && !(a19 == 8)) || (a1 + 437977 <= 0 && a19 == 8)) || (((\exists v_prenex_2 : int :: (a1 <= 9 * v_prenex_2 / 10 % 25 + 12 && 0 <= 9 * v_prenex_2) && 0 <= 9 * v_prenex_2 / 10) && a19 == 8) && 0 < a1 + 13)) || ((!(a10 == 2) && !(a19 == 10)) && 1 <= a10)) || (a19 <= 8 && !(a19 == 10) && !(a19 == 8))) || ((a10 == 0 || ((!(a10 == 2) && a1 + 437977 <= 0) && !(a19 == 9))) && a1 <= 218)) || (((505232 <= a1 && a12 == 0) && a19 == 8) && a4 == 14)) || ((((218 < a1 && 1 <= a10) && a12 == 0) && a4 == 14) && !(a19 == 10) && !(a19 == 8))) || a10 == 1) || ((!(a10 == 2) && !(a19 == 10)) && a19 == 8)) || (!(a19 == 10) && a10 == 0) - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 03:33:19,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,840 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,848 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-01-12 03:33:19,849 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((1 <= a10 && (\exists v_prenex_2 : int :: (a1 <= 9 * v_prenex_2 / 10 % 25 + 12 && 0 <= 9 * v_prenex_2) && 0 <= 9 * v_prenex_2 / 10)) && !(a19 == 10) && !(a19 == 8)) || (a1 + 437977 <= 0 && a19 == 8)) || (((\exists v_prenex_2 : int :: (a1 <= 9 * v_prenex_2 / 10 % 25 + 12 && 0 <= 9 * v_prenex_2) && 0 <= 9 * v_prenex_2 / 10) && a19 == 8) && 0 < a1 + 13)) || ((!(a10 == 2) && !(a19 == 10)) && 1 <= a10)) || (a19 <= 8 && !(a19 == 10) && !(a19 == 8))) || ((a10 == 0 || ((!(a10 == 2) && a1 + 437977 <= 0) && !(a19 == 9))) && a1 <= 218)) || (((505232 <= a1 && a12 == 0) && a19 == 8) && a4 == 14)) || ((((218 < a1 && 1 <= a10) && a12 == 0) && a4 == 14) && !(a19 == 10) && !(a19 == 8))) || a10 == 1) || ((!(a10 == 2) && !(a19 == 10)) && a19 == 8)) || (!(a19 == 10) && a10 == 0) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. SAFE Result, 36.4s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 26.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 479 SDtfs, 4370 SDslu, 188 SDs, 0 SdLazy, 11320 SolverSat, 1534 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 22.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 961 GetRequests, 919 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2367occurred in iteration=6, 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 2363 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 80 NumberOfFragments, 379 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3588 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3070 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2440 NumberOfCodeBlocks, 2440 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2428 ConstructedInterpolants, 20 QuantifiedInterpolants, 2273931 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1292 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 1711/1733 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...