/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_FUNCTIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/eqn2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 14:14:42,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 14:14:42,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 14:14:42,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 14:14:42,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 14:14:42,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 14:14:42,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 14:14:42,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 14:14:42,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 14:14:42,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 14:14:42,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 14:14:42,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 14:14:42,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 14:14:42,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 14:14:42,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 14:14:42,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 14:14:42,402 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 14:14:42,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 14:14:42,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 14:14:42,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 14:14:42,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 14:14:42,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 14:14:42,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 14:14:42,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 14:14:42,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 14:14:42,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 14:14:42,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 14:14:42,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 14:14:42,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 14:14:42,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 14:14:42,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 14:14:42,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 14:14:42,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 14:14:42,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 14:14:42,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 14:14:42,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 14:14:42,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 14:14:42,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 14:14:42,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 14:14:42,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 14:14:42,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 14:14:42,434 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 [2020-07-20 14:14:42,468 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 14:14:42,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 14:14:42,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 14:14:42,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 14:14:42,470 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 14:14:42,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 14:14:42,473 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 14:14:42,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 14:14:42,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 14:14:42,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 14:14:42,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 14:14:42,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 14:14:42,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 14:14:42,474 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 14:14:42,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 14:14:42,475 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 14:14:42,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 14:14:42,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 14:14:42,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 14:14:42,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 14:14:42,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 14:14:42,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 14:14:42,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 14:14:42,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 14:14:42,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 14:14:42,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 14:14:42,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:14:42,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 14:14:42,478 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 14:14:42,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_FUNCTIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-20 14:14:42,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 14:14:42,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 14:14:42,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 14:14:42,772 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 14:14:42,773 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 14:14:42,774 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-20 14:14:42,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49ba4555c/ecd2ce1d85f34392bcf9f138b2f8266f/FLAG96e326ed5 [2020-07-20 14:14:43,326 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 14:14:43,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn2f.c [2020-07-20 14:14:43,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49ba4555c/ecd2ce1d85f34392bcf9f138b2f8266f/FLAG96e326ed5 [2020-07-20 14:14:43,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49ba4555c/ecd2ce1d85f34392bcf9f138b2f8266f [2020-07-20 14:14:43,724 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 14:14:43,727 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 14:14:43,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 14:14:43,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 14:14:43,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 14:14:43,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:14:43" (1/1) ... [2020-07-20 14:14:43,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a9b1c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:14:43, skipping insertion in model container [2020-07-20 14:14:43,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:14:43" (1/1) ... [2020-07-20 14:14:43,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 14:14:43,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 14:14:43,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 14:14:43,918 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 14:14:43,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 14:14:43,951 INFO L208 MainTranslator]: Completed translation [2020-07-20 14:14:43,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:14:43 WrapperNode [2020-07-20 14:14:43,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 14:14:43,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 14:14:43,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 14:14:43,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 14:14:44,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:14:43" (1/1) ... [2020-07-20 14:14:44,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:14:43" (1/1) ... [2020-07-20 14:14:44,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:14:43" (1/1) ... [2020-07-20 14:14:44,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:14:43" (1/1) ... [2020-07-20 14:14:44,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:14:43" (1/1) ... [2020-07-20 14:14:44,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:14:43" (1/1) ... [2020-07-20 14:14:44,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:14:43" (1/1) ... [2020-07-20 14:14:44,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 14:14:44,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 14:14:44,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 14:14:44,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 14:14:44,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:14:43" (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 [2020-07-20 14:14:44,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 14:14:44,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 14:14:44,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-20 14:14:44,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-20 14:14:44,148 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 14:14:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 14:14:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-20 14:14:44,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-20 14:14:44,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-20 14:14:44,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 14:14:44,149 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-20 14:14:44,149 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 14:14:44,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-20 14:14:44,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-20 14:14:44,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-20 14:14:44,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 14:14:44,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 14:14:44,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-20 14:14:44,476 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 14:14:44,476 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-20 14:14:44,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:14:44 BoogieIcfgContainer [2020-07-20 14:14:44,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 14:14:44,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 14:14:44,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 14:14:44,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 14:14:44,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 02:14:43" (1/3) ... [2020-07-20 14:14:44,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666436ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:14:44, skipping insertion in model container [2020-07-20 14:14:44,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:14:43" (2/3) ... [2020-07-20 14:14:44,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666436ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:14:44, skipping insertion in model container [2020-07-20 14:14:44,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:14:44" (3/3) ... [2020-07-20 14:14:44,488 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn2f.c [2020-07-20 14:14:44,499 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 14:14:44,506 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 14:14:44,519 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 14:14:44,543 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 14:14:44,543 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 14:14:44,543 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 14:14:44,543 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 14:14:44,544 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 14:14:44,544 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 14:14:44,544 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 14:14:44,544 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 14:14:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-20 14:14:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 14:14:44,565 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:14:44,566 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:14:44,566 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:14:44,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:14:44,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-20 14:14:44,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:14:44,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [965002308] [2020-07-20 14:14:44,579 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:14:44,682 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:14:44,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:14:44,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-20 14:14:44,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:14:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:14:44,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:14:44,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [965002308] [2020-07-20 14:14:44,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:14:44,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-20 14:14:44,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336435521] [2020-07-20 14:14:44,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-20 14:14:44,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:14:44,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-20 14:14:44,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-20 14:14:44,739 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-20 14:14:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:14:44,761 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-20 14:14:44,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-20 14:14:44,762 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2020-07-20 14:14:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:14:44,771 INFO L225 Difference]: With dead ends: 58 [2020-07-20 14:14:44,771 INFO L226 Difference]: Without dead ends: 29 [2020-07-20 14:14:44,775 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-20 14:14:44,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-20 14:14:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-20 14:14:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-20 14:14:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-20 14:14:44,813 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-20 14:14:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:14:44,813 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-20 14:14:44,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-20 14:14:44,814 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-20 14:14:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 14:14:44,815 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:14:44,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:14:45,031 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:14:45,031 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:14:45,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:14:45,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-20 14:14:45,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:14:45,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1812733949] [2020-07-20 14:14:45,034 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:14:45,123 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:14:45,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:14:45,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-20 14:14:45,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:14:45,231 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:14:45,232 INFO L384 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 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-20 14:14:45,233 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:14:45,272 INFO L624 ElimStorePlain]: treesize reduction 16, result has 61.9 percent of original size [2020-07-20 14:14:45,276 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 14:14:45,277 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:11 [2020-07-20 14:14:45,374 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:14:45,374 INFO L384 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 19 treesize of output 19 [2020-07-20 14:14:45,376 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-20 14:14:45,391 INFO L624 ElimStorePlain]: treesize reduction 12, result has 36.8 percent of original size [2020-07-20 14:14:45,391 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 14:14:45,392 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2020-07-20 14:14:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:14:45,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:14:45,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1812733949] [2020-07-20 14:14:45,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:14:45,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-20 14:14:45,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490077965] [2020-07-20 14:14:45,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 14:14:45,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:14:45,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 14:14:45,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-20 14:14:45,450 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 8 states. [2020-07-20 14:14:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:14:45,700 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-20 14:14:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 14:14:45,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-20 14:14:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:14:45,704 INFO L225 Difference]: With dead ends: 48 [2020-07-20 14:14:45,705 INFO L226 Difference]: Without dead ends: 46 [2020-07-20 14:14:45,706 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-20 14:14:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-20 14:14:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-07-20 14:14:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-20 14:14:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-20 14:14:45,720 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-20 14:14:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:14:45,720 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-20 14:14:45,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 14:14:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-20 14:14:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 14:14:45,722 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:14:45,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:14:45,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:14:45,938 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:14:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:14:45,939 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-20 14:14:45,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:14:45,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1006134060] [2020-07-20 14:14:45,941 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:14:46,019 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:14:46,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:14:46,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 14:14:46,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:14:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:14:46,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:14:46,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1006134060] [2020-07-20 14:14:46,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:14:46,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 14:14:46,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498219299] [2020-07-20 14:14:46,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 14:14:46,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:14:46,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 14:14:46,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-20 14:14:46,062 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-20 14:14:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:14:46,171 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-20 14:14:46,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 14:14:46,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-20 14:14:46,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:14:46,175 INFO L225 Difference]: With dead ends: 71 [2020-07-20 14:14:46,175 INFO L226 Difference]: Without dead ends: 58 [2020-07-20 14:14:46,176 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-20 14:14:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-20 14:14:46,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-20 14:14:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-20 14:14:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-20 14:14:46,185 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-20 14:14:46,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:14:46,185 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-20 14:14:46,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 14:14:46,186 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-20 14:14:46,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-20 14:14:46,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:14:46,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:14:46,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:14:46,401 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:14:46,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:14:46,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-20 14:14:46,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:14:46,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [552309833] [2020-07-20 14:14:46,402 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:14:46,459 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:14:46,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:14:46,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 14:14:46,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:14:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:14:46,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:14:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:14:46,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [552309833] [2020-07-20 14:14:46,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:14:46,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-20 14:14:46,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962616880] [2020-07-20 14:14:46,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 14:14:46,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:14:46,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 14:14:46,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 14:14:46,540 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2020-07-20 14:14:46,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:14:46,708 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-20 14:14:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 14:14:46,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-20 14:14:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:14:46,711 INFO L225 Difference]: With dead ends: 66 [2020-07-20 14:14:46,711 INFO L226 Difference]: Without dead ends: 55 [2020-07-20 14:14:46,715 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-07-20 14:14:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-20 14:14:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-20 14:14:46,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-20 14:14:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-20 14:14:46,733 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-20 14:14:46,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:14:46,733 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-20 14:14:46,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 14:14:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-20 14:14:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 14:14:46,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:14:46,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:14:46,941 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:14:46,942 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:14:46,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:14:46,942 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-20 14:14:46,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:14:46,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1401855552] [2020-07-20 14:14:46,944 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:14:47,017 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:14:47,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:14:47,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-20 14:14:47,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:14:47,042 INFO L384 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 [2020-07-20 14:14:47,043 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:14:47,054 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:14:47,066 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-20 14:14:47,067 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 14:14:47,091 INFO L624 ElimStorePlain]: treesize reduction 4, result has 85.7 percent of original size [2020-07-20 14:14:47,091 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 14:14:47,092 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:24 [2020-07-20 14:14:47,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:14:47,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:14:47,121 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 14:14:47,140 INFO L350 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2020-07-20 14:14:47,141 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 57 [2020-07-20 14:14:47,142 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:14:47,182 INFO L624 ElimStorePlain]: treesize reduction 39, result has 57.6 percent of original size [2020-07-20 14:14:47,183 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 14:14:47,183 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:53 [2020-07-20 14:14:47,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:14:47,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:14:47,281 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 14:14:47,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:14:47,423 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-07-20 14:14:47,424 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:14:47,425 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 62 treesize of output 237 [2020-07-20 14:14:47,431 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:14:47,558 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2020-07-20 14:14:47,560 INFO L624 ElimStorePlain]: treesize reduction 257, result has 22.8 percent of original size [2020-07-20 14:14:47,561 INFO L544 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. [2020-07-20 14:14:47,562 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:76 [2020-07-20 14:14:47,607 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:14:47,746 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:14:47,934 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 14:14:47,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:14:47,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:14:47,941 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 14:14:47,942 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 14:14:47,978 INFO L350 Elim1Store]: treesize reduction 43, result has 37.7 percent of original size [2020-07-20 14:14:47,979 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 58 treesize of output 43 [2020-07-20 14:14:47,981 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:14:48,001 INFO L624 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2020-07-20 14:14:48,003 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 14:14:48,004 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:7 [2020-07-20 14:14:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:14:48,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:14:48,123 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 14:14:49,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (<= c_~N~0 main_~i~0) (< (+ main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* main_~i~0 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-20 14:14:50,126 WARN L193 SmtUtils]: Spent 828.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-07-20 14:14:50,308 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-07-20 14:14:51,530 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_2 Int)) (or (= 1 (select (let ((.cse2 (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (* c_main_~i~0 8))) (store .cse3 (+ .cse4 c_main_~a~0.offset) (+ (select .cse3 (+ .cse4 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse0 (select (store |c_#memory_int| c_main_~a~0.base .cse2) c_main_~b~0.base)) (.cse1 (* v_prenex_2 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse2 (+ .cse1 c_main_~a~0.offset (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))))))) c_main_~b~0.offset)) (< v_prenex_2 c_main_~i~0) (< c_main_~i~0 v_prenex_2))) is different from false [2020-07-20 14:14:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-07-20 14:14:51,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1401855552] [2020-07-20 14:14:51,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:14:51,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2020-07-20 14:14:51,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693551321] [2020-07-20 14:14:51,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 14:14:51,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:14:51,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 14:14:51,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=304, Unknown=2, NotChecked=74, Total=462 [2020-07-20 14:14:51,570 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 22 states. [2020-07-20 14:14:52,438 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= 1 c_main_~i~0) (= 0 c_main_~a~0.offset) (forall ((v_prenex_2 Int)) (or (= 1 (select (let ((.cse2 (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (* c_main_~i~0 8))) (store .cse3 (+ .cse4 c_main_~a~0.offset) (+ (select .cse3 (+ .cse4 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse0 (select (store |c_#memory_int| c_main_~a~0.base .cse2) c_main_~b~0.base)) (.cse1 (* v_prenex_2 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse2 (+ .cse1 c_main_~a~0.offset (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))))))) c_main_~b~0.offset)) (< v_prenex_2 c_main_~i~0) (< c_main_~i~0 v_prenex_2))) (= 8 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) (= c_main_~b~0.offset 0)) is different from false [2020-07-20 14:14:53,231 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse1 (+ c_main_~a~0.offset 8)))) (and (<= c_~N~0 2) (<= c_main_~i~0 2) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (< 1 c_~N~0) (= 0 c_main_~a~0.offset) (= 12 .cse0) (= .cse0 (+ (select .cse1 c_main_~a~0.offset) 4)) (= c_main_~b~0.offset 0) (forall ((main_~i~0 Int)) (or (<= c_~N~0 main_~i~0) (< (+ main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* main_~i~0 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset))))))) is different from false [2020-07-20 14:14:54,267 WARN L193 SmtUtils]: Spent 980.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-07-20 14:14:55,017 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse1 (+ c_main_~a~0.offset 8)))) (and (<= c_~N~0 2) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (< 1 c_~N~0) (= 0 c_main_~a~0.offset) (= 12 .cse0) (= .cse0 (+ (select .cse1 c_main_~a~0.offset) 4)) (= c_main_~b~0.offset 0) (forall ((main_~i~0 Int)) (or (<= c_~N~0 main_~i~0) (< (+ main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* main_~i~0 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset))))))) is different from false [2020-07-20 14:14:55,992 WARN L193 SmtUtils]: Spent 928.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-07-20 14:14:57,984 WARN L193 SmtUtils]: Spent 1.94 s on a formula simplification that was a NOOP. DAG size: 34 [2020-07-20 14:15:01,030 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (forall ((main_~i~0 Int)) (or (<= c_~N~0 main_~i~0) (< (+ main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* main_~i~0 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset))))) is different from false [2020-07-20 14:15:04,030 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 44 [2020-07-20 14:15:05,826 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 55 [2020-07-20 14:15:07,226 WARN L193 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 54 [2020-07-20 14:15:07,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:15:07,273 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2020-07-20 14:15:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-20 14:15:07,274 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2020-07-20 14:15:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:15:07,280 INFO L225 Difference]: With dead ends: 89 [2020-07-20 14:15:07,280 INFO L226 Difference]: Without dead ends: 87 [2020-07-20 14:15:07,282 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=240, Invalid=770, Unknown=6, NotChecked=390, Total=1406 [2020-07-20 14:15:07,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-20 14:15:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 48. [2020-07-20 14:15:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-20 14:15:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2020-07-20 14:15:07,308 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 26 [2020-07-20 14:15:07,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:15:07,312 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2020-07-20 14:15:07,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 14:15:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-20 14:15:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-20 14:15:07,313 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:15:07,314 INFO L422 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] [2020-07-20 14:15:07,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:15:07,528 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:15:07,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:15:07,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1499578309, now seen corresponding path program 2 times [2020-07-20 14:15:07,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:15:07,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1499856609] [2020-07-20 14:15:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:15:07,619 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:15:07,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:15:07,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 14:15:07,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:15:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:15:07,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:15:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:15:07,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1499856609] [2020-07-20 14:15:07,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:15:07,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-20 14:15:07,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835715115] [2020-07-20 14:15:07,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 14:15:07,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:15:07,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 14:15:07,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-20 14:15:07,706 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2020-07-20 14:15:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:15:07,942 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2020-07-20 14:15:07,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 14:15:07,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-20 14:15:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:15:07,945 INFO L225 Difference]: With dead ends: 95 [2020-07-20 14:15:07,945 INFO L226 Difference]: Without dead ends: 74 [2020-07-20 14:15:07,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2020-07-20 14:15:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-20 14:15:07,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2020-07-20 14:15:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-20 14:15:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2020-07-20 14:15:07,958 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 28 [2020-07-20 14:15:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:15:07,959 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2020-07-20 14:15:07,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 14:15:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2020-07-20 14:15:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 14:15:07,960 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:15:07,960 INFO L422 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] [2020-07-20 14:15:08,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:15:08,171 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:15:08,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:15:08,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 3 times [2020-07-20 14:15:08,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:15:08,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1516857107] [2020-07-20 14:15:08,174 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:15:08,250 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:15:08,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:15:08,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-20 14:15:08,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:15:08,266 INFO L384 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 [2020-07-20 14:15:08,267 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:15:08,281 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:15:08,286 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-20 14:15:08,286 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 14:15:08,293 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:15:08,294 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 14:15:08,294 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:22 [2020-07-20 14:15:08,364 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-20 14:15:08,365 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2020-07-20 14:15:08,366 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:15:08,402 INFO L624 ElimStorePlain]: treesize reduction 35, result has 55.7 percent of original size [2020-07-20 14:15:08,403 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 14:15:08,403 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2020-07-20 14:15:08,512 INFO L350 Elim1Store]: treesize reduction 126, result has 31.5 percent of original size [2020-07-20 14:15:08,513 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 89 [2020-07-20 14:15:08,514 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:15:08,572 INFO L624 ElimStorePlain]: treesize reduction 35, result has 66.7 percent of original size [2020-07-20 14:15:08,572 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 14:15:08,573 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2020-07-20 14:15:08,795 INFO L350 Elim1Store]: treesize reduction 86, result has 50.9 percent of original size [2020-07-20 14:15:08,796 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 82 treesize of output 155 [2020-07-20 14:15:08,798 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:15:08,882 INFO L624 ElimStorePlain]: treesize reduction 94, result has 46.6 percent of original size [2020-07-20 14:15:08,882 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 14:15:08,883 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:82 [2020-07-20 14:15:08,999 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:15:09,001 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:09,003 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:15:09,019 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 14:15:09,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,042 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 14:15:09,122 INFO L244 Elim1Store]: Index analysis took 104 ms [2020-07-20 14:15:09,140 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 94 [2020-07-20 14:15:09,142 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:15:09,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 14:15:09,220 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 14:15:09,221 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 204 [2020-07-20 14:15:09,225 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 14:15:09,431 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2020-07-20 14:15:09,432 INFO L624 ElimStorePlain]: treesize reduction 173, result has 56.8 percent of original size [2020-07-20 14:15:09,434 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-07-20 14:15:09,435 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:225, output treesize:227 [2020-07-20 14:15:09,568 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:09,569 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:15:09,903 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-07-20 14:15:09,907 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-20 14:15:10,514 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2020-07-20 14:15:10,515 INFO L350 Elim1Store]: treesize reduction 102, result has 64.7 percent of original size [2020-07-20 14:15:10,516 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 116 treesize of output 213 [2020-07-20 14:15:10,521 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2020-07-20 14:15:10,521 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:15:10,522 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-20 14:15:10,522 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:15:10,523 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 14:15:10,523 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:15:10,524 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 14:15:10,525 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:15:10,525 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 14:15:10,525 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,526 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 14:15:10,526 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:10,530 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 2, 5, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-20 14:15:10,531 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,532 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-20 14:15:10,533 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,534 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 14:15:10,534 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:15:10,535 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 14:15:10,535 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:15:10,536 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 14:15:10,536 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,537 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 14:15:10,537 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:10,539 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-20 14:15:10,539 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,540 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 3, 1] term [2020-07-20 14:15:10,540 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,541 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 14:15:10,541 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:15:10,542 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 14:15:10,542 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,543 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 14:15:10,543 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:10,544 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 3, 1] term [2020-07-20 14:15:10,545 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,545 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-07-20 14:15:10,546 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:10,547 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 14:15:10,547 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:15:10,548 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 14:15:10,548 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,549 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 14:15:10,549 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:10,550 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 14:15:10,551 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:15:10,552 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 14:15:10,552 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:15:10,553 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 14:15:10,553 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,554 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 14:15:10,554 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:10,556 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[12, 2, 1] term [2020-07-20 14:15:10,556 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:15:10,557 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-20 14:15:10,558 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:15:10,559 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 2, 3, 1] term [2020-07-20 14:15:10,559 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:15:10,560 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2020-07-20 14:15:10,560 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:15:10,561 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-20 14:15:10,561 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:15:10,562 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 14:15:10,562 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:15:10,563 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 14:15:10,563 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:15:10,564 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 14:15:10,564 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,565 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 14:15:10,565 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:10,567 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 2, 3, 1] term [2020-07-20 14:15:10,567 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:15:10,568 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 2, 3, 1] term [2020-07-20 14:15:10,568 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:15:10,570 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 2, 3, 1] term [2020-07-20 14:15:10,570 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:15:10,570 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 3, 1] term [2020-07-20 14:15:10,571 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,571 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-07-20 14:15:10,572 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:10,574 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2020-07-20 14:15:10,574 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-20 14:15:10,575 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2020-07-20 14:15:10,575 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 14:15:10,576 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-20 14:15:10,576 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 14:15:10,577 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-20 14:15:10,577 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:15:10,578 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 14:15:10,578 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,579 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 14:15:10,579 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:10,581 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 4, 2, 3, 2, 3, 3, 2, 3, 1] term [2020-07-20 14:15:10,582 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 14:15:10,583 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 2, 3, 2, 3, 3, 2, 3, 1] term [2020-07-20 14:15:10,584 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,585 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 2, 3, 2, 3, 3, 2, 3, 1] term [2020-07-20 14:15:10,586 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:10,588 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 3, 1] term [2020-07-20 14:15:10,588 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:10,589 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-07-20 14:15:10,589 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:10,590 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-20 14:15:10,590 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 14:15:10,591 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 14:15:10,591 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 14:15:10,603 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 14:15:10,919 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 15 [2020-07-20 14:15:10,920 INFO L624 ElimStorePlain]: treesize reduction 4090, result has 0.4 percent of original size [2020-07-20 14:15:10,921 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 14:15:10,922 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:129, output treesize:7 [2020-07-20 14:15:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:15:11,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:15:11,180 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 14:15:13,245 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (= 1 (select (let ((.cse4 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* main_~i~0 8))) (let ((.cse2 (select .cse4 (+ c_main_~b~0.offset .cse1 (- 8)))) (.cse3 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8))))) (let ((.cse0 (store .cse4 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse3)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) .cse3))))) c_main_~b~0.offset)) (< (+ main_~i~0 2) c_~N~0) (<= c_~N~0 (+ main_~i~0 1)))) is different from false [2020-07-20 14:15:17,424 WARN L193 SmtUtils]: Spent 1.82 s on a formula simplification that was a NOOP. DAG size: 40 [2020-07-20 14:15:19,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_7 Int)) (let ((.cse0 (+ v_prenex_7 1))) (or (< c_main_~i~0 .cse0) (< .cse0 c_main_~i~0) (= 1 (select (let ((.cse7 (let ((.cse8 (select |c_#memory_int| c_main_~a~0.base)) (.cse9 (* c_main_~i~0 8))) (store .cse8 (+ .cse9 c_main_~a~0.offset) (+ (select .cse8 (+ .cse9 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse7))) (let ((.cse6 (select .cse4 c_main_~b~0.base)) (.cse2 (* v_prenex_7 8))) (let ((.cse3 (select .cse6 (+ c_main_~b~0.offset .cse2 (- 8)))) (.cse5 (select .cse7 (+ .cse2 c_main_~a~0.offset (- 8))))) (let ((.cse1 (store .cse6 (+ c_main_~b~0.offset .cse2) (+ .cse3 .cse5)))) (store .cse1 (+ c_main_~b~0.offset .cse2 8) (+ .cse3 (select (select (store .cse4 c_main_~b~0.base .cse1) c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset)) .cse5))))))) c_main_~b~0.offset))))) is different from false [2020-07-20 14:15:21,093 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_7 Int)) (or (< c_main_~i~0 v_prenex_7) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* c_main_~i~0 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset 8) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset)) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse5 (select .cse4 c_main_~b~0.base)) (.cse1 (* v_prenex_7 8))) (let ((.cse2 (select .cse5 (+ c_main_~b~0.offset .cse1 (- 8)))) (.cse3 (select .cse6 (+ .cse1 c_main_~a~0.offset (- 8))))) (let ((.cse0 (store .cse5 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse3)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 .cse3 (select (select (store .cse4 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset))))))))) c_main_~b~0.offset)) (< v_prenex_7 c_main_~i~0))) is different from false [2020-07-20 14:15:23,119 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_7 Int)) (or (< c_main_~i~0 v_prenex_7) (< v_prenex_7 c_main_~i~0) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* c_main_~i~0 8))) (let ((.cse9 (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))))) (store (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ .cse9 4)) (+ .cse8 c_main_~a~0.offset 8) (+ .cse9 8)))))) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse5 (select .cse3 c_main_~b~0.base)) (.cse1 (* v_prenex_7 8))) (let ((.cse2 (select .cse6 (+ .cse1 c_main_~a~0.offset (- 8)))) (.cse4 (select .cse5 (+ c_main_~b~0.offset .cse1 (- 8))))) (let ((.cse0 (store .cse5 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse4)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 (select (select (store .cse3 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) .cse4))))))) c_main_~b~0.offset)))) is different from false [2020-07-20 14:15:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-07-20 14:15:23,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1516857107] [2020-07-20 14:15:23,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:15:23,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2020-07-20 14:15:23,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520131942] [2020-07-20 14:15:23,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-07-20 14:15:23,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:15:23,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-07-20 14:15:23,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=531, Unknown=5, NotChecked=204, Total=870 [2020-07-20 14:15:23,169 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 30 states. [2020-07-20 14:15:25,027 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_7 Int)) (or (< c_main_~i~0 v_prenex_7) (< v_prenex_7 c_main_~i~0) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* c_main_~i~0 8))) (let ((.cse9 (select .cse7 (+ .cse8 c_main_~a~0.offset (- 8))))) (store (store .cse7 (+ .cse8 c_main_~a~0.offset) (+ .cse9 4)) (+ .cse8 c_main_~a~0.offset 8) (+ .cse9 8)))))) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse5 (select .cse3 c_main_~b~0.base)) (.cse1 (* v_prenex_7 8))) (let ((.cse2 (select .cse6 (+ .cse1 c_main_~a~0.offset (- 8)))) (.cse4 (select .cse5 (+ c_main_~b~0.offset .cse1 (- 8))))) (let ((.cse0 (store .cse5 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse4)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 (select (select (store .cse3 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) .cse4))))))) c_main_~b~0.offset)))) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= 1 c_main_~i~0) (= 8 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) (not (= c_main_~a~0.base c_main_~b~0.base))) is different from false [2020-07-20 14:15:26,475 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base))) (and (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= 1 c_main_~i~0) (forall ((v_prenex_7 Int)) (or (< c_main_~i~0 v_prenex_7) (= 1 (select (let ((.cse6 (let ((.cse7 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (* c_main_~i~0 8))) (store .cse7 (+ .cse8 c_main_~a~0.offset 8) (+ (select .cse7 (+ .cse8 c_main_~a~0.offset)) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse6))) (let ((.cse5 (select .cse4 c_main_~b~0.base)) (.cse1 (* v_prenex_7 8))) (let ((.cse2 (select .cse5 (+ c_main_~b~0.offset .cse1 (- 8)))) (.cse3 (select .cse6 (+ .cse1 c_main_~a~0.offset (- 8))))) (let ((.cse0 (store .cse5 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse3)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 .cse3 (select (select (store .cse4 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset))))))))) c_main_~b~0.offset)) (< v_prenex_7 c_main_~i~0))) (= 8 (select .cse9 c_main_~a~0.offset)) (not (= c_main_~a~0.base c_main_~b~0.base)) (let ((.cse10 (* c_main_~i~0 8))) (= (+ (select .cse9 (+ .cse10 c_main_~a~0.offset (- 8))) 4) (select .cse9 (+ .cse10 c_main_~a~0.offset)))))) is different from false [2020-07-20 14:15:27,881 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| c_main_~a~0.base))) (and (= 2 c_main_~i~0) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (forall ((v_prenex_7 Int)) (let ((.cse0 (+ v_prenex_7 1))) (or (< c_main_~i~0 .cse0) (< .cse0 c_main_~i~0) (= 1 (select (let ((.cse7 (let ((.cse8 (select |c_#memory_int| c_main_~a~0.base)) (.cse9 (* c_main_~i~0 8))) (store .cse8 (+ .cse9 c_main_~a~0.offset) (+ (select .cse8 (+ .cse9 c_main_~a~0.offset (- 8))) 4))))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse7))) (let ((.cse6 (select .cse4 c_main_~b~0.base)) (.cse2 (* v_prenex_7 8))) (let ((.cse3 (select .cse6 (+ c_main_~b~0.offset .cse2 (- 8)))) (.cse5 (select .cse7 (+ .cse2 c_main_~a~0.offset (- 8))))) (let ((.cse1 (store .cse6 (+ c_main_~b~0.offset .cse2) (+ .cse3 .cse5)))) (store .cse1 (+ c_main_~b~0.offset .cse2 8) (+ .cse3 (select (select (store .cse4 c_main_~b~0.base .cse1) c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset)) .cse5))))))) c_main_~b~0.offset))))) (= 8 (select .cse10 c_main_~a~0.offset)) (let ((.cse11 (* c_main_~i~0 8))) (= (select .cse10 (+ .cse11 c_main_~a~0.offset (- 8))) (+ (select .cse10 (+ .cse11 c_main_~a~0.offset (- 16))) 4))) (not (= c_main_~a~0.base c_main_~b~0.base)))) is different from false [2020-07-20 14:15:32,071 WARN L193 SmtUtils]: Spent 3.99 s on a formula simplification that was a NOOP. DAG size: 43 [2020-07-20 14:15:33,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse1 (+ c_main_~a~0.offset 8))) (.cse2 (select .cse1 c_main_~a~0.offset))) (and (= (+ .cse0 4) (select .cse1 (+ c_main_~a~0.offset 16))) (<= c_main_~i~0 3) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (<= c_~N~0 3) (< 2 c_~N~0) (= 8 .cse2) (= .cse0 (+ .cse2 4)) (not (= c_main_~a~0.base c_main_~b~0.base)) (forall ((main_~i~0 Int)) (or (= 1 (select (let ((.cse7 (select |c_#memory_int| c_main_~b~0.base)) (.cse4 (* main_~i~0 8))) (let ((.cse5 (select .cse7 (+ c_main_~b~0.offset .cse4 (- 8)))) (.cse6 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset (- 8))))) (let ((.cse3 (store .cse7 (+ c_main_~b~0.offset .cse4) (+ .cse5 .cse6)))) (store .cse3 (+ c_main_~b~0.offset .cse4 8) (+ .cse5 (select (select (store |c_#memory_int| c_main_~b~0.base .cse3) c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset)) .cse6))))) c_main_~b~0.offset)) (< (+ main_~i~0 2) c_~N~0) (<= c_~N~0 (+ main_~i~0 1))))))) is different from false [2020-07-20 14:15:44,102 WARN L193 SmtUtils]: Spent 10.20 s on a formula simplification that was a NOOP. DAG size: 67 [2020-07-20 14:15:46,080 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse1 (+ c_main_~a~0.offset 8))) (.cse2 (select .cse1 c_main_~a~0.offset))) (and (= (+ .cse0 4) (select .cse1 (+ c_main_~a~0.offset 16))) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (<= c_~N~0 3) (< 2 c_~N~0) (= 8 .cse2) (= .cse0 (+ .cse2 4)) (not (= c_main_~a~0.base c_main_~b~0.base)) (forall ((main_~i~0 Int)) (or (= 1 (select (let ((.cse7 (select |c_#memory_int| c_main_~b~0.base)) (.cse4 (* main_~i~0 8))) (let ((.cse5 (select .cse7 (+ c_main_~b~0.offset .cse4 (- 8)))) (.cse6 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset (- 8))))) (let ((.cse3 (store .cse7 (+ c_main_~b~0.offset .cse4) (+ .cse5 .cse6)))) (store .cse3 (+ c_main_~b~0.offset .cse4 8) (+ .cse5 (select (select (store |c_#memory_int| c_main_~b~0.base .cse3) c_main_~a~0.base) (+ .cse4 c_main_~a~0.offset)) .cse6))))) c_main_~b~0.offset)) (< (+ main_~i~0 2) c_~N~0) (<= c_~N~0 (+ main_~i~0 1))))))) is different from false [2020-07-20 14:15:50,310 WARN L193 SmtUtils]: Spent 4.08 s on a formula simplification that was a NOOP. DAG size: 56 [2020-07-20 14:15:56,469 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_prenex_7 Int)) (or (= 1 (select (let ((.cse4 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* v_prenex_7 8))) (let ((.cse2 (select .cse4 (+ c_main_~b~0.offset .cse1 (- 8)))) (.cse3 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8))))) (let ((.cse0 (store .cse4 (+ c_main_~b~0.offset .cse1) (+ .cse2 .cse3)))) (store .cse0 (+ c_main_~b~0.offset .cse1 8) (+ .cse2 (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) .cse3))))) c_main_~b~0.offset)) (<= c_~N~0 (+ v_prenex_7 1)) (< (+ v_prenex_7 2) c_~N~0))) (< c_main_~i~0 c_~N~0)) (forall ((main_~i~0 Int)) (or (= 1 (select (let ((.cse9 (select |c_#memory_int| c_main_~b~0.base)) (.cse6 (* main_~i~0 8))) (let ((.cse7 (select .cse9 (+ c_main_~b~0.offset .cse6 (- 8)))) (.cse8 (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse6 c_main_~a~0.offset (- 8))))) (let ((.cse5 (store .cse9 (+ c_main_~b~0.offset .cse6) (+ .cse7 .cse8)))) (store .cse5 (+ c_main_~b~0.offset .cse6 8) (+ .cse7 (select (select (store |c_#memory_int| c_main_~b~0.base .cse5) c_main_~a~0.base) (+ .cse6 c_main_~a~0.offset)) .cse8))))) c_main_~b~0.offset)) (< (+ main_~i~0 2) c_~N~0) (<= c_~N~0 (+ main_~i~0 1)))) (or (<= c_~N~0 c_main_~i~0) (< (+ c_main_~i~0 1) c_~N~0) (= 1 (select (let ((.cse10 (select |c_#memory_int| c_main_~b~0.base)) (.cse11 (* c_main_~i~0 8))) (store .cse10 (+ c_main_~b~0.offset .cse11) (+ (select .cse10 (+ c_main_~b~0.offset .cse11 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse11 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-20 14:16:01,094 WARN L193 SmtUtils]: Spent 4.12 s on a formula simplification that was a NOOP. DAG size: 58 [2020-07-20 14:16:25,586 WARN L193 SmtUtils]: Spent 18.68 s on a formula simplification. DAG size of input: 172 DAG size of output: 79 [2020-07-20 14:16:28,160 WARN L193 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 45 [2020-07-20 14:16:35,002 WARN L193 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 162 DAG size of output: 55 [2020-07-20 14:16:37,804 WARN L193 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 164 DAG size of output: 57 [2020-07-20 14:16:40,671 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 62 [2020-07-20 14:16:43,024 WARN L193 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 64 [2020-07-20 14:17:04,673 WARN L193 SmtUtils]: Spent 16.79 s on a formula simplification that was a NOOP. DAG size: 103 [2020-07-20 14:17:11,198 WARN L193 SmtUtils]: Spent 4.28 s on a formula simplification that was a NOOP. DAG size: 92 [2020-07-20 14:17:14,436 WARN L193 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 78 [2020-07-20 14:17:16,695 WARN L193 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 42 [2020-07-20 14:17:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:17:17,174 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2020-07-20 14:17:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-07-20 14:17:17,178 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2020-07-20 14:17:17,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:17:17,179 INFO L225 Difference]: With dead ends: 109 [2020-07-20 14:17:17,180 INFO L226 Difference]: Without dead ends: 107 [2020-07-20 14:17:17,182 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 112.3s TimeCoverageRelationStatistics Valid=509, Invalid=1775, Unknown=12, NotChecked=1010, Total=3306 [2020-07-20 14:17:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-07-20 14:17:17,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 58. [2020-07-20 14:17:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-20 14:17:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2020-07-20 14:17:17,196 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 30 [2020-07-20 14:17:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:17:17,196 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2020-07-20 14:17:17,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-07-20 14:17:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2020-07-20 14:17:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-20 14:17:17,198 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:17:17,198 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:17:17,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:17:17,399 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:17:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:17:17,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1619571715, now seen corresponding path program 4 times [2020-07-20 14:17:17,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:17:17,400 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1674782619] [2020-07-20 14:17:17,400 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:17:17,482 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:17:17,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:17:17,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-20 14:17:17,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:17:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:17:17,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:17:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:17:17,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1674782619] [2020-07-20 14:17:17,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:17:17,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2020-07-20 14:17:17,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523814595] [2020-07-20 14:17:17,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 14:17:17,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:17:17,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 14:17:17,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-20 14:17:17,622 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 12 states. [2020-07-20 14:17:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:17:18,591 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2020-07-20 14:17:18,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-20 14:17:18,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-07-20 14:17:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:17:18,593 INFO L225 Difference]: With dead ends: 131 [2020-07-20 14:17:18,594 INFO L226 Difference]: Without dead ends: 113 [2020-07-20 14:17:18,596 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2020-07-20 14:17:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-07-20 14:17:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 56. [2020-07-20 14:17:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-20 14:17:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-07-20 14:17:18,621 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 30 [2020-07-20 14:17:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:17:18,622 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-07-20 14:17:18,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 14:17:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-20 14:17:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-20 14:17:18,626 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:17:18,626 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:17:18,841 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:17:18,842 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:17:18,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:17:18,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1718620161, now seen corresponding path program 5 times [2020-07-20 14:17:18,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:17:18,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1683304449] [2020-07-20 14:17:18,844 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:17:18,958 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:17:18,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:17:18,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 14:17:18,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:17:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:17:19,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:17:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 14:17:19,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1683304449] [2020-07-20 14:17:19,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:17:19,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-07-20 14:17:19,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837474950] [2020-07-20 14:17:19,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 14:17:19,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:17:19,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 14:17:19,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-07-20 14:17:19,110 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 12 states. [2020-07-20 14:17:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:17:19,854 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2020-07-20 14:17:19,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-20 14:17:19,856 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-20 14:17:19,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:17:19,857 INFO L225 Difference]: With dead ends: 106 [2020-07-20 14:17:19,857 INFO L226 Difference]: Without dead ends: 90 [2020-07-20 14:17:19,861 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2020-07-20 14:17:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-20 14:17:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2020-07-20 14:17:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-20 14:17:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2020-07-20 14:17:19,885 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 32 [2020-07-20 14:17:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:17:19,885 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2020-07-20 14:17:19,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 14:17:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2020-07-20 14:17:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-20 14:17:19,895 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:17:19,895 INFO L422 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, 1, 1, 1] [2020-07-20 14:17:20,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:17:20,109 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:17:20,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:17:20,110 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-20 14:17:20,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:17:20,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [852051463] [2020-07-20 14:17:20,111 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:17:20,210 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:17:20,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-20 14:17:20,210 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 14:17:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 14:17:20,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 14:17:20,282 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 14:17:20,282 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 14:17:20,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:17:20,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 02:17:20 BoogieIcfgContainer [2020-07-20 14:17:20,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 14:17:20,532 INFO L168 Benchmark]: Toolchain (without parser) took 156807.03 ms. Allocated memory was 145.2 MB in the beginning and 280.0 MB in the end (delta: 134.7 MB). Free memory was 101.9 MB in the beginning and 138.1 MB in the end (delta: -36.2 MB). Peak memory consumption was 98.5 MB. Max. memory is 7.1 GB. [2020-07-20 14:17:20,533 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-20 14:17:20,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.73 ms. Allocated memory is still 145.2 MB. Free memory was 101.4 MB in the beginning and 91.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-20 14:17:20,534 INFO L168 Benchmark]: Boogie Preprocessor took 130.93 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 91.1 MB in the beginning and 180.9 MB in the end (delta: -89.8 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-20 14:17:20,534 INFO L168 Benchmark]: RCFGBuilder took 396.91 ms. Allocated memory is still 202.9 MB. Free memory was 180.9 MB in the beginning and 163.8 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. [2020-07-20 14:17:20,535 INFO L168 Benchmark]: TraceAbstraction took 156048.12 ms. Allocated memory was 202.9 MB in the beginning and 280.0 MB in the end (delta: 77.1 MB). Free memory was 163.1 MB in the beginning and 138.1 MB in the end (delta: 25.0 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. [2020-07-20 14:17:20,537 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 223.73 ms. Allocated memory is still 145.2 MB. Free memory was 101.4 MB in the beginning and 91.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.93 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 91.1 MB in the beginning and 180.9 MB in the end (delta: -89.8 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 396.91 ms. Allocated memory is still 202.9 MB. Free memory was 180.9 MB in the beginning and 163.8 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 156048.12 ms. Allocated memory was 202.9 MB in the beginning and 280.0 MB in the end (delta: 77.1 MB). Free memory was 163.1 MB in the beginning and 138.1 MB in the end (delta: 25.0 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=3, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L29] a[0] = 8 [L30] b[0] = 1 [L32] i=1 VAL [\old(N)=0, a={-1:0}, b={1:0}, i=1, malloc(sizeof(long long)*N)={1:0}, malloc(sizeof(long long)*N)={-1:0}, N=2] [L32] COND TRUE i