/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/nla-digbench/geo2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 14:32:30,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 14:32:30,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 14:32:30,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 14:32:30,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 14:32:30,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 14:32:30,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 14:32:30,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 14:32:30,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 14:32:30,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 14:32:30,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 14:32:30,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 14:32:30,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 14:32:30,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 14:32:30,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 14:32:30,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 14:32:30,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 14:32:30,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 14:32:30,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 14:32:30,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 14:32:30,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 14:32:30,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 14:32:30,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 14:32:30,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 14:32:30,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 14:32:30,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 14:32:30,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 14:32:30,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 14:32:30,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 14:32:30,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 14:32:30,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 14:32:30,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 14:32:30,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 14:32:30,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 14:32:30,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 14:32:30,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 14:32:30,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 14:32:30,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 14:32:30,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 14:32:30,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 14:32:30,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 14:32:30,526 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 14:32:30,562 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 14:32:30,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 14:32:30,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 14:32:30,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 14:32:30,567 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 14:32:30,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 14:32:30,567 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 14:32:30,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 14:32:30,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 14:32:30,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 14:32:30,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 14:32:30,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 14:32:30,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 14:32:30,568 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 14:32:30,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 14:32:30,569 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 14:32:30,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 14:32:30,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 14:32:30,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 14:32:30,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 14:32:30,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 14:32:30,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 14:32:30,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 14:32:30,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 14:32:30,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 14:32:30,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 14:32:30,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:32:30,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 14:32:30,572 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 14:32:30,572 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 14:32:30,839 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 14:32:30,852 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 14:32:30,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 14:32:30,856 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 14:32:30,857 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 14:32:30,857 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo2.c [2020-07-21 14:32:30,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83b64daa/475d57c4da6440d4b06d996d78f1919a/FLAG1c9f53cb1 [2020-07-21 14:32:31,356 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 14:32:31,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo2.c [2020-07-21 14:32:31,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83b64daa/475d57c4da6440d4b06d996d78f1919a/FLAG1c9f53cb1 [2020-07-21 14:32:31,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83b64daa/475d57c4da6440d4b06d996d78f1919a [2020-07-21 14:32:31,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 14:32:31,758 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 14:32:31,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 14:32:31,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 14:32:31,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 14:32:31,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:32:31" (1/1) ... [2020-07-21 14:32:31,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ecf0e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:32:31, skipping insertion in model container [2020-07-21 14:32:31,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:32:31" (1/1) ... [2020-07-21 14:32:31,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 14:32:31,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 14:32:31,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 14:32:31,957 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 14:32:31,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 14:32:31,990 INFO L208 MainTranslator]: Completed translation [2020-07-21 14:32:31,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:32:31 WrapperNode [2020-07-21 14:32:31,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 14:32:31,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 14:32:31,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 14:32:31,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 14:32:32,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:32:31" (1/1) ... [2020-07-21 14:32:32,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:32:31" (1/1) ... [2020-07-21 14:32:32,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:32:31" (1/1) ... [2020-07-21 14:32:32,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:32:31" (1/1) ... [2020-07-21 14:32:32,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:32:31" (1/1) ... [2020-07-21 14:32:32,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:32:31" (1/1) ... [2020-07-21 14:32:32,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:32:31" (1/1) ... [2020-07-21 14:32:32,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 14:32:32,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 14:32:32,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 14:32:32,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 14:32:32,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:32:31" (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 14:32:32,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 14:32:32,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 14:32:32,163 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-21 14:32:32,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 14:32:32,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 14:32:32,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 14:32:32,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 14:32:32,163 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-21 14:32:32,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-21 14:32:32,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 14:32:32,164 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 14:32:32,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 14:32:32,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 14:32:32,341 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 14:32:32,341 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-21 14:32:32,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:32:32 BoogieIcfgContainer [2020-07-21 14:32:32,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 14:32:32,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 14:32:32,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 14:32:32,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 14:32:32,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:32:31" (1/3) ... [2020-07-21 14:32:32,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a03f14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:32:32, skipping insertion in model container [2020-07-21 14:32:32,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:32:31" (2/3) ... [2020-07-21 14:32:32,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a03f14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:32:32, skipping insertion in model container [2020-07-21 14:32:32,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:32:32" (3/3) ... [2020-07-21 14:32:32,352 INFO L109 eAbstractionObserver]: Analyzing ICFG geo2.c [2020-07-21 14:32:32,363 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 14:32:32,371 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 14:32:32,386 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 14:32:32,415 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 14:32:32,415 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 14:32:32,415 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 14:32:32,415 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 14:32:32,415 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 14:32:32,415 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 14:32:32,416 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 14:32:32,416 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 14:32:32,448 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-21 14:32:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 14:32:32,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:32:32,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:32:32,465 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:32:32,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:32:32,477 INFO L82 PathProgramCache]: Analyzing trace with hash -64610451, now seen corresponding path program 1 times [2020-07-21 14:32:32,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:32:32,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1462552575] [2020-07-21 14:32:32,502 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 14:32:32,578 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:32:32,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:32:32,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 14:32:32,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:32:32,607 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 14:32:32,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:32:32,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1462552575] [2020-07-21 14:32:32,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:32:32,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 14:32:32,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257147078] [2020-07-21 14:32:32,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 14:32:32,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:32:32,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 14:32:32,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 14:32:32,627 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-21 14:32:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:32:32,647 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-21 14:32:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 14:32:32,648 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-21 14:32:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:32:32,656 INFO L225 Difference]: With dead ends: 35 [2020-07-21 14:32:32,656 INFO L226 Difference]: Without dead ends: 15 [2020-07-21 14:32:32,660 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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 14:32:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-21 14:32:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-21 14:32:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-21 14:32:32,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-21 14:32:32,695 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-21 14:32:32,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:32:32,695 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-21 14:32:32,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 14:32:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-21 14:32:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 14:32:32,696 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:32:32,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:32:32,911 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:32:32,912 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:32:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:32:32,913 INFO L82 PathProgramCache]: Analyzing trace with hash -62822991, now seen corresponding path program 1 times [2020-07-21 14:32:32,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:32:32,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [222856422] [2020-07-21 14:32:32,915 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 14:32:32,946 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:32:32,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:32:32,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 14:32:32,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:32:33,046 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 14:32:33,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:32:33,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [222856422] [2020-07-21 14:32:33,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:32:33,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 14:32:33,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074772127] [2020-07-21 14:32:33,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 14:32:33,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:32:33,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 14:32:33,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 14:32:33,054 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2020-07-21 14:32:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:32:33,117 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-21 14:32:33,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 14:32:33,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-21 14:32:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:32:33,119 INFO L225 Difference]: With dead ends: 25 [2020-07-21 14:32:33,119 INFO L226 Difference]: Without dead ends: 22 [2020-07-21 14:32:33,120 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 14:32:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-21 14:32:33,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-21 14:32:33,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-21 14:32:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-21 14:32:33,128 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2020-07-21 14:32:33,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:32:33,129 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-21 14:32:33,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 14:32:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-21 14:32:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-21 14:32:33,130 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:32:33,130 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:32:33,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:32:33,337 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:32:33,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:32:33,338 INFO L82 PathProgramCache]: Analyzing trace with hash 50868238, now seen corresponding path program 1 times [2020-07-21 14:32:33,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:32:33,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1006952903] [2020-07-21 14:32:33,341 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 14:32:33,392 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:32:33,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:32:33,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-21 14:32:33,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:32:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:32:33,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:32:33,502 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 14:32:37,779 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-07-21 14:32:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:32:37,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1006952903] [2020-07-21 14:32:37,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:32:37,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-21 14:32:37,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408233095] [2020-07-21 14:32:37,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-21 14:32:37,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:32:37,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-21 14:32:37,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=38, Unknown=2, NotChecked=0, Total=56 [2020-07-21 14:32:37,821 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2020-07-21 14:32:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:32:52,236 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-21 14:32:52,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 14:32:52,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-21 14:32:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:32:52,239 INFO L225 Difference]: With dead ends: 32 [2020-07-21 14:32:52,239 INFO L226 Difference]: Without dead ends: 30 [2020-07-21 14:32:52,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=20, Invalid=50, Unknown=2, NotChecked=0, Total=72 [2020-07-21 14:32:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-21 14:32:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-21 14:32:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-21 14:32:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-21 14:32:52,248 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2020-07-21 14:32:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:32:52,249 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-21 14:32:52,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-21 14:32:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-21 14:32:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-21 14:32:52,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:32:52,250 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:32:52,457 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:32:52,462 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:32:52,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:32:52,462 INFO L82 PathProgramCache]: Analyzing trace with hash 325764102, now seen corresponding path program 1 times [2020-07-21 14:32:52,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:32:52,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [529158390] [2020-07-21 14:32:52,463 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 14:32:52,501 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:32:52,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:32:52,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-21 14:32:52,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:32:52,567 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:32:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 14:32:52,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:32:52,777 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-07-21 14:32:52,858 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 14:32:52,859 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 14:32:52,882 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 14:32:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 14:32:52,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [529158390] [2020-07-21 14:32:52,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:32:52,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-07-21 14:32:52,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506548079] [2020-07-21 14:32:52,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 14:32:52,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:32:52,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 14:32:52,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-21 14:32:52,940 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 9 states. [2020-07-21 14:32:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:32:55,156 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-21 14:32:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 14:32:55,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-21 14:32:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:32:55,160 INFO L225 Difference]: With dead ends: 34 [2020-07-21 14:32:55,160 INFO L226 Difference]: Without dead ends: 27 [2020-07-21 14:32:55,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-21 14:32:55,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-21 14:32:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-21 14:32:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-21 14:32:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-21 14:32:55,168 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2020-07-21 14:32:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:32:55,168 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-21 14:32:55,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 14:32:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-21 14:32:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-21 14:32:55,169 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:32:55,169 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:32:55,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:32:55,371 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:32:55,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:32:55,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1538749201, now seen corresponding path program 2 times [2020-07-21 14:32:55,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:32:55,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [35160928] [2020-07-21 14:32:55,374 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 14:32:55,447 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:32:55,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:32:55,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-21 14:32:55,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:33:00,778 WARN L193 SmtUtils]: Spent 3.19 s on a formula simplification that was a NOOP. DAG size: 13 [2020-07-21 14:33:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-21 14:33:00,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:33:00,903 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 14:33:13,532 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-07-21 14:33:13,691 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-07-21 14:33:13,695 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 14:33:13,696 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 14:33:15,744 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0))) (or (= (+ c_main_~z~0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0)) (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse0 1) (+ (* c_main_~y~0 c_main_~z~0) c_main_~x~0))))) is different from true [2020-07-21 14:33:15,750 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 14:33:15,770 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 14:33:17,946 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0)) (+ c_main_~z~0 .cse0))) (= (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~z~0 c_main_~z~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))))) is different from true [2020-07-21 14:33:18,063 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 14:33:18,064 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 14:33:20,429 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_main_~x~0 c_main_~z~0 c_main_~z~0)) (.cse0 (* c_main_~x~0 c_main_~z~0))) (or (not (= (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0)) (+ c_main_~z~0 .cse1))) (= (+ .cse1 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~z~0 c_main_~z~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse0 1) (+ (* c_main_~y~0 c_main_~z~0) c_main_~x~0))))) is different from true [2020-07-21 14:33:20,435 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-07-21 14:33:20,438 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-07-21 14:33:26,618 WARN L860 $PredicateComparison]: unable to prove that (or (not (= 0 |c___VERIFIER_assert_#in~cond|)) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_9 Int)) (let ((.cse3 (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_9))) (let ((.cse2 (+ v_main_~x~0_BEFORE_CALL_11 (* v_main_~y~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_9))) (.cse1 (+ .cse3 1)) (.cse0 (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9))) (or (= (+ (* v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9) (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9)) (+ (* v_main_~y~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9) .cse0)) (= .cse1 .cse2) (= .cse2 .cse1) (not (= (+ (* v_main_~y~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9) .cse3) (+ .cse0 v_main_~z~0_BEFORE_CALL_9)))))))) is different from true [2020-07-21 14:33:36,976 WARN L860 $PredicateComparison]: unable to prove that (or (not (= 0 |c___VERIFIER_assert_#in~cond|)) (= 0 c___VERIFIER_assert_~cond) (forall ((v_main_~x~0_BEFORE_CALL_11 Int) (v_main_~y~0_BEFORE_CALL_11 Int) (v_main_~z~0_BEFORE_CALL_9 Int)) (let ((.cse3 (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_9))) (let ((.cse2 (+ v_main_~x~0_BEFORE_CALL_11 (* v_main_~y~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_9))) (.cse1 (+ .cse3 1)) (.cse0 (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9))) (or (= (+ (* v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9) (* v_main_~x~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9)) (+ (* v_main_~y~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9) .cse0)) (= .cse1 .cse2) (= .cse2 .cse1) (not (= (+ (* v_main_~y~0_BEFORE_CALL_11 v_main_~z~0_BEFORE_CALL_9 v_main_~z~0_BEFORE_CALL_9) .cse3) (+ .cse0 v_main_~z~0_BEFORE_CALL_9)))))))) is different from true [2020-07-21 14:33:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2020-07-21 14:33:36,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [35160928] [2020-07-21 14:33:36,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:33:36,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 18 [2020-07-21 14:33:36,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345217319] [2020-07-21 14:33:36,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-21 14:33:36,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:33:36,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-21 14:33:36,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=123, Unknown=12, NotChecked=130, Total=306 [2020-07-21 14:33:36,994 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 18 states. [2020-07-21 14:33:56,476 WARN L193 SmtUtils]: Spent 12.89 s on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2020-07-21 14:34:07,846 WARN L193 SmtUtils]: Spent 6.69 s on a formula simplification that was a NOOP. DAG size: 14 [2020-07-21 14:34:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:34:21,001 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-21 14:34:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 14:34:21,047 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2020-07-21 14:34:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:34:21,048 INFO L225 Difference]: With dead ends: 37 [2020-07-21 14:34:21,048 INFO L226 Difference]: Without dead ends: 35 [2020-07-21 14:34:21,050 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 52.6s TimeCoverageRelationStatistics Valid=64, Invalid=214, Unknown=14, NotChecked=170, Total=462 [2020-07-21 14:34:21,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-21 14:34:21,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-21 14:34:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-21 14:34:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-21 14:34:21,066 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2020-07-21 14:34:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:34:21,067 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-21 14:34:21,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-21 14:34:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-21 14:34:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-21 14:34:21,068 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:34:21,068 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:34:21,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:34:21,269 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:34:21,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:34:21,270 INFO L82 PathProgramCache]: Analyzing trace with hash -695576914, now seen corresponding path program 3 times [2020-07-21 14:34:21,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:34:21,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [96381133] [2020-07-21 14:34:21,271 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:34:21,377 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:34:21,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:34:21,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-21 14:34:21,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:34:28,336 WARN L193 SmtUtils]: Spent 4.62 s on a formula simplification that was a NOOP. DAG size: 14 [2020-07-21 14:34:29,415 WARN L193 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-07-21 14:34:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-21 14:34:29,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:34:29,497 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 14:34:48,112 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-07-21 14:34:48,319 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-07-21 14:34:48,689 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-07-21 14:34:48,691 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 14:34:48,692 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 14:34:50,771 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0))) (or (= (+ c_main_~z~0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0)) (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse0 1) (+ (* c_main_~y~0 c_main_~z~0) c_main_~x~0))))) is different from true [2020-07-21 14:34:50,774 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 14:34:50,784 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 14:34:56,379 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ c_main_~z~0 .cse0) (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0)))) (= (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~z~0 c_main_~z~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))))) is different from true [2020-07-21 14:34:56,389 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 14:34:58,882 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ (* c_main_~x~0 c_main_~z~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~z~0 c_main_~z~0) .cse0))) (= (+ (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0) .cse0) (+ (* c_main_~z~0 c_main_~z~0 c_main_~z~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))))) is different from true [2020-07-21 14:34:58,896 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 14:34:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 15 not checked. [2020-07-21 14:34:58,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [96381133] [2020-07-21 14:34:58,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:34:58,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2020-07-21 14:34:58,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858236226] [2020-07-21 14:34:58,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 14:34:58,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:34:58,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 14:34:58,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=12, NotChecked=78, Total=272 [2020-07-21 14:34:58,915 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 17 states. [2020-07-21 14:35:03,847 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_main_~x~0 c_main_~z~0))) (and (let ((.cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ c_main_~z~0 .cse0) (+ .cse1 (* c_main_~y~0 c_main_~z~0 c_main_~z~0)))) (= (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~z~0 c_main_~z~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))))) (= c_main_~x~0 (+ c_main_~z~0 1)) (= (+ .cse1 1) (+ (* c_main_~y~0 c_main_~z~0) c_main_~x~0)) (= c_main_~z~0 c_main_~y~0))) is different from false [2020-07-21 14:35:05,877 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ c_main_~z~0 .cse0) (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0)))) (= (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ (* c_main_~z~0 c_main_~z~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))))) (= c_main_~x~0 (+ c_main_~z~0 1)) (= c_main_~z~0 c_main_~y~0)) is different from false [2020-07-21 14:35:07,931 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~z~0 c_main_~z~0))) (and (= (+ c_main_~z~0 .cse0 1) c_main_~x~0) (let ((.cse1 (* c_main_~x~0 c_main_~z~0))) (or (= (+ c_main_~z~0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0)) (+ .cse1 (* c_main_~y~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse1 1) (+ (* c_main_~y~0 c_main_~z~0) c_main_~x~0))))) (= c_main_~y~0 .cse0))) is different from false [2020-07-21 14:35:19,293 WARN L193 SmtUtils]: Spent 10.92 s on a formula simplification that was a NOOP. DAG size: 19 [2020-07-21 14:35:28,633 WARN L193 SmtUtils]: Spent 4.35 s on a formula simplification that was a NOOP. DAG size: 15 [2020-07-21 14:35:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:35:40,234 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2020-07-21 14:35:40,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 14:35:40,240 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2020-07-21 14:35:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:35:40,241 INFO L225 Difference]: With dead ends: 44 [2020-07-21 14:35:40,241 INFO L226 Difference]: Without dead ends: 42 [2020-07-21 14:35:40,242 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 59.2s TimeCoverageRelationStatistics Valid=68, Invalid=246, Unknown=16, NotChecked=222, Total=552 [2020-07-21 14:35:40,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-21 14:35:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-21 14:35:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 14:35:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2020-07-21 14:35:40,250 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 31 [2020-07-21 14:35:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:35:40,251 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2020-07-21 14:35:40,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 14:35:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-07-21 14:35:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-21 14:35:40,252 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:35:40,252 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:35:40,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:35:40,453 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:35:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:35:40,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1264228465, now seen corresponding path program 4 times [2020-07-21 14:35:40,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:35:40,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1169387302] [2020-07-21 14:35:40,454 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:35:40,497 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:35:40,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:35:40,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-21 14:35:40,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:35:51,779 WARN L193 SmtUtils]: Spent 5.93 s on a formula simplification that was a NOOP. DAG size: 21 [2020-07-21 14:36:02,520 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:36:30,035 WARN L193 SmtUtils]: Spent 10.24 s on a formula simplification that was a NOOP. DAG size: 29 [2020-07-21 14:36:30,038 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:36:38,214 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((v_main_~y~0_30 Int) (v_main_~x~0_29 Int) (v_main_~z~0_BEFORE_CALL_17 Int)) (let ((.cse1 (* v_main_~x~0_29 v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17)) (.cse0 (* v_main_~x~0_29 v_main_~z~0_BEFORE_CALL_17))) (and (= (+ .cse0 (* v_main_~y~0_30 v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17)) (+ v_main_~z~0_BEFORE_CALL_17 .cse1)) (not (= (+ (* v_main_~x~0_29 v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17) (* v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17)) (+ (* v_main_~y~0_30 v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17) .cse1))) (= (+ .cse0 1) (+ (* v_main_~y~0_30 v_main_~z~0_BEFORE_CALL_17) v_main_~x~0_29))))) (<= 0 c___VERIFIER_assert_~cond)) (<= 1 c___VERIFIER_assert_~cond)) is different from false [2020-07-21 14:36:40,248 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 14:36:48,417 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~y~0_30 Int) (v_main_~x~0_29 Int) (v_main_~z~0_BEFORE_CALL_17 Int)) (let ((.cse1 (* v_main_~x~0_29 v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17)) (.cse0 (* v_main_~x~0_29 v_main_~z~0_BEFORE_CALL_17))) (and (= (+ .cse0 (* v_main_~y~0_30 v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17)) (+ v_main_~z~0_BEFORE_CALL_17 .cse1)) (not (= (+ (* v_main_~x~0_29 v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17) (* v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17)) (+ (* v_main_~y~0_30 v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17 v_main_~z~0_BEFORE_CALL_17) .cse1))) (= (+ .cse0 1) (+ (* v_main_~y~0_30 v_main_~z~0_BEFORE_CALL_17) v_main_~x~0_29))))) is different from false [2020-07-21 14:36:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 29 proven. 11 refuted. 2 times theorem prover too weak. 14 trivial. 2 not checked. [2020-07-21 14:36:48,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:36:53,273 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 14:37:06,229 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 14:37:06,229 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 14:37:08,272 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0))) (or (= (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0)) (+ c_main_~z~0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse0 1) (+ (* c_main_~y~0 c_main_~z~0) c_main_~x~0))))) is different from true [2020-07-21 14:37:08,276 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 14:37:08,277 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-07-21 14:37:17,213 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0)) (+ c_main_~z~0 .cse0))) (= (+ (* c_main_~z~0 c_main_~z~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))))) is different from false [2020-07-21 14:37:19,261 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~x~0 c_main_~z~0 c_main_~z~0))) (or (not (= (+ (* c_main_~x~0 c_main_~z~0) (* c_main_~y~0 c_main_~z~0 c_main_~z~0)) (+ c_main_~z~0 .cse0))) (= (+ (* c_main_~z~0 c_main_~z~0) (* c_main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ .cse0 (* c_main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))))) is different from true [2020-07-21 14:37:21,621 WARN L193 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 20 [2020-07-21 14:37:24,309 WARN L193 SmtUtils]: Spent 2.69 s on a formula simplification that was a NOOP. DAG size: 20 [2020-07-21 14:37:24,311 INFO L320 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-07-21 14:37:24,312 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 14:37:26,379 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~x~0 Int) (main_~y~0 Int)) (let ((.cse1 (* main_~x~0 c_main_~z~0 c_main_~z~0)) (.cse0 (* main_~x~0 c_main_~z~0))) (or (not (= (+ .cse0 (* main_~y~0 c_main_~z~0 c_main_~z~0)) (+ c_main_~z~0 .cse1))) (= (+ (* c_main_~z~0 c_main_~z~0) (* main_~x~0 c_main_~z~0 c_main_~z~0 c_main_~z~0)) (+ .cse1 (* main_~y~0 c_main_~z~0 c_main_~z~0 c_main_~z~0))) (not (= (+ .cse0 1) (+ (* main_~y~0 c_main_~z~0) main_~x~0)))))) is different from true [2020-07-21 14:37:26,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1169387302] [2020-07-21 14:37:26,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 14:37:26,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-21 14:37:26,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610681968] [2020-07-21 14:37:26,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 14:37:26,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:37:26,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 14:37:26,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=137, Unknown=23, NotChecked=140, Total=342 [2020-07-21 14:37:26,382 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 12 states. [2020-07-21 14:37:36,183 WARN L193 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 38 DAG size of output: 6 [2020-07-21 14:38:26,519 WARN L193 SmtUtils]: Spent 4.42 s on a formula simplification that was a NOOP. DAG size: 26 [2020-07-21 14:40:17,345 WARN L193 SmtUtils]: Spent 1.31 m on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2020-07-21 14:40:37,577 WARN L193 SmtUtils]: Spent 9.39 s on a formula simplification that was a NOOP. DAG size: 31 [2020-07-21 14:40:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:40:45,082 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-07-21 14:40:45,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-21 14:40:45,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2020-07-21 14:40:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:40:45,147 INFO L225 Difference]: With dead ends: 41 [2020-07-21 14:40:45,147 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 14:40:45,148 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 233.5s TimeCoverageRelationStatistics Valid=78, Invalid=277, Unknown=45, NotChecked=200, Total=600 [2020-07-21 14:40:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 14:40:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 14:40:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 14:40:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 14:40:45,150 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-07-21 14:40:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:40:45,150 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 14:40:45,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 14:40:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 14:40:45,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 14:40:45,359 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:40:45,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 14:40:45,667 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2020-07-21 14:41:46,778 WARN L193 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-07-21 14:41:50,977 WARN L193 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 37 DAG size of output: 1 [2020-07-21 14:42:51,783 WARN L193 SmtUtils]: Spent 1.01 m on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-07-21 14:42:51,786 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-21 14:42:51,786 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 14:42:51,786 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 14:42:51,786 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-21 14:42:51,786 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 14:42:51,786 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 14:42:51,786 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 9 11) no Hoare annotation was computed. [2020-07-21 14:42:51,787 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-21 14:42:51,787 INFO L268 CegarLoopResult]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2020-07-21 14:42:51,787 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2020-07-21 14:42:51,787 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (or (and (= 1 main_~x~0) (= 1 main_~y~0)) (let ((.cse0 (* main_~x~0 main_~z~0)) (.cse1 (* main_~x~0 main_~z~0 main_~z~0))) (and (= (+ .cse0 1) (+ main_~x~0 (* main_~y~0 main_~z~0))) (= (+ (* main_~z~0 main_~z~0) (* main_~x~0 main_~z~0 main_~z~0 main_~z~0)) (+ .cse1 (* main_~y~0 main_~z~0 main_~z~0 main_~z~0))) (= main_~x~0 (+ main_~z~0 1)) (= (+ (* main_~y~0 main_~z~0 main_~z~0) .cse0) (+ .cse1 main_~z~0)) (= main_~z~0 main_~y~0))) (and (exists ((v_main_~y~0_30 Int) (v_main_~x~0_29 Int)) (let ((.cse2 (* main_~z~0 v_main_~x~0_29)) (.cse4 (* v_main_~y~0_30 main_~z~0 main_~z~0)) (.cse3 (* main_~z~0 main_~z~0 v_main_~x~0_29))) (and (= (+ (* v_main_~y~0_30 main_~z~0) v_main_~x~0_29) (+ .cse2 1)) (= (+ main_~z~0 .cse3) (+ .cse2 .cse4)) (= main_~y~0 .cse4) (= (+ main_~z~0 .cse3 1) main_~x~0)))) (exists ((v_main_~y~0_30 Int) (v_main_~x~0_29 Int)) (let ((.cse5 (* v_main_~y~0_30 main_~z~0)) (.cse6 (+ (* main_~z~0 v_main_~x~0_29) 1))) (and (= (+ .cse5 v_main_~x~0_29) .cse6) (= .cse5 main_~y~0) (= main_~x~0 .cse6)))))) [2020-07-21 14:42:51,787 INFO L268 CegarLoopResult]: For program point L32-1(lines 31 40) no Hoare annotation was computed. [2020-07-21 14:42:51,787 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 21 43) the Hoare annotation is: true [2020-07-21 14:42:51,788 INFO L264 CegarLoopResult]: At program point L31-2(lines 31 40) the Hoare annotation is: (or (and (= 1 main_~x~0) (= 1 main_~y~0)) (let ((.cse0 (* main_~x~0 main_~z~0)) (.cse1 (* main_~x~0 main_~z~0 main_~z~0))) (and (= (+ .cse0 1) (+ main_~x~0 (* main_~y~0 main_~z~0))) (= (+ (* main_~z~0 main_~z~0) (* main_~x~0 main_~z~0 main_~z~0 main_~z~0)) (+ .cse1 (* main_~y~0 main_~z~0 main_~z~0 main_~z~0))) (= main_~x~0 (+ main_~z~0 1)) (= (+ (* main_~y~0 main_~z~0 main_~z~0) .cse0) (+ .cse1 main_~z~0)) (= main_~z~0 main_~y~0))) (and (exists ((v_main_~y~0_30 Int) (v_main_~x~0_29 Int)) (let ((.cse2 (* main_~z~0 v_main_~x~0_29)) (.cse4 (* v_main_~y~0_30 main_~z~0 main_~z~0)) (.cse3 (* main_~z~0 main_~z~0 v_main_~x~0_29))) (and (= (+ (* v_main_~y~0_30 main_~z~0) v_main_~x~0_29) (+ .cse2 1)) (= (+ main_~z~0 .cse3) (+ .cse2 .cse4)) (= main_~y~0 .cse4) (= (+ main_~z~0 .cse3 1) main_~x~0)))) (exists ((v_main_~y~0_30 Int) (v_main_~x~0_29 Int)) (let ((.cse5 (* v_main_~y~0_30 main_~z~0)) (.cse6 (+ (* main_~z~0 v_main_~x~0_29) 1))) (and (= (+ .cse5 v_main_~x~0_29) .cse6) (= .cse5 main_~y~0) (= main_~x~0 .cse6)))))) [2020-07-21 14:42:51,788 INFO L264 CegarLoopResult]: At program point L31-3(lines 31 40) the Hoare annotation is: (= (+ (* main_~x~0 main_~z~0) 1) (+ main_~x~0 (* main_~y~0 main_~z~0))) [2020-07-21 14:42:51,788 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 21 43) no Hoare annotation was computed. [2020-07-21 14:42:51,788 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 21 43) no Hoare annotation was computed. [2020-07-21 14:42:51,788 INFO L268 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-07-21 14:42:51,788 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2020-07-21 14:42:51,788 INFO L268 CegarLoopResult]: For program point L14(lines 14 15) no Hoare annotation was computed. [2020-07-21 14:42:51,788 INFO L268 CegarLoopResult]: For program point L13(lines 13 16) no Hoare annotation was computed. [2020-07-21 14:42:51,788 INFO L268 CegarLoopResult]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2020-07-21 14:42:51,788 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2020-07-21 14:42:51,789 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-21 14:42:51,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 02:42:51 BoogieIcfgContainer [2020-07-21 14:42:51,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 14:42:51,821 INFO L168 Benchmark]: Toolchain (without parser) took 620063.65 ms. Allocated memory was 140.0 MB in the beginning and 241.7 MB in the end (delta: 101.7 MB). Free memory was 105.1 MB in the beginning and 108.5 MB in the end (delta: -3.5 MB). Peak memory consumption was 98.3 MB. Max. memory is 7.1 GB. [2020-07-21 14:42:51,821 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-21 14:42:51,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.53 ms. Allocated memory is still 140.0 MB. Free memory was 104.6 MB in the beginning and 95.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-21 14:42:51,823 INFO L168 Benchmark]: Boogie Preprocessor took 105.37 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 95.0 MB in the beginning and 183.2 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-21 14:42:51,824 INFO L168 Benchmark]: RCFGBuilder took 247.42 ms. Allocated memory is still 203.9 MB. Free memory was 182.6 MB in the beginning and 170.3 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2020-07-21 14:42:51,825 INFO L168 Benchmark]: TraceAbstraction took 619473.26 ms. Allocated memory was 203.9 MB in the beginning and 241.7 MB in the end (delta: 37.7 MB). Free memory was 170.3 MB in the beginning and 108.5 MB in the end (delta: 61.8 MB). Peak memory consumption was 99.5 MB. Max. memory is 7.1 GB. [2020-07-21 14:42:51,828 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.21 ms. Allocated memory is still 140.0 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 232.53 ms. Allocated memory is still 140.0 MB. Free memory was 104.6 MB in the beginning and 95.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.37 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 95.0 MB in the beginning and 183.2 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 247.42 ms. Allocated memory is still 203.9 MB. Free memory was 182.6 MB in the beginning and 170.3 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 619473.26 ms. Allocated memory was 203.9 MB in the beginning and 241.7 MB in the end (delta: 37.7 MB). Free memory was 170.3 MB in the beginning and 108.5 MB in the end (delta: 61.8 MB). Peak memory consumption was 99.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant [2020-07-21 14:42:51,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] [2020-07-21 14:42:51,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_30,QUANTIFIED] [2020-07-21 14:42:51,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_29,QUANTIFIED] Derived loop invariant: ((1 == x && 1 == y) || ((((x * z + 1 == x + y * z && z * z + x * z * z * z == x * z * z + y * z * z * z) && x == z + 1) && y * z * z + x * z == x * z * z + z) && z == y)) || ((\exists v_main_~y~0_30 : int, v_main_~x~0_29 : int :: ((v_main_~y~0_30 * z + v_main_~x~0_29 == z * v_main_~x~0_29 + 1 && z + z * z * v_main_~x~0_29 == z * v_main_~x~0_29 + v_main_~y~0_30 * z * z) && y == v_main_~y~0_30 * z * z) && z + z * z * v_main_~x~0_29 + 1 == x) && (\exists v_main_~y~0_30 : int, v_main_~x~0_29 : int :: (v_main_~y~0_30 * z + v_main_~x~0_29 == z * v_main_~x~0_29 + 1 && v_main_~y~0_30 * z == y) && x == z * v_main_~x~0_29 + 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 492.9s, OverallIterations: 7, TraceHistogramMax: 5, AutomataDifference: 300.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 126.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 96 SDtfs, 76 SDslu, 392 SDs, 0 SdLazy, 280 SolverSat, 37 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 94.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 184 SyntacticMatches, 17 SemanticMatches, 85 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 350.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 16 PreInvPairs, 28 NumberOfFragments, 280 HoareAnnotationTreeSize, 16 FomulaSimplifications, 554 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 230 FormulaSimplificationTreeSizeReductionInter, 126.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 189.9s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 237 ConstructedInterpolants, 11 QuantifiedInterpolants, 49412 SizeOfPredicates, 26 NumberOfNonLiveVariables, 435 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 110/184 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...