java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:55:20,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:55:20,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:55:20,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:55:20,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:55:20,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:55:20,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:55:20,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:55:20,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:55:20,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:55:20,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:55:20,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:55:20,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:55:20,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:55:20,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:55:20,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:55:20,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:55:20,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:55:20,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:55:20,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:55:20,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:55:20,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:55:20,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:55:20,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:55:20,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:55:20,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:55:20,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:55:20,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:55:20,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:55:20,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:55:20,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:55:20,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:55:20,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:55:20,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:55:20,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:55:20,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:55:20,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:55:20,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:55:20,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:55:20,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:55:20,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:55:20,391 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 23:55:20,406 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:55:20,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:55:20,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:55:20,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:55:20,408 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:55:20,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:55:20,409 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:55:20,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:55:20,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:55:20,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:55:20,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:55:20,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:55:20,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:55:20,410 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:55:20,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:55:20,411 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:55:20,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:55:20,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:55:20,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:55:20,411 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:55:20,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:55:20,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:55:20,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:55:20,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:55:20,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:55:20,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:55:20,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:55:20,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:55:20,413 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:55:20,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:55:20,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:55:20,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:55:20,470 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:55:20,470 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:55:20,471 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-10-01 23:55:20,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9302ab9ce/cd6da4d9238844cf9c37df019ec551ea/FLAG36169ef52 [2019-10-01 23:55:21,060 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:55:21,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2019-10-01 23:55:21,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9302ab9ce/cd6da4d9238844cf9c37df019ec551ea/FLAG36169ef52 [2019-10-01 23:55:21,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9302ab9ce/cd6da4d9238844cf9c37df019ec551ea [2019-10-01 23:55:21,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:55:21,471 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:55:21,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:55:21,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:55:21,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:55:21,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:55:21" (1/1) ... [2019-10-01 23:55:21,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258cf6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:21, skipping insertion in model container [2019-10-01 23:55:21,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:55:21" (1/1) ... [2019-10-01 23:55:21,491 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:55:21,513 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:55:21,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:55:21,707 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:55:21,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:55:21,836 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:55:21,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:21 WrapperNode [2019-10-01 23:55:21,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:55:21,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:55:21,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:55:21,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:55:21,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:21" (1/1) ... [2019-10-01 23:55:21,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:21" (1/1) ... [2019-10-01 23:55:21,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:21" (1/1) ... [2019-10-01 23:55:21,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:21" (1/1) ... [2019-10-01 23:55:21,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:21" (1/1) ... [2019-10-01 23:55:21,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:21" (1/1) ... [2019-10-01 23:55:21,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:21" (1/1) ... [2019-10-01 23:55:21,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:55:21,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:55:21,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:55:21,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:55:21,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:21" (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-10-01 23:55:21,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:55:21,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:55:21,935 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:55:21,935 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-01 23:55:21,935 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:55:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-01 23:55:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:55:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:55:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-01 23:55:21,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-01 23:55:21,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-01 23:55:21,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:55:21,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:55:21,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-01 23:55:21,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:55:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:55:21,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:55:22,226 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:55:22,227 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 23:55:22,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:55:22 BoogieIcfgContainer [2019-10-01 23:55:22,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:55:22,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:55:22,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:55:22,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:55:22,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:55:21" (1/3) ... [2019-10-01 23:55:22,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508a4fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:55:22, skipping insertion in model container [2019-10-01 23:55:22,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:55:21" (2/3) ... [2019-10-01 23:55:22,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508a4fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:55:22, skipping insertion in model container [2019-10-01 23:55:22,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:55:22" (3/3) ... [2019-10-01 23:55:22,259 INFO L109 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2019-10-01 23:55:22,282 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:55:22,298 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:55:22,318 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:55:22,348 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:55:22,349 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:55:22,349 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:55:22,349 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:55:22,349 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:55:22,349 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:55:22,350 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:55:22,350 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:55:22,350 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:55:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-01 23:55:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 23:55:22,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:22,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:22,377 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:22,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:22,383 INFO L82 PathProgramCache]: Analyzing trace with hash -850547107, now seen corresponding path program 1 times [2019-10-01 23:55:22,385 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:22,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:22,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:22,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:22,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:55:22,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:55:22,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:55:22,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:55:22,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:55:22,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:55:22,556 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-10-01 23:55:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:22,579 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2019-10-01 23:55:22,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:55:22,581 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-10-01 23:55:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:22,588 INFO L225 Difference]: With dead ends: 56 [2019-10-01 23:55:22,588 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 23:55:22,591 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:55:22,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 23:55:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-01 23:55:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 23:55:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 23:55:22,626 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-10-01 23:55:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:22,626 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 23:55:22,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:55:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 23:55:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 23:55:22,628 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:22,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:22,637 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:22,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:22,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1453375688, now seen corresponding path program 1 times [2019-10-01 23:55:22,638 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:22,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:22,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:22,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:22,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:55:22,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:55:22,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:55:22,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:55:22,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:55:22,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:55:22,723 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-01 23:55:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:22,802 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-10-01 23:55:22,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:55:22,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-01 23:55:22,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:22,807 INFO L225 Difference]: With dead ends: 48 [2019-10-01 23:55:22,807 INFO L226 Difference]: Without dead ends: 36 [2019-10-01 23:55:22,808 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:55:22,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-01 23:55:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2019-10-01 23:55:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 23:55:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-01 23:55:22,820 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2019-10-01 23:55:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:22,821 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-01 23:55:22,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:55:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-01 23:55:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 23:55:22,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:22,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:22,823 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:22,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:22,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1976547036, now seen corresponding path program 1 times [2019-10-01 23:55:22,824 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:22,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:22,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:22,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:22,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:55:22,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:55:22,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:55:22,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:55:22,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:55:22,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:55:22,903 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2019-10-01 23:55:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:22,922 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-10-01 23:55:22,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:55:22,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-01 23:55:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:22,924 INFO L225 Difference]: With dead ends: 47 [2019-10-01 23:55:22,925 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 23:55:22,926 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:55:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 23:55:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-01 23:55:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 23:55:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-10-01 23:55:22,932 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 23 [2019-10-01 23:55:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:22,932 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-10-01 23:55:22,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:55:22,933 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-10-01 23:55:22,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 23:55:22,934 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:22,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:22,934 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:22,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:22,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1583520026, now seen corresponding path program 1 times [2019-10-01 23:55:22,935 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:22,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:22,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:22,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:22,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:55:23,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:55:23,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-01 23:55:23,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 23:55:23,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 23:55:23,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-01 23:55:23,010 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 4 states. [2019-10-01 23:55:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:23,053 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-10-01 23:55:23,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:55:23,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-01 23:55:23,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:23,055 INFO L225 Difference]: With dead ends: 50 [2019-10-01 23:55:23,055 INFO L226 Difference]: Without dead ends: 31 [2019-10-01 23:55:23,056 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:55:23,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-01 23:55:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-01 23:55:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-01 23:55:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-10-01 23:55:23,062 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2019-10-01 23:55:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:23,062 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-10-01 23:55:23,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 23:55:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-10-01 23:55:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 23:55:23,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:23,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:23,065 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:23,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:23,066 INFO L82 PathProgramCache]: Analyzing trace with hash -596099560, now seen corresponding path program 1 times [2019-10-01 23:55:23,066 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:23,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:23,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:23,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:23,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:55:23,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:23,195 INFO L224 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-10-01 23:55:23,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:23,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:55:23,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:55:23,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:23,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-10-01 23:55:23,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 23:55:23,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 23:55:23,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:55:23,360 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 7 states. [2019-10-01 23:55:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:23,449 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-10-01 23:55:23,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:55:23,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-10-01 23:55:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:23,451 INFO L225 Difference]: With dead ends: 52 [2019-10-01 23:55:23,452 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 23:55:23,452 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:55:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 23:55:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-01 23:55:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 23:55:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-10-01 23:55:23,459 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2019-10-01 23:55:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:23,459 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-10-01 23:55:23,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 23:55:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-10-01 23:55:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 23:55:23,461 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:23,461 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-01 23:55:23,461 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:23,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:23,462 INFO L82 PathProgramCache]: Analyzing trace with hash 733518742, now seen corresponding path program 2 times [2019-10-01 23:55:23,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:23,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:23,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:23,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:23,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:55:23,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:23,570 INFO L224 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) [2019-10-01 23:55:23,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:23,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:55:23,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:23,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:55:23,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 23:55:23,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:23,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 23:55:23,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:55:23,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:55:23,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:55:23,689 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 8 states. [2019-10-01 23:55:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:23,811 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2019-10-01 23:55:23,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:55:23,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-10-01 23:55:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:23,813 INFO L225 Difference]: With dead ends: 69 [2019-10-01 23:55:23,813 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 23:55:23,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:55:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 23:55:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2019-10-01 23:55:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 23:55:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-10-01 23:55:23,821 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 27 [2019-10-01 23:55:23,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:23,821 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-10-01 23:55:23,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:55:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-10-01 23:55:23,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 23:55:23,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:23,823 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:23,823 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:23,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:23,823 INFO L82 PathProgramCache]: Analyzing trace with hash 64390350, now seen corresponding path program 3 times [2019-10-01 23:55:23,824 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:23,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:23,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:23,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:23,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 23:55:23,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:23,922 INFO L224 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) [2019-10-01 23:55:23,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:23,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:55:23,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:23,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:55:23,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 23:55:24,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:24,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-01 23:55:24,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:55:24,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:55:24,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:55:24,037 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 10 states. [2019-10-01 23:55:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:24,181 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2019-10-01 23:55:24,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:55:24,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-10-01 23:55:24,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:24,183 INFO L225 Difference]: With dead ends: 82 [2019-10-01 23:55:24,183 INFO L226 Difference]: Without dead ends: 60 [2019-10-01 23:55:24,184 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:55:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-01 23:55:24,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-10-01 23:55:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-01 23:55:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-10-01 23:55:24,191 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 32 [2019-10-01 23:55:24,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:24,191 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-10-01 23:55:24,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:55:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-10-01 23:55:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-01 23:55:24,193 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:24,193 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:24,193 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:24,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:24,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1628887214, now seen corresponding path program 4 times [2019-10-01 23:55:24,194 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:24,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:24,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:24,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:24,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 23:55:24,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:24,345 INFO L224 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-10-01 23:55:24,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:55:24,420 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:55:24,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:24,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:55:24,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 23:55:24,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:24,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-10-01 23:55:24,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:55:24,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:55:24,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:55:24,529 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 13 states. [2019-10-01 23:55:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:24,600 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-10-01 23:55:24,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:55:24,601 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-10-01 23:55:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:24,602 INFO L225 Difference]: With dead ends: 70 [2019-10-01 23:55:24,603 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 23:55:24,603 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:55:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 23:55:24,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-01 23:55:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-01 23:55:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-10-01 23:55:24,610 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 37 [2019-10-01 23:55:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:24,611 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-10-01 23:55:24,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:55:24,611 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-10-01 23:55:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-01 23:55:24,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:24,612 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:24,613 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:24,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:24,613 INFO L82 PathProgramCache]: Analyzing trace with hash 201537488, now seen corresponding path program 5 times [2019-10-01 23:55:24,613 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:24,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:24,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:24,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:24,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 23:55:24,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:24,780 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:24,813 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:55:24,875 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 23:55:24,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:24,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:55:24,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-01 23:55:24,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:24,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-10-01 23:55:24,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:55:24,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:55:24,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:55:24,940 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 13 states. [2019-10-01 23:55:25,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:25,099 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2019-10-01 23:55:25,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:55:25,099 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-10-01 23:55:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:25,101 INFO L225 Difference]: With dead ends: 97 [2019-10-01 23:55:25,101 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 23:55:25,102 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:55:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 23:55:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-10-01 23:55:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 23:55:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-10-01 23:55:25,109 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 39 [2019-10-01 23:55:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:25,109 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-10-01 23:55:25,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:55:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-10-01 23:55:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 23:55:25,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:25,111 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:25,111 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:25,111 INFO L82 PathProgramCache]: Analyzing trace with hash 596570964, now seen corresponding path program 6 times [2019-10-01 23:55:25,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:25,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:25,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:25,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-01 23:55:25,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:25,239 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:25,279 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:55:25,318 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 23:55:25,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:25,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:55:25,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:25,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:55:25,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:25,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:25,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-01 23:55:25,504 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:25,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:25,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:55:25,510 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-01 23:55:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-01 23:55:25,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:25,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-10-01 23:55:25,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:55:25,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:55:25,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:55:25,567 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 18 states. [2019-10-01 23:55:25,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:25,854 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-10-01 23:55:25,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:55:25,855 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2019-10-01 23:55:25,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:25,856 INFO L225 Difference]: With dead ends: 89 [2019-10-01 23:55:25,856 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 23:55:25,857 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:55:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 23:55:25,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-10-01 23:55:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-01 23:55:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-10-01 23:55:25,864 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 44 [2019-10-01 23:55:25,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:25,865 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-10-01 23:55:25,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:55:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-10-01 23:55:25,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-01 23:55:25,866 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:25,866 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:55:25,867 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:25,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:25,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1525406971, now seen corresponding path program 1 times [2019-10-01 23:55:25,867 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:25,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:25,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:25,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:25,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-01 23:55:25,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:55:25,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:55:25,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:55:25,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:55:25,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:55:25,919 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 3 states. [2019-10-01 23:55:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:25,932 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2019-10-01 23:55:25,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:55:25,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-01 23:55:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:25,936 INFO L225 Difference]: With dead ends: 69 [2019-10-01 23:55:25,936 INFO L226 Difference]: Without dead ends: 58 [2019-10-01 23:55:25,937 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:55:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-01 23:55:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-01 23:55:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-01 23:55:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-10-01 23:55:25,960 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 49 [2019-10-01 23:55:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:25,964 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-10-01 23:55:25,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:55:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-10-01 23:55:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 23:55:25,969 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:25,969 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 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] [2019-10-01 23:55:25,970 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:25,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:25,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1923347340, now seen corresponding path program 1 times [2019-10-01 23:55:25,972 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:25,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:25,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:25,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:25,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-01 23:55:26,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:26,151 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:26,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:26,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:55:26,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-01 23:55:26,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:26,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-10-01 23:55:26,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:55:26,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:55:26,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=208, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:55:26,374 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 19 states. [2019-10-01 23:55:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:26,465 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2019-10-01 23:55:26,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:55:26,465 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-10-01 23:55:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:26,466 INFO L225 Difference]: With dead ends: 96 [2019-10-01 23:55:26,466 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 23:55:26,468 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:55:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 23:55:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-01 23:55:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-01 23:55:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-01 23:55:26,475 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2019-10-01 23:55:26,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:26,475 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-01 23:55:26,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:55:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-01 23:55:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-01 23:55:26,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:26,476 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 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] [2019-10-01 23:55:26,477 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:26,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:26,477 INFO L82 PathProgramCache]: Analyzing trace with hash -2014430862, now seen corresponding path program 2 times [2019-10-01 23:55:26,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:26,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:26,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:26,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:55:26,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-01 23:55:26,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:26,596 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:26,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:55:26,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:55:26,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:26,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:55:26,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-01 23:55:26,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:26,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-10-01 23:55:26,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:55:26,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:55:26,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=256, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:55:26,815 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 21 states. [2019-10-01 23:55:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:26,901 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2019-10-01 23:55:26,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 23:55:26,901 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-10-01 23:55:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:26,902 INFO L225 Difference]: With dead ends: 98 [2019-10-01 23:55:26,902 INFO L226 Difference]: Without dead ends: 63 [2019-10-01 23:55:26,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=293, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:55:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-01 23:55:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-10-01 23:55:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-01 23:55:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-01 23:55:26,909 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 57 [2019-10-01 23:55:26,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:26,910 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-01 23:55:26,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:55:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-01 23:55:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-01 23:55:26,911 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:55:26,911 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 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] [2019-10-01 23:55:26,911 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:55:26,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:55:26,911 INFO L82 PathProgramCache]: Analyzing trace with hash 648617712, now seen corresponding path program 3 times [2019-10-01 23:55:26,912 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:55:26,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:55:26,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:26,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:55:26,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:55:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:55:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 2 proven. 81 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-01 23:55:27,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:55:27,042 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:55:27,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:55:27,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:55:27,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:55:27,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:55:27,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:55:27,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-01 23:55:27,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:55:27,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:27,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:55:27,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-10-01 23:55:27,319 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:27,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2019-10-01 23:55:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:55:27,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-01 23:55:27,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:55:27,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-01 23:55:27,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:55:27,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2019-10-01 23:55:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-01 23:55:27,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:55:27,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2019-10-01 23:55:27,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:55:27,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:55:27,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:55:27,445 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 21 states. [2019-10-01 23:55:28,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:55:28,581 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-10-01 23:55:28,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:55:28,585 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2019-10-01 23:55:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:55:28,585 INFO L225 Difference]: With dead ends: 81 [2019-10-01 23:55:28,585 INFO L226 Difference]: Without dead ends: 0 [2019-10-01 23:55:28,587 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=1760, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 23:55:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-01 23:55:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-01 23:55:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-01 23:55:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-01 23:55:28,588 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2019-10-01 23:55:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:55:28,589 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-01 23:55:28,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:55:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-01 23:55:28,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-01 23:55:28,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-01 23:55:28,782 INFO L446 ceAbstractionStarter]: At program point initENTRY(lines 9 16) the Hoare annotation is: true [2019-10-01 23:55:28,783 INFO L443 ceAbstractionStarter]: For program point initEXIT(lines 9 16) no Hoare annotation was computed. [2019-10-01 23:55:28,783 INFO L443 ceAbstractionStarter]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2019-10-01 23:55:28,783 INFO L439 ceAbstractionStarter]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= init_~a.base |init_#in~a.base|)) (.cse1 (= |init_#in~size| init_~size)) (.cse2 (= init_~a.offset |init_#in~a.offset|))) (or (and .cse0 (= init_~i~0 0) .cse1 .cse2) (and (exists ((v_init_~i~0_27 Int)) (and (< v_init_~i~0_27 init_~size) (<= init_~i~0 (+ v_init_~i~0_27 1)) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* 4 v_init_~i~0_27))))))) .cse0 .cse1 .cse2))) [2019-10-01 23:55:28,783 INFO L443 ceAbstractionStarter]: For program point L12-4(lines 9 16) no Hoare annotation was computed. [2019-10-01 23:55:28,783 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-01 23:55:28,784 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-01 23:55:28,784 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-01 23:55:28,784 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-01 23:55:28,784 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-01 23:55:28,784 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-01 23:55:28,784 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-01 23:55:28,784 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 34) no Hoare annotation was computed. [2019-10-01 23:55:28,784 INFO L443 ceAbstractionStarter]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2019-10-01 23:55:28,785 INFO L439 ceAbstractionStarter]: At program point L31-3(lines 31 35) the Hoare annotation is: (= main_~flag~0 1) [2019-10-01 23:55:28,785 INFO L443 ceAbstractionStarter]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2019-10-01 23:55:28,785 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 17 37) no Hoare annotation was computed. [2019-10-01 23:55:28,785 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (= main_~flag~0 0) (= |main_~#a~0.offset| 0)) [2019-10-01 23:55:28,785 INFO L443 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-10-01 23:55:28,785 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 17 37) no Hoare annotation was computed. [2019-10-01 23:55:28,785 INFO L439 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: false [2019-10-01 23:55:28,785 INFO L443 ceAbstractionStarter]: For program point L34-1(line 34) no Hoare annotation was computed. [2019-10-01 23:55:28,785 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 17 37) the Hoare annotation is: true [2019-10-01 23:55:28,786 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-10-01 23:55:28,786 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2019-10-01 23:55:28,786 INFO L439 ceAbstractionStarter]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse0 (= main_~flag~0 0)) (.cse1 (exists ((v_init_~i~0_27 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_27) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_27 100000) (<= 99999 v_init_~i~0_27)))) (.cse2 (= |main_~#a~0.offset| 0))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~i~1 99999) .cse0 (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|) 0) .cse1 .cse2) (and .cse0 (= main_~i~1 0) .cse1 .cse2) (= main_~flag~0 1))) [2019-10-01 23:55:28,786 INFO L443 ceAbstractionStarter]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2019-10-01 23:55:28,786 INFO L443 ceAbstractionStarter]: For program point L4-3(line 4) no Hoare annotation was computed. [2019-10-01 23:55:28,786 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2019-10-01 23:55:28,786 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2019-10-01 23:55:28,787 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 4) no Hoare annotation was computed. [2019-10-01 23:55:28,787 INFO L443 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2019-10-01 23:55:28,787 INFO L443 ceAbstractionStarter]: For program point L4-1(line 4) no Hoare annotation was computed. [2019-10-01 23:55:28,800 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-01 23:55:28,801 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,802 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,803 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,804 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,805 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,806 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-01 23:55:28,806 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,807 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,809 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,810 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,815 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,815 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 11:55:28 BoogieIcfgContainer [2019-10-01 23:55:28,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-01 23:55:28,820 INFO L168 Benchmark]: Toolchain (without parser) took 7349.34 ms. Allocated memory was 137.4 MB in the beginning and 340.3 MB in the end (delta: 202.9 MB). Free memory was 84.8 MB in the beginning and 105.1 MB in the end (delta: -20.3 MB). Peak memory consumption was 182.6 MB. Max. memory is 7.1 GB. [2019-10-01 23:55:28,821 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 103.4 MB in the beginning and 103.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-01 23:55:28,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.67 ms. Allocated memory was 137.4 MB in the beginning and 197.7 MB in the end (delta: 60.3 MB). Free memory was 84.6 MB in the beginning and 175.3 MB in the end (delta: -90.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-10-01 23:55:28,822 INFO L168 Benchmark]: Boogie Preprocessor took 37.87 ms. Allocated memory is still 197.7 MB. Free memory was 175.3 MB in the beginning and 173.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-01 23:55:28,823 INFO L168 Benchmark]: RCFGBuilder took 353.69 ms. Allocated memory is still 197.7 MB. Free memory was 173.0 MB in the beginning and 156.5 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2019-10-01 23:55:28,824 INFO L168 Benchmark]: TraceAbstraction took 6580.66 ms. Allocated memory was 197.7 MB in the beginning and 340.3 MB in the end (delta: 142.6 MB). Free memory was 155.9 MB in the beginning and 105.1 MB in the end (delta: 50.8 MB). Peak memory consumption was 193.4 MB. Max. memory is 7.1 GB. [2019-10-01 23:55:28,828 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 103.4 MB in the beginning and 103.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 365.67 ms. Allocated memory was 137.4 MB in the beginning and 197.7 MB in the end (delta: 60.3 MB). Free memory was 84.6 MB in the beginning and 175.3 MB in the end (delta: -90.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.87 ms. Allocated memory is still 197.7 MB. Free memory was 175.3 MB in the beginning and 173.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 353.69 ms. Allocated memory is still 197.7 MB. Free memory was 173.0 MB in the beginning and 156.5 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6580.66 ms. Allocated memory was 197.7 MB in the beginning and 340.3 MB in the end (delta: 142.6 MB). Free memory was 155.9 MB in the beginning and 105.1 MB in the end (delta: 50.8 MB). Peak memory consumption was 193.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 31]: Loop Invariant Derived loop invariant: flag == 1 - InvariantResult [Line: 24]: Loop Invariant [2019-10-01 23:55:28,842 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-01 23:55:28,842 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,843 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,844 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,845 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,845 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,845 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,846 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,846 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-01 23:55:28,847 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,847 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,848 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,849 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,849 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((0 == #memory_$Pointer$[a][a] && i <= 99999) && flag == 0) && #memory_$Pointer$[a][a] == 0) && (\exists v_init_~i~0_27 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_27 + a] == 0) && v_init_~i~0_27 < 100000) && 99999 <= v_init_~i~0_27)) && a == 0) || (((flag == 0 && i == 0) && (\exists v_init_~i~0_27 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_27 + a] == 0) && v_init_~i~0_27 < 100000) && 99999 <= v_init_~i~0_27)) && a == 0)) || flag == 1 - InvariantResult [Line: 12]: Loop Invariant [2019-10-01 23:55:28,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,851 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,851 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,852 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-01 23:55:28,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,853 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-01 23:55:28,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_27,QUANTIFIED] [2019-10-01 23:55:28,854 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((a == a && i == 0) && \old(size) == size) && a == a) || ((((\exists v_init_~i~0_27 : int :: (v_init_~i~0_27 < size && i <= v_init_~i~0_27 + 1) && !(0 == #memory_$Pointer$[a][a + 4 * v_init_~i~0_27])) && a == a) && \old(size) == size) && a == a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. SAFE Result, 6.4s OverallTime, 14 OverallIterations, 9 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 376 SDtfs, 206 SDslu, 1763 SDs, 0 SdLazy, 759 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 501 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=13, 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 69 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 27 PreInvPairs, 44 NumberOfFragments, 141 HoareAnnotationTreeSize, 27 FomulaSimplifications, 540 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 885 NumberOfCodeBlocks, 853 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 862 ConstructedInterpolants, 14 QuantifiedInterpolants, 121513 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1519 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 446/913 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...