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/ldv-regression/test25-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:35:46,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:35:46,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:35:46,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:35:46,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:35:46,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:35:46,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:35:46,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:35:46,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:35:46,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:35:46,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:35:46,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:35:46,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:35:46,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:35:46,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:35:46,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:35:46,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:35:46,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:35:46,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:35:46,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:35:46,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:35:46,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:35:46,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:35:46,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:35:46,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:35:46,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:35:46,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:35:46,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:35:46,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:35:46,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:35:46,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:35:46,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:35:46,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:35:46,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:35:46,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:35:46,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:35:46,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:35:46,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:35:46,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:35:46,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:35:46,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:35:46,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 01:35:46,401 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:35:46,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:35:46,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:35:46,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:35:46,403 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:35:46,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:35:46,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:35:46,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:35:46,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:35:46,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:35:46,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:35:46,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:35:46,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:35:46,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:35:46,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:35:46,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:35:46,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:35:46,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:35:46,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:35:46,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:35:46,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:35:46,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:35:46,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:35:46,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:35:46,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:35:46,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:35:46,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:35:46,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:35:46,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:35:46,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:35:46,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:35:46,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:35:46,469 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:35:46,469 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:35:46,470 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test25-1.c [2019-09-08 01:35:46,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c92f8a17/9a19c9322a8e4d83bb13f46e757b6710/FLAG7060f8cee [2019-09-08 01:35:46,963 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:35:46,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25-1.c [2019-09-08 01:35:46,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c92f8a17/9a19c9322a8e4d83bb13f46e757b6710/FLAG7060f8cee [2019-09-08 01:35:47,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c92f8a17/9a19c9322a8e4d83bb13f46e757b6710 [2019-09-08 01:35:47,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:35:47,379 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:35:47,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:35:47,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:35:47,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:35:47,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:35:47" (1/1) ... [2019-09-08 01:35:47,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3422a81f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:47, skipping insertion in model container [2019-09-08 01:35:47,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:35:47" (1/1) ... [2019-09-08 01:35:47,395 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:35:47,415 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:35:47,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:35:47,587 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:35:47,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:35:47,712 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:35:47,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:47 WrapperNode [2019-09-08 01:35:47,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:35:47,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:35:47,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:35:47,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:35:47,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:47" (1/1) ... [2019-09-08 01:35:47,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:47" (1/1) ... [2019-09-08 01:35:47,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:47" (1/1) ... [2019-09-08 01:35:47,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:47" (1/1) ... [2019-09-08 01:35:47,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:47" (1/1) ... [2019-09-08 01:35:47,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:47" (1/1) ... [2019-09-08 01:35:47,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:47" (1/1) ... [2019-09-08 01:35:47,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:35:47,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:35:47,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:35:47,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:35:47,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:35:47,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:35:47,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:35:47,815 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 01:35:47,815 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:35:47,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:35:47,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:35:47,816 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 01:35:47,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 01:35:47,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 01:35:47,816 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:35:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 01:35:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 01:35:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 01:35:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 01:35:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:35:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:35:48,162 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:35:48,163 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 01:35:48,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:35:48 BoogieIcfgContainer [2019-09-08 01:35:48,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:35:48,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:35:48,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:35:48,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:35:48,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:35:47" (1/3) ... [2019-09-08 01:35:48,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42bdf176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:35:48, skipping insertion in model container [2019-09-08 01:35:48,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:47" (2/3) ... [2019-09-08 01:35:48,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42bdf176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:35:48, skipping insertion in model container [2019-09-08 01:35:48,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:35:48" (3/3) ... [2019-09-08 01:35:48,173 INFO L109 eAbstractionObserver]: Analyzing ICFG test25-1.c [2019-09-08 01:35:48,182 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:35:48,190 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:35:48,206 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:35:48,236 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:35:48,237 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:35:48,237 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:35:48,237 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:35:48,237 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:35:48,237 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:35:48,237 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:35:48,237 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:35:48,238 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:35:48,253 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-08 01:35:48,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 01:35:48,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:48,259 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:48,261 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2019-09-08 01:35:48,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:48,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:48,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:48,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:48,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:48,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:35:48,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 01:35:48,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:35:48,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:35:48,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:35:48,428 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-08 01:35:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:48,446 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-09-08 01:35:48,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:35:48,447 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-09-08 01:35:48,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:48,457 INFO L225 Difference]: With dead ends: 42 [2019-09-08 01:35:48,458 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 01:35:48,461 INFO L628 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-09-08 01:35:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 01:35:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-08 01:35:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-08 01:35:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-08 01:35:48,499 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-09-08 01:35:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:48,499 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-08 01:35:48,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:35:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-08 01:35:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 01:35:48,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:48,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:48,501 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:48,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2019-09-08 01:35:48,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:48,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:48,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:48,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:48,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:48,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:35:48,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:35:48,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:35:48,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:35:48,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:35:48,581 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2019-09-08 01:35:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:48,610 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-08 01:35:48,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:35:48,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-08 01:35:48,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:48,612 INFO L225 Difference]: With dead ends: 34 [2019-09-08 01:35:48,613 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 01:35:48,614 INFO L628 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-09-08 01:35:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 01:35:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-08 01:35:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 01:35:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-08 01:35:48,620 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-09-08 01:35:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:48,621 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-08 01:35:48,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:35:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-08 01:35:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 01:35:48,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:48,622 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:48,623 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:48,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:48,623 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2019-09-08 01:35:48,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:48,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:48,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:48,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:48,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:48,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:48,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:48,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:48,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 01:35:48,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:48,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:48,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 01:35:48,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:35:48,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:35:48,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:35:48,837 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2019-09-08 01:35:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:48,889 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-08 01:35:48,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:35:48,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-08 01:35:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:48,891 INFO L225 Difference]: With dead ends: 36 [2019-09-08 01:35:48,891 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 01:35:48,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:35:48,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 01:35:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-08 01:35:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 01:35:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-08 01:35:48,897 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-09-08 01:35:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:48,898 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-08 01:35:48,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:35:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-08 01:35:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 01:35:48,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:48,899 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:48,899 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:48,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:48,900 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2019-09-08 01:35:48,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:48,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:48,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:48,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:48,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:48,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:48,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:49,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:35:49,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 01:35:49,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:49,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:35:49,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:49,152 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:35:49,163 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:35:49,164 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 28 treesize of output 12 [2019-09-08 01:35:49,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:35:49,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:35:49,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:35:49,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-09-08 01:35:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 01:35:49,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 01:35:49,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 01:35:49,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:35:49,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:35:49,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:35:49,206 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 8 states. [2019-09-08 01:35:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:49,369 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-09-08 01:35:49,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 01:35:49,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-09-08 01:35:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:49,371 INFO L225 Difference]: With dead ends: 40 [2019-09-08 01:35:49,371 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 01:35:49,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:35:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 01:35:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-08 01:35:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 01:35:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-08 01:35:49,378 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2019-09-08 01:35:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:49,378 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-08 01:35:49,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:35:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-08 01:35:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 01:35:49,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:49,379 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:49,380 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash -50594516, now seen corresponding path program 1 times [2019-09-08 01:35:49,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:49,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:49,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:49,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:49,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:35:49,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:49,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:49,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:49,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:35:49,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:35:49,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:49,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 01:35:49,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:35:49,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:35:49,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:35:49,585 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2019-09-08 01:35:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:49,633 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-09-08 01:35:49,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:35:49,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-08 01:35:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:49,637 INFO L225 Difference]: With dead ends: 44 [2019-09-08 01:35:49,637 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 01:35:49,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:35:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 01:35:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-08 01:35:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 01:35:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-08 01:35:49,647 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-09-08 01:35:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:49,649 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-08 01:35:49,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:35:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-08 01:35:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:35:49,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:49,652 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:49,653 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:49,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:49,653 INFO L82 PathProgramCache]: Analyzing trace with hash 619997966, now seen corresponding path program 2 times [2019-09-08 01:35:49,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:49,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:49,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:49,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:49,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:35:49,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:49,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:35:49,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:49,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:35:49,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:49,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:35:49,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:35:49,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:49,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 01:35:49,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:35:49,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:35:49,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:35:49,861 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 8 states. [2019-09-08 01:35:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:49,921 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-09-08 01:35:49,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:35:49,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-09-08 01:35:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:49,923 INFO L225 Difference]: With dead ends: 46 [2019-09-08 01:35:49,923 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 01:35:49,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:35:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 01:35:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-08 01:35:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 01:35:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-08 01:35:49,933 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-09-08 01:35:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:49,935 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-08 01:35:49,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:35:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-08 01:35:49,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 01:35:49,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:49,937 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:49,937 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:49,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:49,937 INFO L82 PathProgramCache]: Analyzing trace with hash 814278768, now seen corresponding path program 3 times [2019-09-08 01:35:49,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:49,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:49,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:49,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:49,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:35:50,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:50,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:50,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:35:50,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-08 01:35:50,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:50,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 01:35:50,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:50,208 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:35:50,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:35:50,210 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 28 treesize of output 12 [2019-09-08 01:35:50,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:35:50,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:35:50,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:35:50,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-09-08 01:35:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 01:35:50,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:50,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-09-08 01:35:50,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 01:35:50,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 01:35:50,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:35:50,241 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2019-09-08 01:35:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:50,445 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-09-08 01:35:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 01:35:50,446 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-09-08 01:35:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:50,447 INFO L225 Difference]: With dead ends: 50 [2019-09-08 01:35:50,447 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 01:35:50,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:35:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 01:35:50,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-08 01:35:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 01:35:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-08 01:35:50,454 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2019-09-08 01:35:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:50,455 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-08 01:35:50,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 01:35:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-08 01:35:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 01:35:50,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:50,456 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:50,457 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:50,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:50,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1119042125, now seen corresponding path program 4 times [2019-09-08 01:35:50,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:50,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:50,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:50,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:50,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 01:35:50,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:50,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:50,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:35:50,611 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:35:50,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:50,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 01:35:50,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:52,915 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:35:52,917 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:35:52,918 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 28 treesize of output 12 [2019-09-08 01:35:52,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:35:52,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:35:52,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:35:52,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-09-08 01:35:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:35:52,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:52,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-09-08 01:35:52,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 01:35:52,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 01:35:52,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=133, Unknown=1, NotChecked=0, Total=182 [2019-09-08 01:35:52,952 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 14 states. [2019-09-08 01:35:54,866 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-09-08 01:35:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:55,007 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-09-08 01:35:55,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 01:35:55,010 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-09-08 01:35:55,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:55,011 INFO L225 Difference]: With dead ends: 56 [2019-09-08 01:35:55,011 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 01:35:55,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=72, Invalid=233, Unknown=1, NotChecked=0, Total=306 [2019-09-08 01:35:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 01:35:55,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-08 01:35:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 01:35:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-08 01:35:55,020 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2019-09-08 01:35:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:55,020 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-08 01:35:55,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 01:35:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-08 01:35:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 01:35:55,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:55,022 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:55,022 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:55,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:55,022 INFO L82 PathProgramCache]: Analyzing trace with hash -820541462, now seen corresponding path program 5 times [2019-09-08 01:35:55,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:55,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:55,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:55,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:55,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 01:35:55,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:55,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:55,155 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:35:58,084 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-08 01:35:58,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:58,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:35:58,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 01:35:58,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:58,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-08 01:35:58,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 01:35:58,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 01:35:58,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:35:58,122 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2019-09-08 01:35:58,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:58,200 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-09-08 01:35:58,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:35:58,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-09-08 01:35:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:58,202 INFO L225 Difference]: With dead ends: 60 [2019-09-08 01:35:58,202 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 01:35:58,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:35:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 01:35:58,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-08 01:35:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-08 01:35:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-09-08 01:35:58,211 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-09-08 01:35:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:58,211 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-09-08 01:35:58,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 01:35:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-09-08 01:35:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:35:58,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:58,213 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:58,213 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:58,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:58,213 INFO L82 PathProgramCache]: Analyzing trace with hash 478163660, now seen corresponding path program 6 times [2019-09-08 01:35:58,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:58,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:58,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:58,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:58,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 01:35:58,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:58,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:35:58,399 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:59,738 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 01:35:59,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:59,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 01:35:59,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:59,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2019-09-08 01:35:59,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:35:59,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:35:59,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:35:59,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:12 [2019-09-08 01:36:00,023 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:36:00,025 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:00,025 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 28 treesize of output 12 [2019-09-08 01:36:00,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:00,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:00,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:00,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-09-08 01:36:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:36:00,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:36:00,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-09-08 01:36:00,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 01:36:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 01:36:00,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-09-08 01:36:00,060 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 17 states. [2019-09-08 01:36:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:02,616 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-09-08 01:36:02,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 01:36:02,621 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2019-09-08 01:36:02,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:02,622 INFO L225 Difference]: With dead ends: 64 [2019-09-08 01:36:02,622 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 01:36:02,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:36:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 01:36:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-08 01:36:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-08 01:36:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-08 01:36:02,628 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2019-09-08 01:36:02,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:02,629 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-08 01:36:02,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 01:36:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-08 01:36:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 01:36:02,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:02,630 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:02,630 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:02,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:02,631 INFO L82 PathProgramCache]: Analyzing trace with hash -956118231, now seen corresponding path program 7 times [2019-09-08 01:36:02,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:02,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:02,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:02,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:36:02,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 01:36:02,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:02,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:02,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:36:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:02,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 01:36:02,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 01:36:02,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:36:02,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-08 01:36:02,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 01:36:02,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 01:36:02,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:36:02,839 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 13 states. [2019-09-08 01:36:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:02,903 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2019-09-08 01:36:02,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 01:36:02,903 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-09-08 01:36:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:02,904 INFO L225 Difference]: With dead ends: 67 [2019-09-08 01:36:02,904 INFO L226 Difference]: Without dead ends: 47 [2019-09-08 01:36:02,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:36:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-08 01:36:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-08 01:36:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-08 01:36:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-08 01:36:02,911 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-09-08 01:36:02,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:02,911 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-08 01:36:02,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 01:36:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-08 01:36:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 01:36:02,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:02,912 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:02,913 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:02,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:02,913 INFO L82 PathProgramCache]: Analyzing trace with hash -50051957, now seen corresponding path program 8 times [2019-09-08 01:36:02,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:02,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:02,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:36:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:03,667 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 01:36:03,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:03,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:36:03,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:03,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:36:03,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:36:03,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 01:36:03,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:04,208 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:36:04,210 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:04,210 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 25 treesize of output 12 [2019-09-08 01:36:04,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:04,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:04,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:04,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:9 [2019-09-08 01:36:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:36:04,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:36:04,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19] total 28 [2019-09-08 01:36:04,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 01:36:04,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 01:36:04,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2019-09-08 01:36:04,249 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 28 states. [2019-09-08 01:36:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:05,523 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-09-08 01:36:05,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 01:36:05,523 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2019-09-08 01:36:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:05,525 INFO L225 Difference]: With dead ends: 65 [2019-09-08 01:36:05,525 INFO L226 Difference]: Without dead ends: 57 [2019-09-08 01:36:05,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=419, Invalid=1651, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 01:36:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-08 01:36:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-09-08 01:36:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-08 01:36:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-08 01:36:05,534 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2019-09-08 01:36:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:05,534 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-08 01:36:05,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 01:36:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-08 01:36:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 01:36:05,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:05,535 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:05,536 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:05,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:05,536 INFO L82 PathProgramCache]: Analyzing trace with hash 714026674, now seen corresponding path program 9 times [2019-09-08 01:36:05,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:05,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:05,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:05,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:36:05,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 01:36:06,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:06,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:06,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:36:32,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 01:36:32,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:36:32,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 01:36:32,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:32,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2019-09-08 01:36:32,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:32,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:32,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:32,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2019-09-08 01:36:32,882 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:36:32,883 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:32,884 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 25 treesize of output 12 [2019-09-08 01:36:32,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:32,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:32,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:32,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:5 [2019-09-08 01:36:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-08 01:36:32,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:36:32,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 32 [2019-09-08 01:36:32,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 01:36:32,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 01:36:32,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=766, Unknown=0, NotChecked=0, Total=992 [2019-09-08 01:36:32,915 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 32 states. [2019-09-08 01:36:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:33,747 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-09-08 01:36:33,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 01:36:33,749 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2019-09-08 01:36:33,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:33,750 INFO L225 Difference]: With dead ends: 67 [2019-09-08 01:36:33,751 INFO L226 Difference]: Without dead ends: 59 [2019-09-08 01:36:33,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=662, Invalid=1990, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 01:36:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-08 01:36:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-08 01:36:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-08 01:36:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-09-08 01:36:33,765 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-09-08 01:36:33,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:33,767 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-09-08 01:36:33,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 01:36:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-09-08 01:36:33,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 01:36:33,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:33,769 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:33,769 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:33,770 INFO L82 PathProgramCache]: Analyzing trace with hash -875693139, now seen corresponding path program 10 times [2019-09-08 01:36:33,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:33,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:33,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:33,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:36:33,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:36:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:36:33,959 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-08 01:36:34,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 01:36:34 BoogieIcfgContainer [2019-09-08 01:36:34,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 01:36:34,052 INFO L168 Benchmark]: Toolchain (without parser) took 46673.10 ms. Allocated memory was 135.3 MB in the beginning and 325.6 MB in the end (delta: 190.3 MB). Free memory was 90.7 MB in the beginning and 267.3 MB in the end (delta: -176.6 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:34,053 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 109.5 MB in the beginning and 109.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 01:36:34,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.38 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 90.5 MB in the beginning and 175.7 MB in the end (delta: -85.1 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:34,054 INFO L168 Benchmark]: Boogie Preprocessor took 36.95 ms. Allocated memory is still 198.7 MB. Free memory was 175.7 MB in the beginning and 173.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:34,055 INFO L168 Benchmark]: RCFGBuilder took 413.88 ms. Allocated memory is still 198.7 MB. Free memory was 173.4 MB in the beginning and 156.5 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:34,056 INFO L168 Benchmark]: TraceAbstraction took 45885.27 ms. Allocated memory was 198.7 MB in the beginning and 325.6 MB in the end (delta: 126.9 MB). Free memory was 156.5 MB in the beginning and 267.3 MB in the end (delta: -110.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:34,059 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.22 ms. Allocated memory is still 135.3 MB. Free memory was 109.5 MB in the beginning and 109.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 332.38 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 90.5 MB in the beginning and 175.7 MB in the end (delta: -85.1 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.95 ms. Allocated memory is still 198.7 MB. Free memory was 175.7 MB in the beginning and 173.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 413.88 ms. Allocated memory is still 198.7 MB. Free memory was 173.4 MB in the beginning and 156.5 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45885.27 ms. Allocated memory was 198.7 MB in the beginning and 325.6 MB in the end (delta: 126.9 MB). Free memory was 156.5 MB in the beginning and 267.3 MB in the end (delta: -110.8 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 45]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L19] struct cont cont; [L20] struct dummy array[10]; [L21] int i, *pa; [L22] i = __VERIFIER_nondet_int() [L24] int j = 0; VAL [array={-1:0}, cont={1:0}, i=1, j=0] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={-1:0}, cont={1:0}, i=1, j=1] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={-1:0}, cont={1:0}, i=1, j=2] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={-1:0}, cont={1:0}, i=1, j=3] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={-1:0}, cont={1:0}, i=1, j=4] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={-1:0}, cont={1:0}, i=1, j=5] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={-1:0}, cont={1:0}, i=1, j=6] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={-1:0}, cont={1:0}, i=1, j=7] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={-1:0}, cont={1:0}, i=1, j=8] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={-1:0}, cont={1:0}, i=1, j=9] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={-1:0}, cont={1:0}, i=1, j=10] [L24] COND FALSE !(j < 10) VAL [array={-1:0}, cont={1:0}, i=1, j=10] [L29] COND TRUE i >= 0 && i < 9 [L30] cont.array = &array[i] [L31] EXPR cont.array [L31] pa = &cont.array[0].b [L32] EXPR cont.array [L32] EXPR cont.array[0].b VAL [array={-1:0}, cont={1:0}, cont.array={-1:8}, cont.array[0].b=1, i=1, j=10, pa={-1:12}] [L32] COND TRUE cont.array[0].b > 0 [L33] EXPR array[i].b [L33] i = array[i].b - 10 [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={-1:0}, cont={1:0}, i=-9, j=10, pa={-1:12}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={-1:0}, cont={1:0}, i=-8, j=10, pa={-1:12}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={-1:0}, cont={1:0}, i=-8, j=10, pa={-1:12}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={-1:0}, cont={1:0}, i=-7, j=10, pa={-1:12}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={-1:0}, cont={1:0}, i=-7, j=10, pa={-1:12}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={-1:0}, cont={1:0}, i=-6, j=10, pa={-1:12}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={-1:0}, cont={1:0}, i=-6, j=10, pa={-1:12}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={-1:0}, cont={1:0}, i=-5, j=10, pa={-1:12}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={-1:0}, cont={1:0}, i=-5, j=10, pa={-1:12}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={-1:0}, cont={1:0}, i=-4, j=10, pa={-1:12}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={-1:0}, cont={1:0}, i=-4, j=10, pa={-1:12}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={-1:0}, cont={1:0}, i=-3, j=10, pa={-1:12}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={-1:0}, cont={1:0}, i=-3, j=10, pa={-1:12}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={-1:0}, cont={1:0}, i=-2, j=10, pa={-1:12}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={-1:0}, cont={1:0}, i=-2, j=10, pa={-1:12}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={-1:0}, cont={1:0}, i=-1, j=10, pa={-1:12}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={-1:0}, cont={1:0}, i=-1, j=10, pa={-1:12}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={-1:0}, cont={1:0}, i=0, j=10, pa={-1:12}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={-1:0}, cont={1:0}, i=0, j=10, pa={-1:12}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={-1:0}, cont={1:0}, i=1, j=10, pa={-1:12}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={-1:0}, cont={1:0}, i=1, j=10, pa={-1:12}] [L34] COND FALSE !(i < *pa) [L37] CALL, EXPR check(&cont, i) VAL [\old(i)=1, pc={1:0}] [L14] EXPR pc->array [L14] EXPR pc->array[1].b [L14] return pc->array[1].b == i; [L37] RET, EXPR check(&cont, i) VAL [array={-1:0}, check(&cont, i)=0, cont={1:0}, i=1, j=10, pa={-1:12}] [L37] COND TRUE !check(&cont, i) [L45] __VERIFIER_error() VAL [array={-1:0}, cont={1:0}, i=1, j=10, pa={-1:12}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 45.8s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 236 SDtfs, 139 SDslu, 1256 SDs, 0 SdLazy, 1124 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 551 GetRequests, 366 SyntacticMatches, 2 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 31.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 861 NumberOfCodeBlocks, 834 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 779 ConstructedInterpolants, 16 QuantifiedInterpolants, 134525 SizeOfPredicates, 73 NumberOfNonLiveVariables, 1789 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 435/1302 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...