/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 2 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/eqn5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 13:59:41,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 13:59:41,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 13:59:41,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 13:59:41,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 13:59:41,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 13:59:41,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 13:59:41,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 13:59:41,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 13:59:41,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 13:59:41,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 13:59:41,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 13:59:41,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 13:59:41,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 13:59:41,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 13:59:41,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 13:59:41,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 13:59:41,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 13:59:41,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 13:59:41,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 13:59:41,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 13:59:41,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 13:59:41,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 13:59:41,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 13:59:41,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 13:59:41,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 13:59:41,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 13:59:41,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 13:59:41,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 13:59:41,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 13:59:41,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 13:59:41,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 13:59:41,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 13:59:41,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 13:59:41,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 13:59:41,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 13:59:41,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 13:59:41,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 13:59:41,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 13:59:41,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 13:59:41,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 13:59:41,302 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-21 13:59:41,338 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 13:59:41,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 13:59:41,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 13:59:41,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 13:59:41,339 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 13:59:41,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 13:59:41,340 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 13:59:41,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 13:59:41,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 13:59:41,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 13:59:41,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 13:59:41,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 13:59:41,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 13:59:41,346 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 13:59:41,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 13:59:41,347 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 13:59:41,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 13:59:41,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 13:59:41,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 13:59:41,347 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 13:59:41,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 13:59:41,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 13:59:41,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 13:59:41,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 13:59:41,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 13:59:41,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 13:59:41,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 13:59:41,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 13:59:41,350 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 13:59:41,350 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 -> 2 [2020-07-21 13:59:41,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 13:59:41,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 13:59:41,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 13:59:41,676 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 13:59:41,676 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 13:59:41,678 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn5f.c [2020-07-21 13:59:41,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6780b3517/4c5238288f034483abd2dc5db933ff0f/FLAG7205f0019 [2020-07-21 13:59:42,168 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 13:59:42,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn5f.c [2020-07-21 13:59:42,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6780b3517/4c5238288f034483abd2dc5db933ff0f/FLAG7205f0019 [2020-07-21 13:59:42,549 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6780b3517/4c5238288f034483abd2dc5db933ff0f [2020-07-21 13:59:42,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 13:59:42,560 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 13:59:42,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 13:59:42,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 13:59:42,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 13:59:42,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:59:42" (1/1) ... [2020-07-21 13:59:42,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@baf057a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:42, skipping insertion in model container [2020-07-21 13:59:42,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:59:42" (1/1) ... [2020-07-21 13:59:42,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 13:59:42,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 13:59:42,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 13:59:42,816 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 13:59:42,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 13:59:42,878 INFO L208 MainTranslator]: Completed translation [2020-07-21 13:59:42,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:42 WrapperNode [2020-07-21 13:59:42,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 13:59:42,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 13:59:42,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 13:59:42,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 13:59:43,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:42" (1/1) ... [2020-07-21 13:59:43,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:42" (1/1) ... [2020-07-21 13:59:43,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:42" (1/1) ... [2020-07-21 13:59:43,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:42" (1/1) ... [2020-07-21 13:59:43,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:42" (1/1) ... [2020-07-21 13:59:43,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:42" (1/1) ... [2020-07-21 13:59:43,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:42" (1/1) ... [2020-07-21 13:59:43,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 13:59:43,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 13:59:43,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 13:59:43,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 13:59:43,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:42" (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-21 13:59:43,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 13:59:43,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 13:59:43,098 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-21 13:59:43,099 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 13:59:43,099 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 13:59:43,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 13:59:43,099 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-21 13:59:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-21 13:59:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 13:59:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 13:59:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-21 13:59:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 13:59:43,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-21 13:59:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-21 13:59:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-21 13:59:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 13:59:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 13:59:43,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-21 13:59:43,367 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 13:59:43,368 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-21 13:59:43,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:59:43 BoogieIcfgContainer [2020-07-21 13:59:43,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 13:59:43,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 13:59:43,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 13:59:43,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 13:59:43,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:59:42" (1/3) ... [2020-07-21 13:59:43,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20dd5de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:59:43, skipping insertion in model container [2020-07-21 13:59:43,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:59:42" (2/3) ... [2020-07-21 13:59:43,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20dd5de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:59:43, skipping insertion in model container [2020-07-21 13:59:43,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:59:43" (3/3) ... [2020-07-21 13:59:43,381 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn5f.c [2020-07-21 13:59:43,391 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 13:59:43,398 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 13:59:43,412 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 13:59:43,459 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 13:59:43,459 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 13:59:43,459 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 13:59:43,459 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 13:59:43,460 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 13:59:43,460 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 13:59:43,460 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 13:59:43,460 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 13:59:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-21 13:59:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 13:59:43,483 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 13:59:43,483 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-21 13:59:43,484 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 13:59:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 13:59:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-21 13:59:43,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 13:59:43,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [21863146] [2020-07-21 13:59:43,497 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 13:59:43,608 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 13:59:43,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 13:59:43,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 13:59:43,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 13:59:43,638 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-21 13:59:43,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 13:59:43,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [21863146] [2020-07-21 13:59:43,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 13:59:43,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 13:59:43,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367027189] [2020-07-21 13:59:43,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 13:59:43,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 13:59:43,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 13:59:43,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 13:59:43,660 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-21 13:59:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 13:59:43,682 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-21 13:59:43,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 13:59:43,683 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2020-07-21 13:59:43,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 13:59:43,691 INFO L225 Difference]: With dead ends: 58 [2020-07-21 13:59:43,692 INFO L226 Difference]: Without dead ends: 29 [2020-07-21 13:59:43,695 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-21 13:59:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-21 13:59:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-21 13:59:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-21 13:59:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-21 13:59:43,742 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-21 13:59:43,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 13:59:43,743 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-21 13:59:43,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 13:59:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-21 13:59:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 13:59:43,746 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 13:59:43,746 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-21 13:59:43,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 13:59:43,963 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 13:59:43,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 13:59:43,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-21 13:59:43,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 13:59:43,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [771923635] [2020-07-21 13:59:43,967 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 13:59:44,050 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 13:59:44,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 13:59:44,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 13:59:44,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 13:59:44,141 INFO L350 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-07-21 13:59:44,142 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2020-07-21 13:59:44,143 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 13:59:44,149 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 13:59:44,152 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-21 13:59:44,153 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:15 [2020-07-21 13:59:44,206 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 13:59:44,207 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-21 13:59:44,209 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-21 13:59:44,223 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-21 13:59:44,224 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-21 13:59:44,224 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-21 13:59:44,268 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-21 13:59:44,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 13:59:44,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [771923635] [2020-07-21 13:59:44,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 13:59:44,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-21 13:59:44,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839877815] [2020-07-21 13:59:44,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 13:59:44,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 13:59:44,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 13:59:44,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-21 13:59:44,274 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 7 states. [2020-07-21 13:59:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 13:59:44,442 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-21 13:59:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 13:59:44,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-21 13:59:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 13:59:44,447 INFO L225 Difference]: With dead ends: 47 [2020-07-21 13:59:44,447 INFO L226 Difference]: Without dead ends: 45 [2020-07-21 13:59:44,448 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-21 13:59:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-21 13:59:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-07-21 13:59:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-21 13:59:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-21 13:59:44,477 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2020-07-21 13:59:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 13:59:44,478 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-21 13:59:44,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 13:59:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-21 13:59:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 13:59:44,482 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 13:59:44,483 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-21 13:59:44,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 13:59:44,696 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 13:59:44,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 13:59:44,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2104565367, now seen corresponding path program 1 times [2020-07-21 13:59:44,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 13:59:44,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [311926900] [2020-07-21 13:59:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 13:59:44,769 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 13:59:44,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 13:59:44,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 13:59:44,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 13:59:44,818 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-21 13:59:44,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 13:59:44,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [311926900] [2020-07-21 13:59:44,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 13:59:44,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 13:59:44,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643020485] [2020-07-21 13:59:44,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 13:59:44,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 13:59:44,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 13:59:44,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-21 13:59:44,821 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2020-07-21 13:59:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 13:59:44,905 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2020-07-21 13:59:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 13:59:44,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-21 13:59:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 13:59:44,909 INFO L225 Difference]: With dead ends: 71 [2020-07-21 13:59:44,909 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 13:59:44,910 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-21 13:59:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 13:59:44,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2020-07-21 13:59:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-21 13:59:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-21 13:59:44,919 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2020-07-21 13:59:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 13:59:44,919 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-21 13:59:44,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 13:59:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-21 13:59:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 13:59:44,921 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 13:59:44,921 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-21 13:59:45,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 13:59:45,131 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 13:59:45,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 13:59:45,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2011180599, now seen corresponding path program 1 times [2020-07-21 13:59:45,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 13:59:45,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1795383290] [2020-07-21 13:59:45,133 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 13:59:45,178 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 13:59:45,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 13:59:45,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 13:59:45,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 13:59:45,207 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-21 13:59:45,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 13:59:45,249 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-21 13:59:45,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1795383290] [2020-07-21 13:59:45,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 13:59:45,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-21 13:59:45,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544621775] [2020-07-21 13:59:45,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 13:59:45,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 13:59:45,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 13:59:45,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 13:59:45,252 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2020-07-21 13:59:45,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 13:59:45,373 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2020-07-21 13:59:45,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 13:59:45,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-21 13:59:45,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 13:59:45,375 INFO L225 Difference]: With dead ends: 66 [2020-07-21 13:59:45,375 INFO L226 Difference]: Without dead ends: 55 [2020-07-21 13:59:45,376 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-21 13:59:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-21 13:59:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2020-07-21 13:59:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-21 13:59:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-21 13:59:45,385 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2020-07-21 13:59:45,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 13:59:45,385 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-21 13:59:45,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 13:59:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-21 13:59:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 13:59:45,386 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 13:59:45,386 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-21 13:59:45,601 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 13:59:45,602 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 13:59:45,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 13:59:45,602 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-21 13:59:45,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 13:59:45,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [500372295] [2020-07-21 13:59:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 13:59:45,670 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 13:59:45,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 13:59:45,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 13:59:45,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 13:59:45,690 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-21 13:59:45,691 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 13:59:45,696 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 13:59:45,705 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 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-21 13:59:45,706 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 13:59:45,712 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 13:59:45,713 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-21 13:59:45,713 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2020-07-21 13:59:45,768 INFO L350 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2020-07-21 13:59:45,769 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-21 13:59:45,771 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 13:59:45,800 INFO L624 ElimStorePlain]: treesize reduction 24, result has 67.1 percent of original size [2020-07-21 13:59:45,802 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:45,805 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-21 13:59:45,806 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2020-07-21 13:59:45,807 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:45,826 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:45,846 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:45,865 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:45,921 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:45,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 13:59:45,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 13:59:45,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 13:59:45,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 13:59:46,027 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 13:59:46,028 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 95 [2020-07-21 13:59:46,031 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 13:59:46,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 13:59:46,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 13:59:46,127 INFO L350 Elim1Store]: treesize reduction 17, result has 83.7 percent of original size [2020-07-21 13:59:46,128 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 172 [2020-07-21 13:59:46,132 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 13:59:46,273 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2020-07-21 13:59:46,274 INFO L624 ElimStorePlain]: treesize reduction 210, result has 39.5 percent of original size [2020-07-21 13:59:46,282 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2020-07-21 13:59:46,283 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:145, output treesize:137 [2020-07-21 13:59:47,351 WARN L193 SmtUtils]: Spent 1000.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-07-21 13:59:50,429 WARN L193 SmtUtils]: Spent 969.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-07-21 13:59:50,432 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,473 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 13:59:50,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 13:59:50,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 13:59:50,478 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 13:59:50,518 INFO L350 Elim1Store]: treesize reduction 10, result has 82.1 percent of original size [2020-07-21 13:59:50,519 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 62 [2020-07-21 13:59:50,522 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 13:59:50,522 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,527 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 13:59:50,647 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-07-21 13:59:50,648 INFO L350 Elim1Store]: treesize reduction 34, result has 80.9 percent of original size [2020-07-21 13:59:50,649 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 79 treesize of output 163 [2020-07-21 13:59:50,652 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-21 13:59:50,652 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 13:59:50,654 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 13:59:50,655 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 13:59:50,656 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 13:59:50,656 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,657 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 13:59:50,657 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,660 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-21 13:59:50,660 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,661 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-21 13:59:50,661 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 13:59:50,662 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 13:59:50,662 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 13:59:50,663 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 13:59:50,663 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,664 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 13:59:50,665 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,667 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 3, 1] term [2020-07-21 13:59:50,667 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,668 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 3, 1] term [2020-07-21 13:59:50,668 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,671 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,672 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,673 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-21 13:59:50,674 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 3, 1] term [2020-07-21 13:59:50,674 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,675 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-07-21 13:59:50,675 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,677 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 13:59:50,678 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 13:59:50,679 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 13:59:50,679 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,680 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,683 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 13:59:50,683 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,684 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 13:59:50,684 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,686 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,686 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,687 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,689 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,692 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,693 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 3, 1] term [2020-07-21 13:59:50,693 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,694 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-07-21 13:59:50,695 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,696 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 13:59:50,697 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 13:59:50,697 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 13:59:50,698 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 13:59:50,699 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,700 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 13:59:50,700 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,701 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 13:59:50,702 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 13:59:50,703 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,704 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,707 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,708 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,709 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 13:59:50,709 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,710 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 13:59:50,710 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,711 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,713 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,714 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,714 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,719 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-21 13:59:50,719 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 13:59:50,720 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 13:59:50,720 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 13:59:50,721 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 13:59:50,721 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,722 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 13:59:50,722 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,724 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 2, 3, 1] term [2020-07-21 13:59:50,725 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,725 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2020-07-21 13:59:50,726 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 13:59:50,726 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 13:59:50,727 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 13:59:50,727 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 13:59:50,728 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,728 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 13:59:50,729 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,730 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 3, 1] term [2020-07-21 13:59:50,731 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,732 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 3, 1] term [2020-07-21 13:59:50,732 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,734 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,735 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,736 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-21 13:59:50,736 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 3, 1] term [2020-07-21 13:59:50,737 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,738 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-07-21 13:59:50,738 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,739 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 13:59:50,740 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 13:59:50,741 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 13:59:50,741 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,742 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,744 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 13:59:50,745 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,745 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 13:59:50,746 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,747 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,748 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,748 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,749 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,752 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,752 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 3, 1] term [2020-07-21 13:59:50,753 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,754 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 1] term [2020-07-21 13:59:50,754 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,755 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 13:59:50,756 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2020-07-21 13:59:50,756 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 13:59:50,757 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 13:59:50,758 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,759 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 13:59:50,759 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,760 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 13:59:50,761 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 13:59:50,761 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,762 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,765 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,766 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,766 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 13:59:50,767 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,767 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 13:59:50,768 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,769 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,770 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 13:59:50,771 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,771 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 13:59:50,774 INFO L544 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-21 13:59:50,909 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2020-07-21 13:59:50,910 INFO L624 ElimStorePlain]: treesize reduction 82, result has 60.0 percent of original size [2020-07-21 13:59:50,913 INFO L544 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 13:59:50,913 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:165, output treesize:7 [2020-07-21 13:59:50,985 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-21 13:59:50,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 13:59:51,034 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 13:59:51,730 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_26 Int)) (or (< v_main_~i~0_26 1) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* v_main_~i~0_26 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 13:59:53,338 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_main_~i~0_26 Int)) (or (= 1 (select (let ((.cse2 (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (* main_~i~0 8))) (store .cse3 (+ .cse4 c_main_~a~0.offset) (+ (select .cse3 (+ .cse4 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse0 (select (store |c_#memory_int| c_main_~a~0.base .cse2) c_main_~b~0.base)) (.cse1 (* v_main_~i~0_26 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select .cse2 (+ .cse1 c_main_~a~0.offset (- 8))))))) c_main_~b~0.offset)) (< v_main_~i~0_26 1))) is different from false [2020-07-21 13:59:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-07-21 13:59:53,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [500372295] [2020-07-21 13:59:53,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 13:59:53,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-07-21 13:59:53,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303484650] [2020-07-21 13:59:53,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-21 13:59:53,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 13:59:53,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-21 13:59:53,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=149, Unknown=3, NotChecked=50, Total=240 [2020-07-21 13:59:53,367 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 16 states. [2020-07-21 13:59:57,429 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (= (select .cse0 c_main_~b~0.offset) 1) (= 1 (select .cse1 c_main_~a~0.offset)) (forall ((main_~i~0 Int) (v_main_~i~0_26 Int)) (or (= 1 (select (let ((.cse4 (let ((.cse5 (select |c_#memory_int| c_main_~a~0.base)) (.cse6 (* main_~i~0 8))) (store .cse5 (+ .cse6 c_main_~a~0.offset) (+ (select .cse5 (+ .cse6 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse2 (select (store |c_#memory_int| c_main_~a~0.base .cse4) c_main_~b~0.base)) (.cse3 (* v_main_~i~0_26 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))) (select .cse4 (+ .cse3 c_main_~a~0.offset (- 8))))))) c_main_~b~0.offset)) (< v_main_~i~0_26 1))) (not (= c_main_~a~0.base c_main_~b~0.base)) (= 1 (select (let ((.cse7 (* c_main_~i~0 8))) (store .cse0 (+ c_main_~b~0.offset .cse7) (+ (select .cse0 (+ c_main_~b~0.offset .cse7 (- 8))) (select .cse1 (+ .cse7 c_main_~a~0.offset (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 13:59:58,272 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 ((v_main_~i~0_26 Int)) (or (< v_main_~i~0_26 1) (= 1 (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* v_main_~i~0_26 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) (exists ((main_~i~0 Int)) (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base))) (and (or (= 1 (select .cse2 c_main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (let ((.cse3 (* main_~i~0 8))) (= (+ (select .cse2 (+ .cse3 c_main_~a~0.offset (- 8))) 10) (select .cse2 (+ .cse3 c_main_~a~0.offset))))))) (not (= c_main_~a~0.base c_main_~b~0.base))) is different from false [2020-07-21 14:00:01,641 WARN L193 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2020-07-21 14:00:07,775 WARN L193 SmtUtils]: Spent 5.98 s on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2020-07-21 14:00:12,405 WARN L193 SmtUtils]: Spent 4.48 s on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2020-07-21 14:00:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:00:16,114 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2020-07-21 14:00:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 14:00:16,115 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2020-07-21 14:00:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:00:16,116 INFO L225 Difference]: With dead ends: 61 [2020-07-21 14:00:16,116 INFO L226 Difference]: Without dead ends: 59 [2020-07-21 14:00:16,117 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=70, Invalid=247, Unknown=5, NotChecked=140, Total=462 [2020-07-21 14:00:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-21 14:00:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2020-07-21 14:00:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 14:00:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2020-07-21 14:00:16,128 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 26 [2020-07-21 14:00:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:00:16,128 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2020-07-21 14:00:16,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-21 14:00:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2020-07-21 14:00:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-21 14:00:16,129 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:00:16,130 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-21 14:00:16,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:00:16,343 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:00:16,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:00:16,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1048027141, now seen corresponding path program 2 times [2020-07-21 14:00:16,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:00:16,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [235042076] [2020-07-21 14:00:16,346 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:00:16,398 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:00:16,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:00:16,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 14:00:16,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:00:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:00:16,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:00:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:00:16,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [235042076] [2020-07-21 14:00:16,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:00:16,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-21 14:00:16,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688740820] [2020-07-21 14:00:16,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 14:00:16,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:00:16,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 14:00:16,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-21 14:00:16,496 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 9 states. [2020-07-21 14:00:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:00:16,754 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2020-07-21 14:00:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-21 14:00:16,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-07-21 14:00:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:00:16,757 INFO L225 Difference]: With dead ends: 88 [2020-07-21 14:00:16,757 INFO L226 Difference]: Without dead ends: 77 [2020-07-21 14:00:16,758 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-07-21 14:00:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-21 14:00:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 48. [2020-07-21 14:00:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-21 14:00:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2020-07-21 14:00:16,768 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 28 [2020-07-21 14:00:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:00:16,768 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2020-07-21 14:00:16,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 14:00:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2020-07-21 14:00:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 14:00:16,769 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:00:16,770 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] [2020-07-21 14:00:16,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:00:16,984 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:00:16,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:00:16,985 INFO L82 PathProgramCache]: Analyzing trace with hash 913238305, now seen corresponding path program 1 times [2020-07-21 14:00:16,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:00:16,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1217961715] [2020-07-21 14:00:16,987 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:00:17,029 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:00:17,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:00:17,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 14:00:17,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:00:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:00:17,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:00:17,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1217961715] [2020-07-21 14:00:17,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:00:17,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 14:00:17,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326292878] [2020-07-21 14:00:17,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 14:00:17,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:00:17,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 14:00:17,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-21 14:00:17,071 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 6 states. [2020-07-21 14:00:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:00:17,151 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2020-07-21 14:00:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 14:00:17,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-21 14:00:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:00:17,153 INFO L225 Difference]: With dead ends: 73 [2020-07-21 14:00:17,153 INFO L226 Difference]: Without dead ends: 51 [2020-07-21 14:00:17,154 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-21 14:00:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-21 14:00:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2020-07-21 14:00:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 14:00:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-07-21 14:00:17,162 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 30 [2020-07-21 14:00:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:00:17,163 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-07-21 14:00:17,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 14:00:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-21 14:00:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-21 14:00:17,164 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:00:17,164 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-21 14:00:17,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:00:17,377 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:00:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:00:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2071122883, now seen corresponding path program 3 times [2020-07-21 14:00:17,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:00:17,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660744618] [2020-07-21 14:00:17,379 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:00:17,457 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:00:17,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:00:17,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-21 14:00:17,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:00:17,481 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-21 14:00:17,481 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 14:00:17,494 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 14:00:17,503 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 0 case distinctions, treesize of input 27 treesize of output 15 [2020-07-21 14:00:17,504 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 14:00:17,513 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 14:00:17,514 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-21 14:00:17,514 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:28 [2020-07-21 14:00:17,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:17,535 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2020-07-21 14:00:17,536 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 14:00:17,550 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 14:00:17,551 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 14:00:17,551 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:42 [2020-07-21 14:00:17,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:17,657 INFO L350 Elim1Store]: treesize reduction 69, result has 55.8 percent of original size [2020-07-21 14:00:17,657 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 118 [2020-07-21 14:00:17,658 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 14:00:17,718 INFO L624 ElimStorePlain]: treesize reduction 62, result has 50.8 percent of original size [2020-07-21 14:00:17,719 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:00:17,719 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-21 14:00:17,720 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2020-07-21 14:00:17,720 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:00:17,754 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:00:17,776 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:00:17,802 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:00:17,925 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:00:17,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:17,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:17,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:17,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:17,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:17,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,054 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 14:00:18,054 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 122 [2020-07-21 14:00:18,056 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 14:00:18,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,092 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 14:00:18,093 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 111 [2020-07-21 14:00:18,095 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 14:00:18,282 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2020-07-21 14:00:18,283 INFO L624 ElimStorePlain]: treesize reduction 182, result has 44.3 percent of original size [2020-07-21 14:00:18,284 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-21 14:00:18,284 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:153, output treesize:145 [2020-07-21 14:00:18,405 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:00:18,557 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-07-21 14:00:18,557 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:00:18,569 INFO L440 ElimStorePlain]: Different costs {70=[v_prenex_9], 84=[|v_#memory_int_28|]} [2020-07-21 14:00:18,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,658 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 14:00:18,660 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 172 [2020-07-21 14:00:18,662 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 14:00:18,976 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2020-07-21 14:00:18,977 INFO L624 ElimStorePlain]: treesize reduction 151, result has 57.6 percent of original size [2020-07-21 14:00:18,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:18,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:19,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:19,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:19,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:19,035 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 14:00:19,036 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 16 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 181 [2020-07-21 14:00:19,038 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 14:00:19,227 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 80 [2020-07-21 14:00:19,228 INFO L624 ElimStorePlain]: treesize reduction 158, result has 56.0 percent of original size [2020-07-21 14:00:19,232 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2020-07-21 14:00:19,232 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:209, output treesize:201 [2020-07-21 14:00:19,544 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-07-21 14:00:20,398 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-07-21 14:00:20,398 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:00:20,414 INFO L440 ElimStorePlain]: Different costs {85=[v_prenex_13], 99=[|#memory_int|]} [2020-07-21 14:00:20,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,436 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 14:00:20,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,481 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 14:00:20,481 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 10 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 87 [2020-07-21 14:00:20,483 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 14:00:20,484 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 14:00:20,484 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 14:00:20,484 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:00:20,485 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 1] term [2020-07-21 14:00:20,486 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:00:20,486 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-07-21 14:00:20,486 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 14:00:20,487 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-21 14:00:20,487 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:00:20,488 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 14:00:20,643 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2020-07-21 14:00:20,643 INFO L624 ElimStorePlain]: treesize reduction 41, result has 75.4 percent of original size [2020-07-21 14:00:20,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 14:00:20,664 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 14:00:20,698 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 14:00:20,698 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 14 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 89 [2020-07-21 14:00:20,701 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 14:00:20,724 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 14:00:20,726 INFO L544 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 14:00:20,726 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:207, output treesize:7 [2020-07-21 14:00:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:00:20,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:00:20,917 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 14:00:22,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_41 Int)) (or (< v_main_~i~0_41 (+ c_main_~i~0 1)) (= (select (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse1 (* v_main_~i~0_41 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) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset) 1))) is different from false [2020-07-21 14:00:23,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_41 Int)) (or (< v_main_~i~0_41 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* c_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))))))) (.cse1 (* v_main_~i~0_41 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)))) is different from false [2020-07-21 14:00:24,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_42 Int) (v_main_~i~0_41 Int)) (or (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* v_main_~i~0_42 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse3 (- 8))) (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))))))) (.cse1 (* v_main_~i~0_41 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)) (< v_main_~i~0_41 (+ v_main_~i~0_42 1)) (< v_main_~i~0_42 1))) is different from false [2020-07-21 14:00:26,504 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_main_~i~0_42 Int) (v_main_~i~0_41 Int)) (or (= 1 (select (let ((.cse5 (let ((.cse6 (select |c_#memory_int| c_main_~a~0.base)) (.cse7 (* main_~i~0 8))) (store .cse6 (+ .cse7 c_main_~a~0.offset) (+ (select .cse6 (+ .cse7 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base .cse5))) (let ((.cse0 (let ((.cse3 (select .cse2 c_main_~b~0.base)) (.cse4 (* v_main_~i~0_42 8))) (store .cse3 (+ c_main_~b~0.offset .cse4) (+ (select .cse3 (+ c_main_~b~0.offset .cse4 (- 8))) (select .cse5 (+ c_main_~a~0.offset .cse4 (- 8))))))) (.cse1 (* v_main_~i~0_41 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select (store .cse2 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))))) c_main_~b~0.offset)) (< v_main_~i~0_41 (+ v_main_~i~0_42 1)) (< v_main_~i~0_42 1))) is different from false [2020-07-21 14:00:28,534 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_subst_2 Int) (v_main_~i~0_42 Int) (v_main_~i~0_41 Int)) (or (< v_main_~i~0_41 (+ v_main_~i~0_42 1)) (= 1 (select (let ((.cse5 (let ((.cse6 (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))) 10)))) (.cse7 (* v_subst_2 8))) (store .cse6 (+ .cse7 c_main_~a~0.offset) (+ (select .cse6 (+ .cse7 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base .cse5))) (let ((.cse0 (let ((.cse3 (select .cse2 c_main_~b~0.base)) (.cse4 (* v_main_~i~0_42 8))) (store .cse3 (+ c_main_~b~0.offset .cse4) (+ (select .cse3 (+ c_main_~b~0.offset .cse4 (- 8))) (select .cse5 (+ c_main_~a~0.offset .cse4 (- 8))))))) (.cse1 (* v_main_~i~0_41 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store .cse2 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))))) c_main_~b~0.offset)) (< v_main_~i~0_42 1))) is different from false [2020-07-21 14:00:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2020-07-21 14:00:28,565 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660744618] [2020-07-21 14:00:28,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:00:28,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2020-07-21 14:00:28,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533577546] [2020-07-21 14:00:28,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 14:00:28,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:00:28,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 14:00:28,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=225, Unknown=5, NotChecked=170, Total=462 [2020-07-21 14:00:28,567 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 22 states. [2020-07-21 14:00:32,469 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 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) (= 1 c_main_~i~0) (= 0 c_main_~a~0.offset) (forall ((v_subst_2 Int) (v_main_~i~0_42 Int) (v_main_~i~0_41 Int)) (or (< v_main_~i~0_41 (+ v_main_~i~0_42 1)) (= 1 (select (let ((.cse5 (let ((.cse6 (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))) 10)))) (.cse7 (* v_subst_2 8))) (store .cse6 (+ .cse7 c_main_~a~0.offset) (+ (select .cse6 (+ .cse7 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base .cse5))) (let ((.cse0 (let ((.cse3 (select .cse2 c_main_~b~0.base)) (.cse4 (* v_main_~i~0_42 8))) (store .cse3 (+ c_main_~b~0.offset .cse4) (+ (select .cse3 (+ c_main_~b~0.offset .cse4 (- 8))) (select .cse5 (+ c_main_~a~0.offset .cse4 (- 8))))))) (.cse1 (* v_main_~i~0_41 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store .cse2 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))))) c_main_~b~0.offset)) (< v_main_~i~0_42 1))) (not (= c_main_~a~0.base c_main_~b~0.base)) (= c_main_~b~0.offset 0)) is different from false [2020-07-21 14:00:34,158 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse8 (select .cse9 (+ c_main_~a~0.offset 8)))) (and (forall ((main_~i~0 Int) (v_main_~i~0_42 Int) (v_main_~i~0_41 Int)) (or (= 1 (select (let ((.cse5 (let ((.cse6 (select |c_#memory_int| c_main_~a~0.base)) (.cse7 (* main_~i~0 8))) (store .cse6 (+ .cse7 c_main_~a~0.offset) (+ (select .cse6 (+ .cse7 c_main_~a~0.offset (- 8))) 10))))) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base .cse5))) (let ((.cse0 (let ((.cse3 (select .cse2 c_main_~b~0.base)) (.cse4 (* v_main_~i~0_42 8))) (store .cse3 (+ c_main_~b~0.offset .cse4) (+ (select .cse3 (+ c_main_~b~0.offset .cse4 (- 8))) (select .cse5 (+ c_main_~a~0.offset .cse4 (- 8))))))) (.cse1 (* v_main_~i~0_41 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select (select (store .cse2 c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8))) (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8)))))))) c_main_~b~0.offset)) (< v_main_~i~0_41 (+ v_main_~i~0_42 1)) (< v_main_~i~0_42 1))) (= .cse8 (+ (select .cse9 c_main_~a~0.offset) 10)) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (= 0 c_main_~a~0.offset) (= 11 .cse8) (not (= c_main_~a~0.base c_main_~b~0.base)) (= c_main_~b~0.offset 0)))) is different from false [2020-07-21 14:00:35,680 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_42 Int) (v_main_~i~0_41 Int)) (or (= 1 (select (let ((.cse0 (let ((.cse2 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (* v_main_~i~0_42 8))) (store .cse2 (+ c_main_~b~0.offset .cse3) (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse3 (- 8))) (select .cse2 (+ c_main_~b~0.offset .cse3 (- 8))))))) (.cse1 (* v_main_~i~0_41 8))) (store .cse0 (+ c_main_~b~0.offset .cse1) (+ (select .cse0 (+ c_main_~b~0.offset .cse1 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse0) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 (- 8)))))) c_main_~b~0.offset)) (< v_main_~i~0_41 (+ v_main_~i~0_42 1)) (< v_main_~i~0_42 1))) (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1) (exists ((main_~i~0 Int)) (let ((.cse4 (select |c_#memory_int| c_main_~a~0.base))) (and (or (= 1 (select .cse4 c_main_~a~0.offset)) (= 0 (* 8 main_~i~0))) (let ((.cse5 (* main_~i~0 8))) (= (+ (select .cse4 (+ .cse5 c_main_~a~0.offset (- 8))) 10) (select .cse4 (+ .cse5 c_main_~a~0.offset))))))) (= 0 c_main_~a~0.offset) (= 11 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8))) (not (= c_main_~a~0.base c_main_~b~0.base)) (= c_main_~b~0.offset 0)) is different from false [2020-07-21 14:00:37,392 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (= (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset) 1)) (.cse3 (select .cse2 c_main_~a~0.offset)) (.cse1 (= 0 c_main_~a~0.offset)) (.cse4 (= 11 (select .cse2 (+ c_main_~a~0.offset 8)))) (.cse5 (not (= c_main_~a~0.base c_main_~b~0.base))) (.cse6 (= c_main_~b~0.offset 0)) (.cse7 (<= 1 c_main_~i~0))) (or (and .cse0 .cse1 (= (+ (select .cse2 (+ c_main_~a~0.offset (- 8))) 10) .cse3) .cse4 .cse5 .cse6 .cse7) (and .cse0 (= 1 .cse3) .cse1 .cse4 .cse5 .cse6 .cse7)))) (forall ((v_main_~i~0_41 Int)) (or (< v_main_~i~0_41 (+ c_main_~i~0 1)) (= 1 (select (let ((.cse8 (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))))))) (.cse9 (* v_main_~i~0_41 8))) (store .cse8 (+ c_main_~b~0.offset .cse9) (+ (select .cse8 (+ c_main_~b~0.offset .cse9 (- 8))) (select (select (store |c_#memory_int| c_main_~b~0.base .cse8) c_main_~a~0.base) (+ c_main_~a~0.offset .cse9 (- 8)))))) c_main_~b~0.offset))))) is different from false [2020-07-21 14:00:38,952 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse9 (select |c_#memory_int| c_main_~b~0.base)) (.cse3 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (let ((.cse10 (* c_main_~i~0 8))) (= (select .cse9 (+ c_main_~b~0.offset .cse10)) (+ (select .cse9 (+ c_main_~b~0.offset .cse10 (- 8))) (select .cse3 (+ .cse10 c_main_~a~0.offset (- 8))))))) (.cse1 (= (select .cse9 c_main_~b~0.offset) 1)) (.cse4 (select .cse3 c_main_~a~0.offset)) (.cse2 (= 0 c_main_~a~0.offset)) (.cse5 (= 11 (select .cse3 (+ c_main_~a~0.offset 8)))) (.cse6 (not (= c_main_~a~0.base c_main_~b~0.base))) (.cse7 (= c_main_~b~0.offset 0)) (.cse8 (<= 1 c_main_~i~0))) (or (and .cse0 .cse1 .cse2 (= (+ (select .cse3 (+ c_main_~a~0.offset (- 8))) 10) .cse4) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (= 1 .cse4) .cse2 .cse5 .cse6 .cse7 .cse8)))) (forall ((v_main_~i~0_41 Int)) (or (< v_main_~i~0_41 (+ c_main_~i~0 1)) (= (select (let ((.cse11 (select |c_#memory_int| c_main_~b~0.base)) (.cse12 (* v_main_~i~0_41 8))) (store .cse11 (+ c_main_~b~0.offset .cse12) (+ (select .cse11 (+ c_main_~b~0.offset .cse12 (- 8))) (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse12 (- 8)))))) c_main_~b~0.offset) 1)))) is different from false [2020-07-21 14:00:39,803 WARN L193 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 58 [2020-07-21 14:00:41,090 WARN L193 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 105 [2020-07-21 14:00:41,650 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2020-07-21 14:00:42,097 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 108 [2020-07-21 14:00:46,488 WARN L193 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 100 DAG size of output: 100 [2020-07-21 14:00:48,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:00:48,678 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2020-07-21 14:00:48,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-21 14:00:48,680 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2020-07-21 14:00:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:00:48,681 INFO L225 Difference]: With dead ends: 71 [2020-07-21 14:00:48,681 INFO L226 Difference]: Without dead ends: 69 [2020-07-21 14:00:48,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=120, Invalid=416, Unknown=10, NotChecked=510, Total=1056 [2020-07-21 14:00:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-21 14:00:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2020-07-21 14:00:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-21 14:00:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2020-07-21 14:00:48,692 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 30 [2020-07-21 14:00:48,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:00:48,692 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2020-07-21 14:00:48,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 14:00:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2020-07-21 14:00:48,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-21 14:00:48,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:00:48,693 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-21 14:00:48,903 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:00:48,904 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:00:48,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:00:48,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1569644609, now seen corresponding path program 4 times [2020-07-21 14:00:48,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:00:48,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [380348832] [2020-07-21 14:00:48,906 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:00:49,012 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:00:49,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:00:49,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 14:00:49,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:00:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:00:49,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:00:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:00:49,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [380348832] [2020-07-21 14:00:49,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:00:49,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2020-07-21 14:00:49,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4360954] [2020-07-21 14:00:49,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 14:00:49,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:00:49,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 14:00:49,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-07-21 14:00:49,149 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 12 states. [2020-07-21 14:00:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:00:49,584 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2020-07-21 14:00:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-21 14:00:49,585 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-07-21 14:00:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:00:49,586 INFO L225 Difference]: With dead ends: 100 [2020-07-21 14:00:49,586 INFO L226 Difference]: Without dead ends: 89 [2020-07-21 14:00:49,587 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2020-07-21 14:00:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-21 14:00:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 53. [2020-07-21 14:00:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-21 14:00:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-07-21 14:00:49,598 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 32 [2020-07-21 14:00:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:00:49,599 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-07-21 14:00:49,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 14:00:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-07-21 14:00:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-21 14:00:49,600 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:00:49,600 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-21 14:00:49,801 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:00:49,802 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:00:49,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:00:49,803 INFO L82 PathProgramCache]: Analyzing trace with hash 890841693, now seen corresponding path program 1 times [2020-07-21 14:00:49,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:00:49,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [49642624] [2020-07-21 14:00:49,804 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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-21 14:00:49,863 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:00:49,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 14:00:49,863 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 14:00:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 14:00:49,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 14:00:49,904 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 14:00:49,904 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 14:00:50,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:00:50,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 02:00:50 BoogieIcfgContainer [2020-07-21 14:00:50,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 14:00:50,148 INFO L168 Benchmark]: Toolchain (without parser) took 67589.27 ms. Allocated memory was 136.8 MB in the beginning and 288.9 MB in the end (delta: 152.0 MB). Free memory was 101.2 MB in the beginning and 182.2 MB in the end (delta: -81.0 MB). Peak memory consumption was 71.0 MB. Max. memory is 7.1 GB. [2020-07-21 14:00:50,149 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-21 14:00:50,149 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.35 ms. Allocated memory is still 136.8 MB. Free memory was 100.7 MB in the beginning and 90.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-21 14:00:50,150 INFO L168 Benchmark]: Boogie Preprocessor took 161.75 ms. Allocated memory was 136.8 MB in the beginning and 203.4 MB in the end (delta: 66.6 MB). Free memory was 90.5 MB in the beginning and 180.8 MB in the end (delta: -90.3 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-21 14:00:50,150 INFO L168 Benchmark]: RCFGBuilder took 331.48 ms. Allocated memory is still 203.4 MB. Free memory was 180.8 MB in the beginning and 163.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. [2020-07-21 14:00:50,151 INFO L168 Benchmark]: TraceAbstraction took 66772.24 ms. Allocated memory was 203.4 MB in the beginning and 288.9 MB in the end (delta: 85.5 MB). Free memory was 163.3 MB in the beginning and 182.2 MB in the end (delta: -18.9 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. [2020-07-21 14:00:50,153 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.25 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 318.35 ms. Allocated memory is still 136.8 MB. Free memory was 100.7 MB in the beginning and 90.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 161.75 ms. Allocated memory was 136.8 MB in the beginning and 203.4 MB in the end (delta: 66.6 MB). Free memory was 90.5 MB in the beginning and 180.8 MB in the end (delta: -90.3 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 331.48 ms. Allocated memory is still 203.4 MB. Free memory was 180.8 MB in the beginning and 163.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66772.24 ms. Allocated memory was 203.4 MB in the beginning and 288.9 MB in the end (delta: 85.5 MB). Free memory was 163.3 MB in the beginning and 182.2 MB in the end (delta: -18.9 MB). Peak memory consumption was 66.6 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] = 1 [L30] b[0] = 1 [L31] i=1 VAL [\old(N)=0, a={-1:0}, b={-2:0}, i=1, malloc(sizeof(long long)*N)={-2:0}, malloc(sizeof(long long)*N)={-1:0}, N=2] [L31] COND TRUE i