java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:08:39,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:08:39,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:08:39,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:08:39,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:08:39,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:08:39,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:08:39,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:08:39,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:08:39,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:08:39,229 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:08:39,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:08:39,231 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:08:39,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:08:39,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:08:39,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:08:39,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:08:39,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:08:39,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:08:39,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:08:39,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:08:39,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:08:39,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:08:39,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:08:39,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:08:39,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:08:39,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:08:39,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:08:39,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:08:39,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:08:39,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:08:39,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:08:39,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:08:39,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:08:39,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:08:39,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:08:39,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:08:39,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:08:39,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:08:39,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:08:39,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:08:39,271 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-14 23:08:39,306 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:08:39,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:08:39,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:08:39,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:08:39,308 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:08:39,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:08:39,312 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:08:39,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:08:39,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:08:39,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:08:39,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:08:39,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:08:39,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:08:39,313 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:08:39,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:08:39,314 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:08:39,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:08:39,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:08:39,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:08:39,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:08:39,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:08:39,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:08:39,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:08:39,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:08:39,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:08:39,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:08:39,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:08:39,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:08:39,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:08:39,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:08:39,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:08:39,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:08:39,624 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:08:39,625 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:08:39,626 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test25-2.c [2019-10-14 23:08:39,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e79a2925/79e0519a02aa4d3280ec69c22db1286c/FLAG9f061cd1e [2019-10-14 23:08:40,190 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:08:40,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25-2.c [2019-10-14 23:08:40,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e79a2925/79e0519a02aa4d3280ec69c22db1286c/FLAG9f061cd1e [2019-10-14 23:08:40,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e79a2925/79e0519a02aa4d3280ec69c22db1286c [2019-10-14 23:08:40,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:08:40,566 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:08:40,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:08:40,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:08:40,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:08:40,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:08:40" (1/1) ... [2019-10-14 23:08:40,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de83e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:08:40, skipping insertion in model container [2019-10-14 23:08:40,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:08:40" (1/1) ... [2019-10-14 23:08:40,588 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:08:40,611 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:08:40,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:08:40,826 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:08:40,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:08:40,953 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:08:40,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:08:40 WrapperNode [2019-10-14 23:08:40,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:08:40,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:08:40,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:08:40,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:08:40,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:08:40" (1/1) ... [2019-10-14 23:08:40,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:08:40" (1/1) ... [2019-10-14 23:08:40,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:08:40" (1/1) ... [2019-10-14 23:08:40,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:08:40" (1/1) ... [2019-10-14 23:08:40,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:08:40" (1/1) ... [2019-10-14 23:08:40,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:08:40" (1/1) ... [2019-10-14 23:08:40,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:08:40" (1/1) ... [2019-10-14 23:08:41,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:08:41,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:08:41,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:08:41,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:08:41,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:08:40" (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-14 23:08:41,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:08:41,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:08:41,053 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-14 23:08:41,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:08:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:08:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:08:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-14 23:08:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:08:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:08:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:08:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 23:08:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:08:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:08:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:08:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:08:41,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:08:41,373 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:08:41,374 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 23:08:41,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:08:41 BoogieIcfgContainer [2019-10-14 23:08:41,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:08:41,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:08:41,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:08:41,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:08:41,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:08:40" (1/3) ... [2019-10-14 23:08:41,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cb86fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:08:41, skipping insertion in model container [2019-10-14 23:08:41,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:08:40" (2/3) ... [2019-10-14 23:08:41,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cb86fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:08:41, skipping insertion in model container [2019-10-14 23:08:41,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:08:41" (3/3) ... [2019-10-14 23:08:41,383 INFO L109 eAbstractionObserver]: Analyzing ICFG test25-2.c [2019-10-14 23:08:41,393 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:08:41,401 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:08:41,412 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:08:41,433 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:08:41,433 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:08:41,433 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:08:41,433 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:08:41,433 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:08:41,434 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:08:41,434 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:08:41,434 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:08:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-14 23:08:41,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:08:41,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:08:41,455 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:08:41,457 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:08:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:08:41,462 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2019-10-14 23:08:41,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:08:41,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997120467] [2019-10-14 23:08:41,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:41,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:41,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:08:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:41,667 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-14 23:08:41,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997120467] [2019-10-14 23:08:41,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:08:41,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:08:41,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620544961] [2019-10-14 23:08:41,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:08:41,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:08:41,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:08:41,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:08:41,692 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-10-14 23:08:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:08:41,790 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-10-14 23:08:41,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:08:41,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-14 23:08:41,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:08:41,804 INFO L225 Difference]: With dead ends: 42 [2019-10-14 23:08:41,804 INFO L226 Difference]: Without dead ends: 20 [2019-10-14 23:08:41,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-14 23:08:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-14 23:08:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-14 23:08:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-14 23:08:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-14 23:08:41,861 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-10-14 23:08:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:08:41,864 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-14 23:08:41,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:08:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-14 23:08:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:08:41,867 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:08:41,867 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:08:41,868 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:08:41,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:08:41,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2019-10-14 23:08:41,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:08:41,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818327877] [2019-10-14 23:08:41,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:41,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:41,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:08:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:42,003 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-14 23:08:42,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818327877] [2019-10-14 23:08:42,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:08:42,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:08:42,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336226445] [2019-10-14 23:08:42,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:08:42,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:08:42,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:08:42,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:08:42,008 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2019-10-14 23:08:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:08:42,087 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-10-14 23:08:42,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:08:42,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-14 23:08:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:08:42,088 INFO L225 Difference]: With dead ends: 34 [2019-10-14 23:08:42,089 INFO L226 Difference]: Without dead ends: 22 [2019-10-14 23:08:42,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:08:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-14 23:08:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-14 23:08:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-14 23:08:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-14 23:08:42,102 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-10-14 23:08:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:08:42,103 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-14 23:08:42,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:08:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-10-14 23:08:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:08:42,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:08:42,106 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:08:42,107 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:08:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:08:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2019-10-14 23:08:42,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:08:42,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107048020] [2019-10-14 23:08:42,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:42,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:42,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:08:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:42,282 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-14 23:08:42,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107048020] [2019-10-14 23:08:42,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855579380] [2019-10-14 23:08:42,283 INFO L94 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-14 23:08:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:42,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:08:42,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:08:42,430 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-14 23:08:42,431 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:08:42,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-10-14 23:08:42,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003722214] [2019-10-14 23:08:42,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:08:42,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:08:42,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:08:42,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:08:42,436 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2019-10-14 23:08:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:08:42,509 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-10-14 23:08:42,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:08:42,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-14 23:08:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:08:42,510 INFO L225 Difference]: With dead ends: 36 [2019-10-14 23:08:42,510 INFO L226 Difference]: Without dead ends: 24 [2019-10-14 23:08:42,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:08:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-14 23:08:42,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-14 23:08:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-14 23:08:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-14 23:08:42,517 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-10-14 23:08:42,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:08:42,517 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-14 23:08:42,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:08:42,518 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-10-14 23:08:42,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-14 23:08:42,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:08:42,519 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:08:42,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:08:42,723 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:08:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:08:42,724 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2019-10-14 23:08:42,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:08:42,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842235085] [2019-10-14 23:08:42,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:42,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:42,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:08:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:08:42,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842235085] [2019-10-14 23:08:42,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711084884] [2019-10-14 23:08:42,872 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-14 23:08:42,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-14 23:08:42,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:08:42,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-14 23:08:42,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:08:43,046 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:08:43,056 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:08:43,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-10-14 23:08:43,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:08:43,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:08:43,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:08:43,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-10-14 23:08:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 23:08:43,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:08:43,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-14 23:08:43,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390671297] [2019-10-14 23:08:43,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:08:43,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:08:43,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:08:43,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:08:43,092 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2019-10-14 23:08:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:08:43,715 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-10-14 23:08:43,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:08:43,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-14 23:08:43,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:08:43,717 INFO L225 Difference]: With dead ends: 33 [2019-10-14 23:08:43,717 INFO L226 Difference]: Without dead ends: 25 [2019-10-14 23:08:43,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:08:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-14 23:08:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-14 23:08:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-14 23:08:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-14 23:08:43,723 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-10-14 23:08:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:08:43,723 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-14 23:08:43,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:08:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-14 23:08:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:08:43,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:08:43,724 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:08:43,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:08:43,925 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:08:43,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:08:43,926 INFO L82 PathProgramCache]: Analyzing trace with hash -413303094, now seen corresponding path program 1 times [2019-10-14 23:08:43,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:08:43,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902076513] [2019-10-14 23:08:43,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:43,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:43,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:08:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:08:44,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902076513] [2019-10-14 23:08:44,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280933401] [2019-10-14 23:08:44,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-14 23:08:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:44,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:08:44,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:08:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:08:44,101 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:08:44,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-14 23:08:44,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531054480] [2019-10-14 23:08:44,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:08:44,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:08:44,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:08:44,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:08:44,103 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2019-10-14 23:08:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:08:44,184 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-10-14 23:08:44,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:08:44,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-10-14 23:08:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:08:44,187 INFO L225 Difference]: With dead ends: 42 [2019-10-14 23:08:44,187 INFO L226 Difference]: Without dead ends: 28 [2019-10-14 23:08:44,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:08:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-14 23:08:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-14 23:08:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 23:08:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-10-14 23:08:44,193 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-10-14 23:08:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:08:44,194 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-14 23:08:44,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:08:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-10-14 23:08:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:08:44,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:08:44,195 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:08:44,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:08:44,399 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:08:44,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:08:44,399 INFO L82 PathProgramCache]: Analyzing trace with hash -50594516, now seen corresponding path program 2 times [2019-10-14 23:08:44,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:08:44,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150671203] [2019-10-14 23:08:44,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:44,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:44,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:08:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:08:44,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150671203] [2019-10-14 23:08:44,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116513632] [2019-10-14 23:08:44,483 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-14 23:08:44,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:08:44,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:08:44,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:08:44,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:08:44,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:08:44,564 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:08:44,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-10-14 23:08:44,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810600143] [2019-10-14 23:08:44,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:08:44,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:08:44,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:08:44,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:08:44,567 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2019-10-14 23:08:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:08:44,651 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-10-14 23:08:44,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:08:44,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-10-14 23:08:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:08:44,653 INFO L225 Difference]: With dead ends: 44 [2019-10-14 23:08:44,653 INFO L226 Difference]: Without dead ends: 30 [2019-10-14 23:08:44,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:08:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-14 23:08:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-14 23:08:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-14 23:08:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-10-14 23:08:44,659 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-10-14 23:08:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:08:44,660 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-10-14 23:08:44,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:08:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-10-14 23:08:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:08:44,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:08:44,661 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:08:44,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:08:44,868 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:08:44,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:08:44,868 INFO L82 PathProgramCache]: Analyzing trace with hash 619997966, now seen corresponding path program 3 times [2019-10-14 23:08:44,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:08:44,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82734538] [2019-10-14 23:08:44,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:44,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:44,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:08:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:08:45,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82734538] [2019-10-14 23:08:45,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820869562] [2019-10-14 23:08:45,004 INFO L92 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-14 23:08:45,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-14 23:08:45,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:08:45,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-14 23:08:45,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:08:45,181 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:08:45,184 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:08:45,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-10-14 23:08:45,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:08:45,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:08:45,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:08:45,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-10-14 23:08:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-14 23:08:45,208 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:08:45,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-10-14 23:08:45,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243146585] [2019-10-14 23:08:45,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:08:45,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:08:45,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:08:45,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:08:45,210 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 12 states. [2019-10-14 23:08:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:08:47,064 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-10-14 23:08:47,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:08:47,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-10-14 23:08:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:08:47,066 INFO L225 Difference]: With dead ends: 48 [2019-10-14 23:08:47,066 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 23:08:47,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:08:47,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 23:08:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-14 23:08:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:08:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-10-14 23:08:47,074 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2019-10-14 23:08:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:08:47,074 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-10-14 23:08:47,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:08:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-10-14 23:08:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:08:47,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:08:47,078 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:08:47,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:08:47,280 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:08:47,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:08:47,281 INFO L82 PathProgramCache]: Analyzing trace with hash 977288683, now seen corresponding path program 4 times [2019-10-14 23:08:47,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:08:47,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127484118] [2019-10-14 23:08:47,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:47,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:08:47,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:08:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:08:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 23:08:47,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127484118] [2019-10-14 23:08:47,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453700289] [2019-10-14 23:08:47,400 INFO L92 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-14 23:08:47,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 23:08:47,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:08:47,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-14 23:08:47,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:08:50,310 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:08:50,312 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:08:50,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-10-14 23:08:50,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:08:50,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:08:50,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:08:50,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-10-14 23:08:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-14 23:08:50,358 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:08:50,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-10-14 23:08:50,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937232496] [2019-10-14 23:08:50,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:08:50,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:08:50,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:08:50,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=139, Unknown=2, NotChecked=0, Total=182 [2019-10-14 23:08:50,360 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 14 states. [2019-10-14 23:08:56,055 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 31 [2019-10-14 23:08:58,092 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2019-10-14 23:09:03,700 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-10-14 23:09:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:09:05,789 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-10-14 23:09:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 23:09:05,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-10-14 23:09:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:09:05,791 INFO L225 Difference]: With dead ends: 54 [2019-10-14 23:09:05,792 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 23:09:05,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=69, Invalid=268, Unknown=5, NotChecked=0, Total=342 [2019-10-14 23:09:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 23:09:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-10-14 23:09:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-14 23:09:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-10-14 23:09:05,798 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2019-10-14 23:09:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:09:05,799 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-10-14 23:09:05,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:09:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-10-14 23:09:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 23:09:05,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:09:05,800 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:09:06,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:09:06,002 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:09:06,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:09:06,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1797098632, now seen corresponding path program 5 times [2019-10-14 23:09:06,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:09:06,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336536100] [2019-10-14 23:09:06,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:09:06,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:09:06,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:09:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:09:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:09:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:09:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 23:09:06,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336536100] [2019-10-14 23:09:06,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077109395] [2019-10-14 23:09:06,149 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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-14 23:09:07,122 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-14 23:09:07,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:09:07,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-14 23:09:07,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:09:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 23:09:07,145 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:09:07,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-10-14 23:09:07,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563816359] [2019-10-14 23:09:07,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:09:07,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:09:07,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:09:07,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:09:07,147 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 11 states. [2019-10-14 23:09:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:09:07,241 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-10-14 23:09:07,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:09:07,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-10-14 23:09:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:09:07,243 INFO L225 Difference]: With dead ends: 58 [2019-10-14 23:09:07,243 INFO L226 Difference]: Without dead ends: 40 [2019-10-14 23:09:07,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:09:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-14 23:09:07,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-14 23:09:07,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-14 23:09:07,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-10-14 23:09:07,249 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-10-14 23:09:07,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:09:07,250 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-10-14 23:09:07,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:09:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-10-14 23:09:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:09:07,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:09:07,251 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:09:07,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:09:07,455 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:09:07,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:09:07,456 INFO L82 PathProgramCache]: Analyzing trace with hash -820541462, now seen corresponding path program 6 times [2019-10-14 23:09:07,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:09:07,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144533109] [2019-10-14 23:09:07,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:09:07,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:09:07,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:09:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:09:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:09:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:09:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 23:09:07,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144533109] [2019-10-14 23:09:07,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224600663] [2019-10-14 23:09:07,579 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-14 23:09:07,693 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-14 23:09:07,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:09:07,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-14 23:09:07,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:09:07,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-14 23:09:07,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:09:07,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:09:07,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:09:07,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-10-14 23:09:07,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:09:07,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:09:07,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:09:07,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-14 23:09:07,772 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:09:07,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:09:07,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:09:07,790 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:28 [2019-10-14 23:09:09,941 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|))) is different from true [2019-10-14 23:09:16,033 WARN L191 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 30 [2019-10-14 23:09:16,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:09:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-14 23:09:16,105 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:09:16,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-10-14 23:09:16,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386291501] [2019-10-14 23:09:16,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-14 23:09:16,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:09:16,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-14 23:09:16,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=278, Unknown=1, NotChecked=34, Total=380 [2019-10-14 23:09:16,107 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-10-14 23:09:20,674 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-10-14 23:09:26,763 WARN L191 SmtUtils]: Spent 6.06 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-14 23:09:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:09:26,871 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-10-14 23:09:26,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:09:26,871 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-10-14 23:09:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:09:26,872 INFO L225 Difference]: With dead ends: 58 [2019-10-14 23:09:26,872 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:09:26,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=207, Invalid=985, Unknown=2, NotChecked=66, Total=1260 [2019-10-14 23:09:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:09:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:09:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:09:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:09:26,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2019-10-14 23:09:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:09:26,875 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:09:26,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-14 23:09:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:09:26,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:09:27,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:09:27,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:09:27,478 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 27 [2019-10-14 23:09:27,487 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:09:27,488 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-14 23:09:27,488 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:09:27,488 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:09:27,488 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:09:27,488 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:09:27,489 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:09:27,489 INFO L439 ceAbstractionStarter]: At program point L37-4(lines 37 39) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (let ((.cse2 (select (select |#memory_int| .cse0) .cse1))) (and (= main_~pa~0.base .cse0) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset .cse1) (<= main_~i~0 .cse2) (not (= .cse0 |main_~#cont~0.base|)) (<= .cse2 main_~i~0) (not (= |main_~#array~0.base| |main_~#cont~0.base|))))) [2019-10-14 23:09:27,489 INFO L443 ceAbstractionStarter]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2019-10-14 23:09:27,489 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 20 50) no Hoare annotation was computed. [2019-10-14 23:09:27,489 INFO L439 ceAbstractionStarter]: At program point L27-3(lines 27 30) the Hoare annotation is: (and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|))) [2019-10-14 23:09:27,490 INFO L443 ceAbstractionStarter]: For program point L27-4(lines 21 50) no Hoare annotation was computed. [2019-10-14 23:09:27,490 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 20 50) no Hoare annotation was computed. [2019-10-14 23:09:27,490 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-14 23:09:27,490 INFO L443 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2019-10-14 23:09:27,490 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 44) no Hoare annotation was computed. [2019-10-14 23:09:27,490 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 20 50) the Hoare annotation is: (= |#valid| |old(#valid)|) [2019-10-14 23:09:27,490 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-10-14 23:09:27,490 INFO L439 ceAbstractionStarter]: At program point L41(lines 21 50) the Hoare annotation is: false [2019-10-14 23:09:27,491 INFO L443 ceAbstractionStarter]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2019-10-14 23:09:27,491 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 43) no Hoare annotation was computed. [2019-10-14 23:09:27,491 INFO L439 ceAbstractionStarter]: At program point L37-3(lines 37 39) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|))) (and (= main_~pa~0.base .cse0) (= |main_~#cont~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= .cse0 |main_~#cont~0.base|)) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))) [2019-10-14 23:09:27,491 INFO L446 ceAbstractionStarter]: At program point checkENTRY(lines 15 18) the Hoare annotation is: true [2019-10-14 23:09:27,491 INFO L443 ceAbstractionStarter]: For program point checkFINAL(lines 15 18) no Hoare annotation was computed. [2019-10-14 23:09:27,491 INFO L443 ceAbstractionStarter]: For program point checkEXIT(lines 15 18) no Hoare annotation was computed. [2019-10-14 23:09:27,499 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-14 23:09:27,500 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-14 23:09:27,500 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-14 23:09:27,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-14 23:09:27,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-14 23:09:27,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-14 23:09:27,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-14 23:09:27,506 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-14 23:09:27,506 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-14 23:09:27,507 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-14 23:09:27,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-14 23:09:27,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-14 23:09:27,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-14 23:09:27,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-14 23:09:27,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:09:27 BoogieIcfgContainer [2019-10-14 23:09:27,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:09:27,513 INFO L168 Benchmark]: Toolchain (without parser) took 46947.38 ms. Allocated memory was 147.3 MB in the beginning and 259.0 MB in the end (delta: 111.7 MB). Free memory was 104.8 MB in the beginning and 108.3 MB in the end (delta: -3.5 MB). Peak memory consumption was 108.2 MB. Max. memory is 7.1 GB. [2019-10-14 23:09:27,514 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:09:27,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.12 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 104.6 MB in the beginning and 183.6 MB in the end (delta: -79.0 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:09:27,516 INFO L168 Benchmark]: Boogie Preprocessor took 47.24 ms. Allocated memory is still 205.0 MB. Free memory was 183.6 MB in the beginning and 181.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:09:27,516 INFO L168 Benchmark]: RCFGBuilder took 373.59 ms. Allocated memory is still 205.0 MB. Free memory was 181.4 MB in the beginning and 164.2 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:09:27,517 INFO L168 Benchmark]: TraceAbstraction took 46135.42 ms. Allocated memory was 205.0 MB in the beginning and 259.0 MB in the end (delta: 54.0 MB). Free memory was 164.2 MB in the beginning and 108.3 MB in the end (delta: 55.9 MB). Peak memory consumption was 109.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:09:27,521 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.53 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 383.12 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 104.6 MB in the beginning and 183.6 MB in the end (delta: -79.0 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.24 ms. Allocated memory is still 205.0 MB. Free memory was 183.6 MB in the beginning and 181.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 373.59 ms. Allocated memory is still 205.0 MB. Free memory was 181.4 MB in the beginning and 164.2 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46135.42 ms. Allocated memory was 205.0 MB in the beginning and 259.0 MB in the end (delta: 54.0 MB). Free memory was 164.2 MB in the beginning and 108.3 MB in the end (delta: 55.9 MB). Peak memory consumption was 109.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant [2019-10-14 23:09:27,529 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-14 23:09:27,530 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-14 23:09:27,530 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-14 23:09:27,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-14 23:09:27,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-14 23:09:27,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-14 23:09:27,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-14 23:09:27,532 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-14 23:09:27,532 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-14 23:09:27,532 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-14 23:09:27,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-14 23:09:27,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-14 23:09:27,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-14 23:09:27,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((pa == #memory_$Pointer$[cont][cont] && cont == 0) && i <= unknown-#memory_int-unknown[pa][pa]) && pa == #memory_$Pointer$[cont][cont] + 4) && !(#memory_$Pointer$[cont][cont] == cont)) && !(array == cont) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: cont == 0 && !(array == cont) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Result: SAFE, OverallTime: 46.0s, OverallIterations: 10, TraceHistogramMax: 7, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 164 SDtfs, 68 SDslu, 461 SDs, 0 SdLazy, 642 SolverSat, 37 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 35.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 19 PreInvPairs, 32 NumberOfFragments, 130 HoareAnnotationTreeSize, 19 FomulaSimplifications, 263 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 163 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 487 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 469 ConstructedInterpolants, 12 QuantifiedInterpolants, 51108 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1018 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 155/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...