/usr/bin/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/test23-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:10:44,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:10:44,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:10:44,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:10:44,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:10:44,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:10:44,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:10:44,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:10:44,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:10:44,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:10:44,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:10:44,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:10:44,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:10:44,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:10:44,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:10:44,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:10:44,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:10:44,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:10:44,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:10:44,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:10:44,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:10:44,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:10:44,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:10:44,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:10:44,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:10:44,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:10:44,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:10:44,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:10:44,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:10:44,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:10:44,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:10:44,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:10:44,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:10:44,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:10:44,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:10:44,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:10:44,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:10:44,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:10:44,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:10:44,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:10:44,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:10:44,341 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-11-06 21:10:44,354 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:10:44,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:10:44,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:10:44,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:10:44,356 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:10:44,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:10:44,357 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:10:44,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:10:44,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:10:44,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:10:44,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:10:44,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:10:44,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:10:44,358 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:10:44,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:10:44,358 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:10:44,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:10:44,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:10:44,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:10:44,359 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:10:44,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:10:44,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:10:44,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:10:44,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:10:44,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:10:44,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:10:44,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:10:44,361 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:10:44,361 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:10:44,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:10:44,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:10:44,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:10:44,678 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:10:44,678 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:10:44,679 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test23-2.c [2019-11-06 21:10:44,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f89a8458/7e1579c73455467f87169ce839e150b1/FLAGd67f43911 [2019-11-06 21:10:45,182 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:10:45,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-2.c [2019-11-06 21:10:45,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f89a8458/7e1579c73455467f87169ce839e150b1/FLAGd67f43911 [2019-11-06 21:10:45,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f89a8458/7e1579c73455467f87169ce839e150b1 [2019-11-06 21:10:45,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:10:45,533 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:10:45,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:10:45,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:10:45,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:10:45,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1b08fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45, skipping insertion in model container [2019-11-06 21:10:45,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,550 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:10:45,569 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:10:45,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:10:45,805 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:10:45,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:10:45,931 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:10:45,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45 WrapperNode [2019-11-06 21:10:45,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:10:45,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:10:45,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:10:45,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:10:45,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (1/1) ... [2019-11-06 21:10:45,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:10:45,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:10:45,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:10:45,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:10:45,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (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-11-06 21:10:46,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:10:46,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:10:46,055 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-11-06 21:10:46,055 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2019-11-06 21:10:46,055 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-06 21:10:46,055 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:10:46,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:10:46,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:10:46,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 21:10:46,056 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 21:10:46,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:10:46,056 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2019-11-06 21:10:46,056 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 21:10:46,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:10:46,057 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:10:46,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:10:46,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 21:10:46,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:10:46,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:10:46,373 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:10:46,373 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 21:10:46,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:46 BoogieIcfgContainer [2019-11-06 21:10:46,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:10:46,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:10:46,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:10:46,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:10:46,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:10:45" (1/3) ... [2019-11-06 21:10:46,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a22059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:46, skipping insertion in model container [2019-11-06 21:10:46,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:45" (2/3) ... [2019-11-06 21:10:46,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a22059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:46, skipping insertion in model container [2019-11-06 21:10:46,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:46" (3/3) ... [2019-11-06 21:10:46,382 INFO L109 eAbstractionObserver]: Analyzing ICFG test23-2.c [2019-11-06 21:10:46,392 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:10:46,400 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:10:46,411 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:10:46,436 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:10:46,436 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:10:46,436 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:10:46,437 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:10:46,437 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:10:46,437 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:10:46,437 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:10:46,437 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:10:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-11-06 21:10:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:10:46,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:46,464 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:10:46,465 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:46,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:46,470 INFO L82 PathProgramCache]: Analyzing trace with hash -128514638, now seen corresponding path program 1 times [2019-11-06 21:10:46,476 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:46,477 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157304219] [2019-11-06 21:10:46,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:10:46,795 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157304219] [2019-11-06 21:10:46,796 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:10:46,797 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:10:46,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993860373] [2019-11-06 21:10:46,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:10:46,808 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:46,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:10:46,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:10:46,820 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2019-11-06 21:10:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:46,954 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2019-11-06 21:10:46,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:10:46,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-06 21:10:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:46,967 INFO L225 Difference]: With dead ends: 46 [2019-11-06 21:10:46,967 INFO L226 Difference]: Without dead ends: 28 [2019-11-06 21:10:46,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:10:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-06 21:10:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-06 21:10:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-06 21:10:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-06 21:10:47,019 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 30 [2019-11-06 21:10:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:47,022 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-06 21:10:47,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:10:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-06 21:10:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:10:47,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:47,025 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:10:47,025 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:47,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1246729484, now seen corresponding path program 1 times [2019-11-06 21:10:47,026 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:47,027 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142072899] [2019-11-06 21:10:47,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:10:47,581 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142072899] [2019-11-06 21:10:47,582 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:10:47,582 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 21:10:47,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966141323] [2019-11-06 21:10:47,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 21:10:47,584 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:47,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 21:10:47,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:10:47,586 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 13 states. [2019-11-06 21:10:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:48,156 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-06 21:10:48,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:10:48,157 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-11-06 21:10:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:48,160 INFO L225 Difference]: With dead ends: 54 [2019-11-06 21:10:48,160 INFO L226 Difference]: Without dead ends: 46 [2019-11-06 21:10:48,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-11-06 21:10:48,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-06 21:10:48,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2019-11-06 21:10:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-06 21:10:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-11-06 21:10:48,175 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 31 [2019-11-06 21:10:48,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:48,175 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-11-06 21:10:48,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 21:10:48,175 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-11-06 21:10:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:10:48,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:48,177 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:10:48,177 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:48,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:48,178 INFO L82 PathProgramCache]: Analyzing trace with hash -824027658, now seen corresponding path program 1 times [2019-11-06 21:10:48,178 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:48,178 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539458254] [2019-11-06 21:10:48,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:10:48,466 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539458254] [2019-11-06 21:10:48,466 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395245422] [2019-11-06 21:10:48,466 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-11-06 21:10:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:48,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-06 21:10:48,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:48,596 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 23 treesize of output 21 [2019-11-06 21:10:48,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 21:10:48,619 INFO L567 ElimStorePlain]: treesize reduction 14, result has 22.2 percent of original size [2019-11-06 21:10:48,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:10:48,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-06 21:10:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:10:48,684 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:10:48,684 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 15 [2019-11-06 21:10:48,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122597143] [2019-11-06 21:10:48,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 21:10:48,685 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:48,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 21:10:48,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:10:48,686 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 15 states. [2019-11-06 21:10:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:49,235 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-11-06 21:10:49,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:10:49,236 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2019-11-06 21:10:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:49,237 INFO L225 Difference]: With dead ends: 56 [2019-11-06 21:10:49,237 INFO L226 Difference]: Without dead ends: 44 [2019-11-06 21:10:49,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2019-11-06 21:10:49,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-06 21:10:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2019-11-06 21:10:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-06 21:10:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-06 21:10:49,248 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2019-11-06 21:10:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:49,249 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-06 21:10:49,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 21:10:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-06 21:10:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:10:49,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:49,250 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:10:49,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:49,463 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2103891336, now seen corresponding path program 1 times [2019-11-06 21:10:49,464 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:49,464 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134183354] [2019-11-06 21:10:49,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:10:49,748 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134183354] [2019-11-06 21:10:49,748 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:10:49,748 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 21:10:49,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733353283] [2019-11-06 21:10:49,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 21:10:49,749 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:49,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 21:10:49,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:10:49,750 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 13 states. [2019-11-06 21:10:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:50,273 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-11-06 21:10:50,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 21:10:50,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-11-06 21:10:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:50,276 INFO L225 Difference]: With dead ends: 54 [2019-11-06 21:10:50,276 INFO L226 Difference]: Without dead ends: 46 [2019-11-06 21:10:50,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-11-06 21:10:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-06 21:10:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2019-11-06 21:10:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-06 21:10:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-06 21:10:50,286 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 31 [2019-11-06 21:10:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:50,286 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-06 21:10:50,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 21:10:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-06 21:10:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 21:10:50,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:50,288 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:10:50,288 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:50,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:50,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1472168143, now seen corresponding path program 1 times [2019-11-06 21:10:50,289 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:50,290 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734128655] [2019-11-06 21:10:50,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:10:50,615 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734128655] [2019-11-06 21:10:50,615 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257623936] [2019-11-06 21:10:50,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-06 21:10:50,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:50,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2019-11-06 21:10:50,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:50,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:50,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:10:50,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2019-11-06 21:10:50,988 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:10:50,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:50,991 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 46 treesize of output 19 [2019-11-06 21:10:50,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:51,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:51,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:10:51,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:22 [2019-11-06 21:10:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:10:53,492 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:10:53,493 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2019-11-06 21:10:53,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201854710] [2019-11-06 21:10:53,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 21:10:53,494 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:53,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 21:10:53,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=488, Unknown=2, NotChecked=0, Total=552 [2019-11-06 21:10:53,495 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 24 states. [2019-11-06 21:10:56,304 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-11-06 21:10:56,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:56,504 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-06 21:10:56,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 21:10:56,505 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-11-06 21:10:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:56,509 INFO L225 Difference]: With dead ends: 58 [2019-11-06 21:10:56,510 INFO L226 Difference]: Without dead ends: 50 [2019-11-06 21:10:56,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=147, Invalid=907, Unknown=2, NotChecked=0, Total=1056 [2019-11-06 21:10:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-06 21:10:56,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2019-11-06 21:10:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-06 21:10:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-06 21:10:56,525 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 33 [2019-11-06 21:10:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:56,525 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-06 21:10:56,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 21:10:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-06 21:10:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 21:10:56,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:56,527 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:10:56,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:56,736 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:56,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1921618093, now seen corresponding path program 1 times [2019-11-06 21:10:56,737 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:56,738 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345884079] [2019-11-06 21:10:56,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:10:57,095 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345884079] [2019-11-06 21:10:57,095 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576118513] [2019-11-06 21:10:57,095 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-11-06 21:10:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:57,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-06 21:10:57,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:57,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2019-11-06 21:10:57,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:57,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:57,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:10:57,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2019-11-06 21:10:57,460 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:10:57,463 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:57,463 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 46 treesize of output 19 [2019-11-06 21:10:57,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:57,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:57,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:10:57,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:22 [2019-11-06 21:11:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:11:00,452 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:11:00,452 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2019-11-06 21:11:00,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782111301] [2019-11-06 21:11:00,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 21:11:00,453 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:11:00,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 21:11:00,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=485, Unknown=2, NotChecked=0, Total=552 [2019-11-06 21:11:00,454 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 24 states. [2019-11-06 21:11:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:11:06,945 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-06 21:11:06,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-06 21:11:06,946 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-11-06 21:11:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:11:06,948 INFO L225 Difference]: With dead ends: 58 [2019-11-06 21:11:06,948 INFO L226 Difference]: Without dead ends: 50 [2019-11-06 21:11:06,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=185, Invalid=1143, Unknown=4, NotChecked=0, Total=1332 [2019-11-06 21:11:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-06 21:11:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2019-11-06 21:11:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-06 21:11:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-06 21:11:06,959 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 33 [2019-11-06 21:11:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:11:06,959 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-06 21:11:06,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 21:11:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-06 21:11:06,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 21:11:06,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:11:06,961 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:11:07,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:11:07,162 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:11:07,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:11:07,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1302295574, now seen corresponding path program 2 times [2019-11-06 21:11:07,168 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:11:07,168 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336533026] [2019-11-06 21:11:07,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:11:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:11:07,569 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336533026] [2019-11-06 21:11:07,569 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445183489] [2019-11-06 21:11:07,569 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-11-06 21:11:07,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:11:07,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:11:07,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-06 21:11:07,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:11:07,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-11-06 21:11:07,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:11:07,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:11:07,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:11:07,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:60 [2019-11-06 21:11:07,926 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:11:07,929 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:11:07,930 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 55 treesize of output 22 [2019-11-06 21:11:07,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:11:07,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:11:07,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:11:07,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:35 [2019-11-06 21:11:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:11:10,537 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:11:10,537 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 24 [2019-11-06 21:11:10,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697673057] [2019-11-06 21:11:10,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 21:11:10,538 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:11:10,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 21:11:10,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=472, Unknown=2, NotChecked=0, Total=552 [2019-11-06 21:11:10,539 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 24 states. [2019-11-06 21:11:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:11:11,470 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-11-06 21:11:11,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 21:11:11,473 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2019-11-06 21:11:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:11:11,474 INFO L225 Difference]: With dead ends: 62 [2019-11-06 21:11:11,474 INFO L226 Difference]: Without dead ends: 54 [2019-11-06 21:11:11,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=196, Invalid=992, Unknown=2, NotChecked=0, Total=1190 [2019-11-06 21:11:11,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-06 21:11:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2019-11-06 21:11:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-06 21:11:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-06 21:11:11,484 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 35 [2019-11-06 21:11:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:11:11,484 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-06 21:11:11,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 21:11:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-06 21:11:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 21:11:11,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:11:11,485 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:11:11,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:11:11,687 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:11:11,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:11:11,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1444276590, now seen corresponding path program 2 times [2019-11-06 21:11:11,688 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:11:11,688 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818743350] [2019-11-06 21:11:11,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:11:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:11:12,006 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818743350] [2019-11-06 21:11:12,006 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414344177] [2019-11-06 21:11:12,006 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 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-11-06 21:11:12,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:11:12,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:11:12,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-06 21:11:12,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:11:12,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-06 21:11:12,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:11:12,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:11:12,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:11:12,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-11-06 21:11:12,290 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:11:12,291 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:11:12,292 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 44 treesize of output 19 [2019-11-06 21:11:12,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:11:12,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:11:12,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:11:12,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:22 [2019-11-06 21:11:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:11:16,146 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:11:16,147 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 24 [2019-11-06 21:11:16,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101529930] [2019-11-06 21:11:16,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 21:11:16,147 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:11:16,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 21:11:16,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=481, Unknown=2, NotChecked=0, Total=552 [2019-11-06 21:11:16,148 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 24 states. [2019-11-06 21:11:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:11:23,695 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-11-06 21:11:23,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-06 21:11:23,696 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2019-11-06 21:11:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:11:23,697 INFO L225 Difference]: With dead ends: 77 [2019-11-06 21:11:23,698 INFO L226 Difference]: Without dead ends: 69 [2019-11-06 21:11:23,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=401, Invalid=2044, Unknown=5, NotChecked=0, Total=2450 [2019-11-06 21:11:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-06 21:11:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2019-11-06 21:11:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-06 21:11:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-06 21:11:23,709 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 35 [2019-11-06 21:11:23,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:11:23,709 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-06 21:11:23,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 21:11:23,710 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-06 21:11:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-06 21:11:23,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:11:23,711 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:11:23,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:11:23,915 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:11:23,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:11:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash -387236795, now seen corresponding path program 3 times [2019-11-06 21:11:23,916 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:11:23,916 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826261706] [2019-11-06 21:11:23,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:11:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:11:24,221 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826261706] [2019-11-06 21:11:24,222 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324370099] [2019-11-06 21:11:24,222 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 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-11-06 21:11:24,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 21:11:24,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:11:24,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-06 21:11:24,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:11:24,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-11-06 21:11:24,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:11:24,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:11:24,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:11:24,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2019-11-06 21:11:26,846 WARN L860 $PredicateComparison]: unable to prove that (exists ((main_~pa~0.offset Int) (v_main_~pd2~0.base_BEFORE_CALL_1 Int) (main_~pd1~0.offset Int) (v_main_~pd2~0.offset_BEFORE_CALL_1 Int)) (and (<= 0 v_main_~pd2~0.offset_BEFORE_CALL_1) (<= main_~pd1~0.offset 0) (= 0 (mod (+ main_~pa~0.offset (* main_~pd1~0.offset 3)) 4)) (<= v_main_~pd2~0.offset_BEFORE_CALL_1 main_~pd1~0.offset) (let ((.cse0 (div (+ main_~pa~0.offset (- main_~pd1~0.offset) (- 8)) 4))) (= .cse0 (select (select |c_#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (+ (* .cse0 4) v_main_~pd2~0.offset_BEFORE_CALL_1 8)))))) is different from true [2019-11-06 21:11:32,965 WARN L191 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-06 21:11:33,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:11:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 21:11:33,211 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:11:33,211 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2019-11-06 21:11:33,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823095844] [2019-11-06 21:11:33,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-06 21:11:33,212 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:11:33,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-06 21:11:33,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=907, Unknown=1, NotChecked=60, Total=1056 [2019-11-06 21:11:33,213 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 33 states.