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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/sanfoundry_10_ground.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:17:14,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:17:14,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:17:14,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:17:14,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:17:14,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:17:14,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:17:14,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:17:14,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:17:14,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:17:14,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:17:14,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:17:14,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:17:14,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:17:14,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:17:14,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:17:14,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:17:14,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:17:14,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:17:14,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:17:14,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:17:14,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:17:14,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:17:14,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:17:14,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:17:14,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:17:14,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:17:14,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:17:14,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:17:14,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:17:14,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:17:14,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:17:14,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:17:14,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:17:14,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:17:14,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:17:14,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:17:14,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:17:14,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:17:14,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:17:14,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:17:14,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:17:14,444 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:17:14,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:17:14,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:17:14,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:17:14,446 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:17:14,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:17:14,446 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:17:14,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:17:14,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:17:14,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:17:14,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:17:14,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:17:14,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:17:14,447 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:17:14,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:17:14,448 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:17:14,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:17:14,448 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:17:14,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:17:14,449 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:17:14,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:17:14,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:17:14,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:17:14,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:17:14,450 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:17:14,450 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:17:14,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:17:14,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:17:14,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:17:14,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:17:14,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:17:14,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:17:14,761 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:17:14,761 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:17:14,762 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_10_ground.c [2019-10-06 23:17:14,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58467d0ab/0db6b8f3414743d69fae3aeb4f6d4b72/FLAG7f16d1465 [2019-10-06 23:17:15,254 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:17:15,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_10_ground.c [2019-10-06 23:17:15,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58467d0ab/0db6b8f3414743d69fae3aeb4f6d4b72/FLAG7f16d1465 [2019-10-06 23:17:15,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58467d0ab/0db6b8f3414743d69fae3aeb4f6d4b72 [2019-10-06 23:17:15,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:17:15,682 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:17:15,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:17:15,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:17:15,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:17:15,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:17:15" (1/1) ... [2019-10-06 23:17:15,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21079aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:15, skipping insertion in model container [2019-10-06 23:17:15,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:17:15" (1/1) ... [2019-10-06 23:17:15,698 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:17:15,715 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:17:15,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:17:15,892 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:17:15,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:17:15,932 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:17:15,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:15 WrapperNode [2019-10-06 23:17:15,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:17:15,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:17:15,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:17:15,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:17:16,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:15" (1/1) ... [2019-10-06 23:17:16,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:15" (1/1) ... [2019-10-06 23:17:16,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:15" (1/1) ... [2019-10-06 23:17:16,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:15" (1/1) ... [2019-10-06 23:17:16,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:15" (1/1) ... [2019-10-06 23:17:16,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:15" (1/1) ... [2019-10-06 23:17:16,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:15" (1/1) ... [2019-10-06 23:17:16,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:17:16,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:17:16,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:17:16,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:17:16,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:17:16,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:17:16,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:17:16,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:17:16,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:17:16,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:17:16,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:17:16,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:17:16,127 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:17:16,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:17:16,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:17:16,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:17:16,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:17:16,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:17:16,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:17:16,547 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:17:16,548 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-06 23:17:16,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:17:16 BoogieIcfgContainer [2019-10-06 23:17:16,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:17:16,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:17:16,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:17:16,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:17:16,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:17:15" (1/3) ... [2019-10-06 23:17:16,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287dbba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:17:16, skipping insertion in model container [2019-10-06 23:17:16,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:17:15" (2/3) ... [2019-10-06 23:17:16,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287dbba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:17:16, skipping insertion in model container [2019-10-06 23:17:16,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:17:16" (3/3) ... [2019-10-06 23:17:16,557 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_10_ground.c [2019-10-06 23:17:16,566 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:17:16,572 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:17:16,583 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:17:16,605 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:17:16,606 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:17:16,606 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:17:16,606 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:17:16,606 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:17:16,606 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:17:16,607 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:17:16,607 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:17:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-06 23:17:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:17:16,631 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:16,632 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:16,634 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:16,640 INFO L82 PathProgramCache]: Analyzing trace with hash -461873160, now seen corresponding path program 1 times [2019-10-06 23:17:16,647 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:16,647 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:16,648 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:16,648 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:16,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:17:16,791 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:16,792 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:17:16,792 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:17:16,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:17:16,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:17:16,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:17:16,813 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-06 23:17:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:16,905 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-10-06 23:17:16,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:17:16,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-06 23:17:16,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:16,918 INFO L225 Difference]: With dead ends: 43 [2019-10-06 23:17:16,919 INFO L226 Difference]: Without dead ends: 20 [2019-10-06 23:17:16,927 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:17:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-06 23:17:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-06 23:17:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-06 23:17:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-06 23:17:16,990 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2019-10-06 23:17:16,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:16,991 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-06 23:17:16,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:17:16,991 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-10-06 23:17:16,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:17:16,993 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:16,993 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:16,994 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:16,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:16,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1309090252, now seen corresponding path program 1 times [2019-10-06 23:17:16,996 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:16,996 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:16,997 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:16,997 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:16,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:17:17,188 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:17,188 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:17,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:17:17,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:17:17,289 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:17:17,322 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-06 23:17:17,323 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-10-06 23:17:17,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-06 23:17:17,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-06 23:17:17,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-06 23:17:17,325 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 4 states. [2019-10-06 23:17:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:17,383 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2019-10-06 23:17:17,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:17:17,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-06 23:17:17,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:17,386 INFO L225 Difference]: With dead ends: 41 [2019-10-06 23:17:17,386 INFO L226 Difference]: Without dead ends: 27 [2019-10-06 23:17:17,388 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-06 23:17:17,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-06 23:17:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-10-06 23:17:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-06 23:17:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-06 23:17:17,400 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2019-10-06 23:17:17,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:17,400 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-06 23:17:17,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-06 23:17:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-06 23:17:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-06 23:17:17,401 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:17,401 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:17,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:17,607 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:17,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:17,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1740034220, now seen corresponding path program 1 times [2019-10-06 23:17:17,609 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:17,609 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:17,609 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:17,609 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:17,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:17:17,741 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:17,742 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:17,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:17,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-06 23:17:17,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:17:17,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:17:17,952 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:17,988 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:17:17,989 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:17,996 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:18,002 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:18,003 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:18,144 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:18,441 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:18,476 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:17:18,484 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:18,484 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:18,485 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 121#(and (not (= 0 main_~found~0)) (<= 0 main_~i~0) (= main_~pos~0 main_~i~0) (= main_~x~0 0) (< main_~x~0 main_~pos~0) (<= 0 main_~pos~0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~x~0))) |main_#t~mem8|)) [2019-10-06 23:17:18,486 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:17:18,486 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:18,486 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:17:18,487 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:18,487 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-06 23:17:18,488 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:18,488 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:18,489 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:18,489 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:18,489 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 116#(and (not (= 0 main_~found~0)) (= main_~pos~0 main_~i~0) (= main_~x~0 0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:18,490 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:17:18,490 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 101#(or (and (not (= 0 main_~found~0)) (<= 0 main_~i~0)) (and (<= 0 main_~i~0) (not (< main_~i~0 main_~n~0)))) [2019-10-06 23:17:18,490 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 106#(and (not (= 0 main_~found~0)) (= main_~pos~0 main_~i~0)) [2019-10-06 23:17:18,491 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 96#(<= 0 main_~i~0) [2019-10-06 23:17:18,491 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 111#(and (not (= 0 main_~found~0)) (= main_~pos~0 main_~i~0) (not (< (+ main_~i~0 1) main_~n~0))) [2019-10-06 23:17:18,982 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:18,983 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 14] total 25 [2019-10-06 23:17:18,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-06 23:17:18,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-06 23:17:18,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:17:18,990 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 25 states. [2019-10-06 23:17:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:20,891 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2019-10-06 23:17:20,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-06 23:17:20,892 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 18 [2019-10-06 23:17:20,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:20,894 INFO L225 Difference]: With dead ends: 68 [2019-10-06 23:17:20,894 INFO L226 Difference]: Without dead ends: 54 [2019-10-06 23:17:20,896 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=553, Invalid=2869, Unknown=0, NotChecked=0, Total=3422 [2019-10-06 23:17:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-06 23:17:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2019-10-06 23:17:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-06 23:17:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-06 23:17:20,907 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2019-10-06 23:17:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:20,908 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-06 23:17:20,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-06 23:17:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-06 23:17:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-06 23:17:20,909 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:20,909 INFO L385 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:21,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:21,118 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:21,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:21,119 INFO L82 PathProgramCache]: Analyzing trace with hash 156923604, now seen corresponding path program 2 times [2019-10-06 23:17:21,119 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:21,119 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:21,119 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:21,120 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:17:21,299 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:21,299 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:21,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:21,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:17:21,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:21,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-06 23:17:21,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:17:21,415 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-06 23:17:21,469 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:21,471 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:17:21,471 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:21,471 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:21,472 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:21,472 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:21,521 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:21,664 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:21,694 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:17:21,699 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:21,699 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:21,700 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 121#(and (not (= 0 main_~found~0)) (<= 0 main_~i~0) (= main_~pos~0 main_~i~0) (= main_~x~0 0) (< main_~x~0 main_~pos~0) (<= 0 main_~pos~0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~x~0))) |main_#t~mem8|)) [2019-10-06 23:17:21,700 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:17:21,700 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:21,700 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:17:21,701 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:21,701 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-06 23:17:21,701 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:21,701 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:21,702 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:21,702 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:21,702 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 116#(and (not (= 0 main_~found~0)) (= main_~pos~0 main_~i~0) (= main_~x~0 0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:21,702 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:17:21,703 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 101#(or (and (not (= 0 main_~found~0)) (<= 0 main_~i~0)) (and (<= 0 main_~i~0) (not (< main_~i~0 main_~n~0)))) [2019-10-06 23:17:21,703 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 106#(and (not (= 0 main_~found~0)) (= main_~pos~0 main_~i~0)) [2019-10-06 23:17:21,703 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 96#(<= 0 main_~i~0) [2019-10-06 23:17:21,703 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 111#(and (not (= 0 main_~found~0)) (= main_~pos~0 main_~i~0) (not (< (+ main_~i~0 1) main_~n~0))) [2019-10-06 23:17:22,185 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:22,185 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6, 14] total 30 [2019-10-06 23:17:22,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-06 23:17:22,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-06 23:17:22,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:17:22,187 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 30 states. [2019-10-06 23:17:25,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:25,066 INFO L93 Difference]: Finished difference Result 95 states and 127 transitions. [2019-10-06 23:17:25,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-06 23:17:25,070 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2019-10-06 23:17:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:25,072 INFO L225 Difference]: With dead ends: 95 [2019-10-06 23:17:25,072 INFO L226 Difference]: Without dead ends: 74 [2019-10-06 23:17:25,075 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1066, Invalid=4940, Unknown=0, NotChecked=0, Total=6006 [2019-10-06 23:17:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-06 23:17:25,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2019-10-06 23:17:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-06 23:17:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-10-06 23:17:25,091 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2019-10-06 23:17:25,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:25,092 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-10-06 23:17:25,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-06 23:17:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2019-10-06 23:17:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-06 23:17:25,093 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:25,093 INFO L385 BasicCegarLoop]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:25,296 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:25,304 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:25,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:25,305 INFO L82 PathProgramCache]: Analyzing trace with hash 604204572, now seen corresponding path program 1 times [2019-10-06 23:17:25,305 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:25,305 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:25,308 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:25,308 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:25,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-06 23:17:25,461 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:25,461 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:25,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:25,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:17:25,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-06 23:17:25,651 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-06 23:17:25,810 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:25,812 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:17:25,812 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:25,812 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:25,813 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:25,813 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:25,836 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:26,010 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:26,023 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:17:26,027 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:26,027 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:26,028 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 152#(and (not (= 0 main_~found~0)) (= main_~x~0 0) (< main_~x~0 main_~pos~0) (<= 0 main_~pos~0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~x~0))) |main_#t~mem8|)) [2019-10-06 23:17:26,028 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 162#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:17:26,028 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 167#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:26,028 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 176#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:17:26,029 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 172#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:26,029 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-06 23:17:26,029 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:26,029 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:26,030 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 181#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:26,030 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:26,030 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 147#(and (not (= 0 main_~found~0)) (= main_~x~0 0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:26,030 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 157#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:17:26,030 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 101#(or (and (not (= 0 main_~found~0)) (<= 0 main_~i~0)) (and (<= 0 main_~i~0) (not (< main_~i~0 main_~n~0)))) [2019-10-06 23:17:26,031 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 137#true [2019-10-06 23:17:26,031 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 96#(<= 0 main_~i~0) [2019-10-06 23:17:26,031 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 142#(not (< (+ main_~i~0 1) main_~n~0)) [2019-10-06 23:17:26,422 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:26,422 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 13] total 44 [2019-10-06 23:17:26,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-06 23:17:26,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-06 23:17:26,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1397, Unknown=0, NotChecked=0, Total=1892 [2019-10-06 23:17:26,426 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 44 states. [2019-10-06 23:17:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:27,889 INFO L93 Difference]: Finished difference Result 104 states and 142 transitions. [2019-10-06 23:17:27,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-06 23:17:27,890 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 28 [2019-10-06 23:17:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:27,891 INFO L225 Difference]: With dead ends: 104 [2019-10-06 23:17:27,891 INFO L226 Difference]: Without dead ends: 71 [2019-10-06 23:17:27,895 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2037 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1168, Invalid=4684, Unknown=0, NotChecked=0, Total=5852 [2019-10-06 23:17:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-06 23:17:27,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2019-10-06 23:17:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-06 23:17:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2019-10-06 23:17:27,912 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 28 [2019-10-06 23:17:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:27,912 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2019-10-06 23:17:27,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-06 23:17:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2019-10-06 23:17:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-06 23:17:27,913 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:27,913 INFO L385 BasicCegarLoop]: trace histogram [20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:28,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:28,118 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:28,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:28,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1318645069, now seen corresponding path program 2 times [2019-10-06 23:17:28,118 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:28,118 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:28,118 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:28,118 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-06 23:17:28,441 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:28,441 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:28,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:28,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:17:28,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:28,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-06 23:17:28,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-06 23:17:28,706 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:17:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-06 23:17:28,927 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:28,930 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:17:28,931 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:28,932 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:28,932 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:28,933 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:28,980 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:17:29,257 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:29,276 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:17:29,283 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:29,283 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:29,283 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 152#(and (not (= 0 main_~found~0)) (= main_~x~0 0) (< main_~x~0 main_~pos~0) (<= 0 main_~pos~0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~x~0))) |main_#t~mem8|)) [2019-10-06 23:17:29,284 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 162#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:17:29,284 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 167#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:29,286 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 176#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:17:29,287 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 172#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:17:29,287 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-06 23:17:29,287 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:29,287 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:29,287 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 181#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:29,288 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:29,288 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 147#(and (not (= 0 main_~found~0)) (= main_~x~0 0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:17:29,288 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 157#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:17:29,288 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 101#(or (and (not (= 0 main_~found~0)) (<= 0 main_~i~0)) (and (<= 0 main_~i~0) (not (< main_~i~0 main_~n~0)))) [2019-10-06 23:17:29,288 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 137#true [2019-10-06 23:17:29,289 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 96#(<= 0 main_~i~0) [2019-10-06 23:17:29,289 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 142#(not (< (+ main_~i~0 1) main_~n~0)) [2019-10-06 23:17:29,769 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:29,769 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 10, 13] total 50 [2019-10-06 23:17:29,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-06 23:17:29,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-06 23:17:29,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=1913, Unknown=0, NotChecked=0, Total=2450 [2019-10-06 23:17:29,773 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 50 states. [2019-10-06 23:17:39,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:17:39,297 INFO L93 Difference]: Finished difference Result 179 states and 252 transitions. [2019-10-06 23:17:39,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-10-06 23:17:39,299 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 39 [2019-10-06 23:17:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:17:39,301 INFO L225 Difference]: With dead ends: 179 [2019-10-06 23:17:39,301 INFO L226 Difference]: Without dead ends: 145 [2019-10-06 23:17:39,309 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9331 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=5703, Invalid=23027, Unknown=0, NotChecked=0, Total=28730 [2019-10-06 23:17:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-06 23:17:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 93. [2019-10-06 23:17:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-06 23:17:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2019-10-06 23:17:39,329 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 39 [2019-10-06 23:17:39,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:17:39,330 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2019-10-06 23:17:39,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-06 23:17:39,330 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2019-10-06 23:17:39,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-06 23:17:39,331 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:17:39,331 INFO L385 BasicCegarLoop]: trace histogram [24, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:17:39,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:39,543 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:17:39,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:17:39,544 INFO L82 PathProgramCache]: Analyzing trace with hash 200395476, now seen corresponding path program 3 times [2019-10-06 23:17:39,544 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:17:39,544 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:39,544 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:39,544 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:17:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:17:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:17:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-06 23:17:39,935 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:17:39,935 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:17:39,935 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:17:40,012 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:17:40,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:17:40,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-06 23:17:40,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:17:40,481 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-10-06 23:17:40,917 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-10-06 23:17:49,034 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 80 [2019-10-06 23:18:20,248 WARN L191 SmtUtils]: Spent 26.11 s on a formula simplification that was a NOOP. DAG size: 85 [2019-10-06 23:18:52,525 WARN L191 SmtUtils]: Spent 30.16 s on a formula simplification that was a NOOP. DAG size: 115 [2019-10-06 23:18:52,813 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 120 [2019-10-06 23:18:52,930 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-06 23:18:53,158 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 96 [2019-10-06 23:18:53,332 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2019-10-06 23:18:53,551 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 71 [2019-10-06 23:18:53,934 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2019-10-06 23:18:55,095 WARN L191 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 470 DAG size of output: 41 [2019-10-06 23:18:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-06 23:18:55,291 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:58,519 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-10-06 23:19:02,138 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 726 DAG size of output: 49 [2019-10-06 23:19:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 12 refuted. 1 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-06 23:19:02,227 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:19:02,229 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:19:02,229 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:19:02,229 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:19:02,230 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:19:02,230 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:19:02,268 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:19:02,465 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:19:02,478 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:19:02,483 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:19:02,483 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:19:02,483 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 152#(and (not (= 0 main_~found~0)) (= main_~x~0 0) (< main_~x~0 main_~pos~0) (<= 0 main_~pos~0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~x~0))) |main_#t~mem8|)) [2019-10-06 23:19:02,484 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 162#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:19:02,484 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 167#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:19:02,484 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 176#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:19:02,484 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 172#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:19:02,484 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-06 23:19:02,485 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:19:02,485 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:19:02,485 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 181#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:19:02,485 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:19:02,485 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 147#(and (not (= 0 main_~found~0)) (= main_~x~0 0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:19:02,486 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 157#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:19:02,486 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 101#(or (and (not (= 0 main_~found~0)) (<= 0 main_~i~0)) (and (<= 0 main_~i~0) (not (< main_~i~0 main_~n~0)))) [2019-10-06 23:19:02,486 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 137#true [2019-10-06 23:19:02,486 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 96#(<= 0 main_~i~0) [2019-10-06 23:19:02,486 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 142#(not (< (+ main_~i~0 1) main_~n~0)) [2019-10-06 23:19:03,329 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:19:03,330 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 14, 13] total 62 [2019-10-06 23:19:03,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-06 23:19:03,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-06 23:19:03,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=3262, Unknown=8, NotChecked=0, Total=3782 [2019-10-06 23:19:03,333 INFO L87 Difference]: Start difference. First operand 93 states and 120 transitions. Second operand 62 states. [2019-10-06 23:19:06,476 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-10-06 23:19:07,863 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-10-06 23:19:11,763 WARN L191 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-10-06 23:19:12,693 WARN L191 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-10-06 23:19:19,332 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-10-06 23:19:25,735 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-10-06 23:19:39,914 WARN L191 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 112 DAG size of output: 109 [2019-10-06 23:19:44,379 WARN L191 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 114 DAG size of output: 111 [2019-10-06 23:20:13,474 WARN L191 SmtUtils]: Spent 28.74 s on a formula simplification. DAG size of input: 168 DAG size of output: 113 [2019-10-06 23:20:43,026 WARN L191 SmtUtils]: Spent 29.14 s on a formula simplification. DAG size of input: 176 DAG size of output: 117 [2019-10-06 23:20:54,502 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-10-06 23:21:21,168 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2019-10-06 23:21:50,837 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2019-10-06 23:22:16,511 WARN L191 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 117 DAG size of output: 114 [2019-10-06 23:22:25,104 WARN L191 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-10-06 23:22:36,076 WARN L191 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-10-06 23:22:48,381 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-10-06 23:23:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:23:02,639 INFO L93 Difference]: Finished difference Result 198 states and 266 transitions. [2019-10-06 23:23:02,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-06 23:23:02,640 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 45 [2019-10-06 23:23:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:23:02,642 INFO L225 Difference]: With dead ends: 198 [2019-10-06 23:23:02,642 INFO L226 Difference]: Without dead ends: 135 [2019-10-06 23:23:02,647 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3763 ImplicationChecksByTransitivity, 267.6s TimeCoverageRelationStatistics Valid=2277, Invalid=14433, Unknown=60, NotChecked=0, Total=16770 [2019-10-06 23:23:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-06 23:23:02,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 98. [2019-10-06 23:23:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-06 23:23:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2019-10-06 23:23:02,679 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 45 [2019-10-06 23:23:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:23:02,679 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2019-10-06 23:23:02,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-06 23:23:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2019-10-06 23:23:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-06 23:23:02,682 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:23:02,682 INFO L385 BasicCegarLoop]: trace histogram [25, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:23:02,885 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:23:02,886 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:23:02,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:23:02,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1111818902, now seen corresponding path program 1 times [2019-10-06 23:23:02,886 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:23:02,887 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:23:02,887 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:23:02,887 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:23:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:23:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:23:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2019-10-06 23:23:03,018 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:23:03,018 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:23:03,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:23:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:23:03,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-06 23:23:03,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:23:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-06 23:23:03,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:23:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 2 proven. 325 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:23:04,476 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:23:04,477 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:23:04,477 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:23:04,478 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:23:04,478 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:23:04,478 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:23:04,514 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:23:05,112 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:23:05,131 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:23:05,135 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:23:05,135 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:23:05,135 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 356#(and (or (and (< main_~x~0 main_~pos~0) (<= 1 main_~x~0) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~x~0))) |main_#t~mem8|)) (and (not (= 0 main_~found~0)) (= main_~x~0 0) (< main_~x~0 main_~pos~0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~x~0))) |main_#t~mem8|))) (<= 0 main_~pos~0) (<= 0 main_~x~0)) [2019-10-06 23:23:05,136 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 510#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:23:05,136 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 525#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:23:05,136 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 534#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:23:05,136 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 520#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:23:05,136 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 530#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:23:05,137 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-06 23:23:05,137 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:23:05,137 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:23:05,137 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 539#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:23:05,137 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:23:05,139 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 431#(and (or (and (<= 0 main_~pos~0) (<= 1 main_~x~0)) (and (not (= 0 main_~found~0)) (= main_~x~0 0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0))) (<= 0 main_~x~0)) [2019-10-06 23:23:05,139 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 505#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:23:05,139 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 515#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:23:05,140 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 101#(or (and (not (= 0 main_~found~0)) (<= 0 main_~i~0)) (and (<= 0 main_~i~0) (not (< main_~i~0 main_~n~0)))) [2019-10-06 23:23:05,140 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 137#true [2019-10-06 23:23:05,140 INFO L193 IcfgInterpreter]: Reachable states at location L43-1 satisfy 501#(and (<= 0 main_~pos~0) (<= 0 main_~x~0)) [2019-10-06 23:23:05,140 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 96#(<= 0 main_~i~0) [2019-10-06 23:23:05,140 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 142#(not (< (+ main_~i~0 1) main_~n~0)) [2019-10-06 23:23:05,595 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:23:05,595 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 28, 28, 15] total 76 [2019-10-06 23:23:05,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-06 23:23:05,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-06 23:23:05,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1731, Invalid=3969, Unknown=0, NotChecked=0, Total=5700 [2019-10-06 23:23:05,599 INFO L87 Difference]: Start difference. First operand 98 states and 126 transitions. Second operand 76 states. [2019-10-06 23:23:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:23:23,161 INFO L93 Difference]: Finished difference Result 312 states and 453 transitions. [2019-10-06 23:23:23,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2019-10-06 23:23:23,162 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 53 [2019-10-06 23:23:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:23:23,167 INFO L225 Difference]: With dead ends: 312 [2019-10-06 23:23:23,167 INFO L226 Difference]: Without dead ends: 245 [2019-10-06 23:23:23,172 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27715 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=16080, Invalid=60372, Unknown=0, NotChecked=0, Total=76452 [2019-10-06 23:23:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-06 23:23:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 130. [2019-10-06 23:23:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-06 23:23:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2019-10-06 23:23:23,206 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 53 [2019-10-06 23:23:23,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:23:23,206 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2019-10-06 23:23:23,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-06 23:23:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2019-10-06 23:23:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-06 23:23:23,208 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:23:23,208 INFO L385 BasicCegarLoop]: trace histogram [52, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:23:23,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:23:23,410 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:23:23,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:23:23,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1053595385, now seen corresponding path program 2 times [2019-10-06 23:23:23,411 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:23:23,412 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:23:23,412 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:23:23,412 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:23:23,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:23:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:23:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2019-10-06 23:23:23,621 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:23:23,621 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:23:23,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:23:23,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:23:23,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:23:23,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-06 23:23:23,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:23:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 52 proven. 18 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2019-10-06 23:23:23,914 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:23:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2019-10-06 23:23:24,065 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:23:24,066 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-06 23:23:24,066 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:23:24,066 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:23:24,067 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:23:24,067 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:23:24,082 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:23:24,701 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:23:24,719 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:23:24,722 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:23:24,723 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:23:24,723 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 356#(and (or (and (< main_~x~0 main_~pos~0) (<= 1 main_~x~0) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~x~0))) |main_#t~mem8|)) (and (not (= 0 main_~found~0)) (= main_~x~0 0) (< main_~x~0 main_~pos~0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0) (= (select (select |#memory_int| |main_~#vectorx~0.base|) (+ |main_~#vectorx~0.offset| (* 4 main_~x~0))) |main_#t~mem8|))) (<= 0 main_~pos~0) (<= 0 main_~x~0)) [2019-10-06 23:23:24,724 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 510#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:23:24,725 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 525#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:23:24,725 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 534#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:23:24,725 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 520#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:23:24,726 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 530#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:23:24,726 INFO L193 IcfgInterpreter]: Reachable states at location L19-3 satisfy 68#true [2019-10-06 23:23:24,726 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:23:24,727 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:23:24,727 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 539#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:23:24,727 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:23:24,728 INFO L193 IcfgInterpreter]: Reachable states at location L42-3 satisfy 431#(and (or (and (<= 0 main_~pos~0) (<= 1 main_~x~0)) (and (not (= 0 main_~found~0)) (= main_~x~0 0) (not (< (+ main_~i~0 1) main_~n~0)) (<= main_~x~0 0))) (<= 0 main_~x~0)) [2019-10-06 23:23:24,728 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 505#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:23:24,728 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 515#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:23:24,729 INFO L193 IcfgInterpreter]: Reachable states at location L24-4 satisfy 101#(or (and (not (= 0 main_~found~0)) (<= 0 main_~i~0)) (and (<= 0 main_~i~0) (not (< main_~i~0 main_~n~0)))) [2019-10-06 23:23:24,729 INFO L193 IcfgInterpreter]: Reachable states at location L34-3 satisfy 137#true [2019-10-06 23:23:24,729 INFO L193 IcfgInterpreter]: Reachable states at location L43-1 satisfy 501#(and (<= 0 main_~pos~0) (<= 0 main_~x~0)) [2019-10-06 23:23:24,730 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 96#(<= 0 main_~i~0) [2019-10-06 23:23:24,730 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 142#(not (< (+ main_~i~0 1) main_~n~0)) [2019-10-06 23:23:25,302 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:23:25,302 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 15] total 44 [2019-10-06 23:23:25,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-06 23:23:25,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-06 23:23:25,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1543, Unknown=0, NotChecked=0, Total=1892 [2019-10-06 23:23:25,304 INFO L87 Difference]: Start difference. First operand 130 states and 158 transitions. Second operand 44 states. [2019-10-06 23:23:29,140 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-10-06 23:23:29,471 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-10-06 23:23:30,187 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-10-06 23:23:30,586 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-10-06 23:23:30,942 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-10-06 23:23:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:23:31,342 INFO L93 Difference]: Finished difference Result 192 states and 239 transitions. [2019-10-06 23:23:31,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-06 23:23:31,342 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 81 [2019-10-06 23:23:31,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:23:31,345 INFO L225 Difference]: With dead ends: 192 [2019-10-06 23:23:31,345 INFO L226 Difference]: Without dead ends: 178 [2019-10-06 23:23:31,347 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5030 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2613, Invalid=11667, Unknown=0, NotChecked=0, Total=14280 [2019-10-06 23:23:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-06 23:23:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 132. [2019-10-06 23:23:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-06 23:23:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 160 transitions. [2019-10-06 23:23:31,389 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 160 transitions. Word has length 81 [2019-10-06 23:23:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:23:31,389 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 160 transitions. [2019-10-06 23:23:31,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-06 23:23:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 160 transitions. [2019-10-06 23:23:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-06 23:23:31,391 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:23:31,391 INFO L385 BasicCegarLoop]: trace histogram [52, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:23:31,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:23:31,596 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:23:31,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:23:31,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1767153128, now seen corresponding path program 3 times [2019-10-06 23:23:31,596 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:23:31,597 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:23:31,597 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:23:31,597 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:23:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:23:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:23:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1409 backedges. 2 proven. 1378 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-06 23:23:33,148 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:23:33,148 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:23:33,148 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:23:33,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:23:33,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:23:33,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-06 23:23:33,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:23:34,122 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-06 23:23:34,949 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 83 [2019-10-06 23:24:07,301 WARN L191 SmtUtils]: Spent 26.18 s on a formula simplification that was a NOOP. DAG size: 121 [2019-10-06 23:24:35,930 WARN L191 SmtUtils]: Spent 20.33 s on a formula simplification. DAG size of input: 127 DAG size of output: 65 [2019-10-06 23:24:42,545 WARN L191 SmtUtils]: Spent 4.50 s on a formula simplification that was a NOOP. DAG size: 68 [2019-10-06 23:24:44,564 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_59 Int) (v_prenex_58 Int) (v_prenex_57 Int)) (and (<= 5 v_prenex_58) (let ((.cse0 (select |c_#memory_int| v_prenex_59)) (.cse1 (* 4 v_prenex_58))) (= (select .cse0 (+ v_prenex_57 .cse1 8)) (select .cse0 (+ v_prenex_57 .cse1 12)))))) (exists ((|v_main_~#vectorx~0.offset_BEFORE_CALL_60| Int) (v_prenex_53 Int) (v_main_~pos~0_BEFORE_CALL_60 Int) (|v_main_~#vectorx~0.base_BEFORE_CALL_60| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#vectorx~0.base_BEFORE_CALL_60|))) (and (<= 5 v_main_~pos~0_BEFORE_CALL_60) (<= (+ v_main_~pos~0_BEFORE_CALL_60 2) v_prenex_53) (let ((.cse3 (* 4 v_prenex_53))) (= (select .cse2 (+ |v_main_~#vectorx~0.offset_BEFORE_CALL_60| .cse3 4)) (select .cse2 (+ |v_main_~#vectorx~0.offset_BEFORE_CALL_60| .cse3)))) (let ((.cse4 (* 4 v_main_~pos~0_BEFORE_CALL_60))) (= (select .cse2 (+ |v_main_~#vectorx~0.offset_BEFORE_CALL_60| .cse4)) (select .cse2 (+ |v_main_~#vectorx~0.offset_BEFORE_CALL_60| .cse4 4))))))) (exists ((v_main_~i~0_340 Int) (v_prenex_63 Int) (v_prenex_65 Int) (v_prenex_64 Int)) (let ((.cse5 (select |c_#memory_int| v_prenex_65))) (and (let ((.cse6 (* 4 v_prenex_64))) (= (select .cse5 (+ v_prenex_63 .cse6 8)) (select .cse5 (+ v_prenex_63 .cse6 4)))) (<= 5 v_prenex_64) (<= (+ v_prenex_64 2) v_main_~i~0_340) (let ((.cse7 (* 4 v_main_~i~0_340))) (= (select .cse5 (+ v_prenex_63 .cse7 4)) (select .cse5 (+ v_prenex_63 .cse7))))))) (exists ((v_prenex_55 Int) (v_prenex_62 Int) (v_prenex_61 Int) (v_prenex_60 Int)) (let ((.cse8 (select |c_#memory_int| v_prenex_62))) (and (<= (+ v_prenex_61 2) v_prenex_55) (<= 5 v_prenex_61) (let ((.cse9 (* 4 v_prenex_55))) (= (select .cse8 (+ v_prenex_60 .cse9 4)) (select .cse8 (+ v_prenex_60 .cse9)))) (not (= (select .cse8 (+ v_prenex_60 (* 4 v_prenex_61))) (select .cse8 (+ v_prenex_60 4)))))))) is different from true [2019-10-06 23:25:16,852 WARN L191 SmtUtils]: Spent 32.14 s on a formula simplification that was a NOOP. DAG size: 94 [2019-10-06 23:25:24,724 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:25:24,725 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:162) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 49 more [2019-10-06 23:25:24,736 INFO L168 Benchmark]: Toolchain (without parser) took 489054.34 ms. Allocated memory was 137.9 MB in the beginning and 411.0 MB in the end (delta: 273.2 MB). Free memory was 102.2 MB in the beginning and 97.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 278.3 MB. Max. memory is 7.1 GB. [2019-10-06 23:25:24,736 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-06 23:25:24,737 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.22 ms. Allocated memory is still 137.9 MB. Free memory was 101.8 MB in the beginning and 91.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-10-06 23:25:24,740 INFO L168 Benchmark]: Boogie Preprocessor took 133.72 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 91.7 MB in the beginning and 180.5 MB in the end (delta: -88.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2019-10-06 23:25:24,741 INFO L168 Benchmark]: RCFGBuilder took 482.07 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 158.9 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-10-06 23:25:24,741 INFO L168 Benchmark]: TraceAbstraction took 488183.77 ms. Allocated memory was 202.9 MB in the beginning and 411.0 MB in the end (delta: 208.1 MB). Free memory was 157.9 MB in the beginning and 97.0 MB in the end (delta: 60.9 MB). Peak memory consumption was 269.0 MB. Max. memory is 7.1 GB. [2019-10-06 23:25:24,742 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 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 250.22 ms. Allocated memory is still 137.9 MB. Free memory was 101.8 MB in the beginning and 91.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.72 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 91.7 MB in the beginning and 180.5 MB in the end (delta: -88.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 482.07 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 158.9 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 488183.77 ms. Allocated memory was 202.9 MB in the beginning and 411.0 MB in the end (delta: 208.1 MB). Free memory was 157.9 MB in the beginning and 97.0 MB in the end (delta: 60.9 MB). Peak memory consumption was 269.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...