/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 05:03:31,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 05:03:31,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 05:03:31,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 05:03:31,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 05:03:31,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 05:03:31,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 05:03:31,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 05:03:31,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 05:03:31,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 05:03:31,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 05:03:31,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 05:03:31,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 05:03:31,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 05:03:31,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 05:03:31,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 05:03:31,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 05:03:31,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 05:03:31,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 05:03:31,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 05:03:31,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 05:03:31,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 05:03:31,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 05:03:31,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 05:03:31,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 05:03:31,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 05:03:31,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 05:03:31,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 05:03:31,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 05:03:31,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 05:03:31,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 05:03:31,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 05:03:31,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 05:03:31,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 05:03:31,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 05:03:31,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 05:03:31,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 05:03:31,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 05:03:31,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 05:03:31,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 05:03:31,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 05:03:31,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 05:03:31,438 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 05:03:31,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 05:03:31,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 05:03:31,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 05:03:31,444 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 05:03:31,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 05:03:31,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 05:03:31,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 05:03:31,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 05:03:31,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 05:03:31,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 05:03:31,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 05:03:31,446 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 05:03:31,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 05:03:31,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 05:03:31,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 05:03:31,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 05:03:31,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 05:03:31,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 05:03:31,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 05:03:31,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 05:03:31,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 05:03:31,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 05:03:31,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 05:03:31,449 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 05:03:31,449 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 05:03:31,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 05:03:31,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 05:03:31,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 05:03:31,890 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 05:03:31,891 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 05:03:31,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c [2020-12-22 05:03:31,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3820809a6/f3d9eb108bba42f4a98378076eb00da6/FLAG347668e41 [2020-12-22 05:03:32,680 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 05:03:32,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c [2020-12-22 05:03:32,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3820809a6/f3d9eb108bba42f4a98378076eb00da6/FLAG347668e41 [2020-12-22 05:03:33,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3820809a6/f3d9eb108bba42f4a98378076eb00da6 [2020-12-22 05:03:33,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 05:03:33,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 05:03:33,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 05:03:33,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 05:03:33,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 05:03:33,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 05:03:33" (1/1) ... [2020-12-22 05:03:33,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a2578a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 05:03:33, skipping insertion in model container [2020-12-22 05:03:33,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 05:03:33" (1/1) ... [2020-12-22 05:03:33,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 05:03:33,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 05:03:33,290 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c[576,589] [2020-12-22 05:03:33,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 05:03:33,320 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 05:03:33,334 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c[576,589] [2020-12-22 05:03:33,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 05:03:33,360 INFO L208 MainTranslator]: Completed translation [2020-12-22 05:03:33,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 05:03:33 WrapperNode [2020-12-22 05:03:33,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 05:03:33,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 05:03:33,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 05:03:33,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 05:03:33,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 05:03:33" (1/1) ... [2020-12-22 05:03:33,381 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 05:03:33" (1/1) ... [2020-12-22 05:03:33,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 05:03:33,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 05:03:33,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 05:03:33,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 05:03:33,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 05:03:33" (1/1) ... [2020-12-22 05:03:33,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 05:03:33" (1/1) ... [2020-12-22 05:03:33,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 05:03:33" (1/1) ... [2020-12-22 05:03:33,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 05:03:33" (1/1) ... [2020-12-22 05:03:33,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 05:03:33" (1/1) ... [2020-12-22 05:03:33,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 05:03:33" (1/1) ... [2020-12-22 05:03:33,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 05:03:33" (1/1) ... [2020-12-22 05:03:33,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 05:03:33,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 05:03:33,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 05:03:33,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 05:03:33,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 05:03:33" (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-12-22 05:03:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 05:03:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 05:03:33,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 05:03:33,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 05:03:33,856 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 05:03:33,856 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2020-12-22 05:03:33,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 05:03:33 BoogieIcfgContainer [2020-12-22 05:03:33,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 05:03:33,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 05:03:33,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 05:03:33,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 05:03:33,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 05:03:33" (1/3) ... [2020-12-22 05:03:33,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aebe227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 05:03:33, skipping insertion in model container [2020-12-22 05:03:33,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 05:03:33" (2/3) ... [2020-12-22 05:03:33,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aebe227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 05:03:33, skipping insertion in model container [2020-12-22 05:03:33,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 05:03:33" (3/3) ... [2020-12-22 05:03:33,894 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound5.c [2020-12-22 05:03:33,903 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 05:03:33,910 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-12-22 05:03:33,963 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-22 05:03:34,013 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 05:03:34,014 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 05:03:34,014 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 05:03:34,014 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 05:03:34,014 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 05:03:34,014 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 05:03:34,015 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 05:03:34,015 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 05:03:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-12-22 05:03:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 05:03:34,079 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 05:03:34,085 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 05:03:34,086 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 05:03:34,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 05:03:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash 330581779, now seen corresponding path program 1 times [2020-12-22 05:03:34,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 05:03:34,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981203987] [2020-12-22 05:03:34,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 05:03:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 05:03:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 05:03:34,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981203987] [2020-12-22 05:03:34,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 05:03:34,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 05:03:34,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568374669] [2020-12-22 05:03:34,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-22 05:03:34,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 05:03:34,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-22 05:03:34,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-22 05:03:34,388 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2020-12-22 05:03:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 05:03:34,434 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2020-12-22 05:03:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-22 05:03:34,437 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-12-22 05:03:34,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 05:03:34,447 INFO L225 Difference]: With dead ends: 83 [2020-12-22 05:03:34,447 INFO L226 Difference]: Without dead ends: 39 [2020-12-22 05:03:34,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-12-22 05:03:34,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-12-22 05:03:34,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-12-22 05:03:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-12-22 05:03:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-12-22 05:03:34,498 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 11 [2020-12-22 05:03:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 05:03:34,499 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-12-22 05:03:34,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-22 05:03:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-12-22 05:03:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 05:03:34,500 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 05:03:34,500 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 05:03:34,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 05:03:34,504 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 05:03:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 05:03:34,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1507472743, now seen corresponding path program 1 times [2020-12-22 05:03:34,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 05:03:34,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184596439] [2020-12-22 05:03:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 05:03:34,553 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-22 05:03:34,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946208435] [2020-12-22 05:03:34,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 05:03:34,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-22 05:03:34,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 05:03:34,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 05:03:34,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184596439] [2020-12-22 05:03:34,861 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-22 05:03:34,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946208435] [2020-12-22 05:03:34,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 05:03:34,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-22 05:03:34,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571415179] [2020-12-22 05:03:34,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 05:03:34,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 05:03:34,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 05:03:34,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-22 05:03:34,865 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 9 states. [2020-12-22 05:03:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 05:03:35,145 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-12-22 05:03:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 05:03:35,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2020-12-22 05:03:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 05:03:35,147 INFO L225 Difference]: With dead ends: 52 [2020-12-22 05:03:35,147 INFO L226 Difference]: Without dead ends: 50 [2020-12-22 05:03:35,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2020-12-22 05:03:35,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-12-22 05:03:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2020-12-22 05:03:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-22 05:03:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2020-12-22 05:03:35,157 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 11 [2020-12-22 05:03:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 05:03:35,158 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2020-12-22 05:03:35,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 05:03:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2020-12-22 05:03:35,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-22 05:03:35,159 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 05:03:35,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 05:03:35,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-22 05:03:35,375 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 05:03:35,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 05:03:35,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1277171076, now seen corresponding path program 1 times [2020-12-22 05:03:35,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 05:03:35,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961779378] [2020-12-22 05:03:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 05:03:35,395 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-22 05:03:35,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [215394072] [2020-12-22 05:03:35,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 05:03:35,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-22 05:03:35,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 05:03:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 05:03:35,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961779378] [2020-12-22 05:03:35,630 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-22 05:03:35,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215394072] [2020-12-22 05:03:35,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 05:03:35,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 05:03:35,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258363012] [2020-12-22 05:03:35,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 05:03:35,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 05:03:35,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 05:03:35,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-12-22 05:03:35,633 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 10 states. [2020-12-22 05:03:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 05:03:36,063 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2020-12-22 05:03:36,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 05:03:36,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2020-12-22 05:03:36,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 05:03:36,068 INFO L225 Difference]: With dead ends: 70 [2020-12-22 05:03:36,068 INFO L226 Difference]: Without dead ends: 60 [2020-12-22 05:03:36,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-12-22 05:03:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-12-22 05:03:36,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2020-12-22 05:03:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-22 05:03:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2020-12-22 05:03:36,093 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 13 [2020-12-22 05:03:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 05:03:36,093 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2020-12-22 05:03:36,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 05:03:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-12-22 05:03:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 05:03:36,095 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 05:03:36,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 05:03:36,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:36,310 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 05:03:36,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 05:03:36,312 INFO L82 PathProgramCache]: Analyzing trace with hash 916732292, now seen corresponding path program 1 times [2020-12-22 05:03:36,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 05:03:36,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026628833] [2020-12-22 05:03:36,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 05:03:36,329 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-22 05:03:36,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625923577] [2020-12-22 05:03:36,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 05:03:36,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-22 05:03:36,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 05:03:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 05:03:36,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026628833] [2020-12-22 05:03:36,453 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-22 05:03:36,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625923577] [2020-12-22 05:03:36,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 05:03:36,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 05:03:36,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008271660] [2020-12-22 05:03:36,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 05:03:36,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 05:03:36,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 05:03:36,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 05:03:36,455 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2020-12-22 05:03:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 05:03:36,596 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2020-12-22 05:03:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 05:03:36,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-22 05:03:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 05:03:36,598 INFO L225 Difference]: With dead ends: 95 [2020-12-22 05:03:36,598 INFO L226 Difference]: Without dead ends: 89 [2020-12-22 05:03:36,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 05:03:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-12-22 05:03:36,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2020-12-22 05:03:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-12-22 05:03:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2020-12-22 05:03:36,612 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 16 [2020-12-22 05:03:36,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 05:03:36,612 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2020-12-22 05:03:36,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 05:03:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2020-12-22 05:03:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 05:03:36,613 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 05:03:36,613 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 05:03:36,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:36,827 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 05:03:36,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 05:03:36,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1552659725, now seen corresponding path program 1 times [2020-12-22 05:03:36,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 05:03:36,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380825818] [2020-12-22 05:03:36,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 05:03:36,845 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-22 05:03:36,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967591784] [2020-12-22 05:03:36,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 05:03:36,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-22 05:03:36,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 05:03:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 05:03:37,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380825818] [2020-12-22 05:03:37,182 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-22 05:03:37,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967591784] [2020-12-22 05:03:37,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-22 05:03:37,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-12-22 05:03:37,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41915402] [2020-12-22 05:03:37,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 05:03:37,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 05:03:37,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 05:03:37,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-22 05:03:37,185 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 12 states. [2020-12-22 05:03:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 05:03:37,977 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2020-12-22 05:03:37,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 05:03:37,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-12-22 05:03:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 05:03:37,979 INFO L225 Difference]: With dead ends: 181 [2020-12-22 05:03:37,979 INFO L226 Difference]: Without dead ends: 175 [2020-12-22 05:03:37,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2020-12-22 05:03:37,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-12-22 05:03:37,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 103. [2020-12-22 05:03:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-22 05:03:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2020-12-22 05:03:38,000 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 25 [2020-12-22 05:03:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 05:03:38,001 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2020-12-22 05:03:38,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 05:03:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2020-12-22 05:03:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 05:03:38,002 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 05:03:38,002 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 05:03:38,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:38,217 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 05:03:38,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 05:03:38,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1755069467, now seen corresponding path program 1 times [2020-12-22 05:03:38,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 05:03:38,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935266408] [2020-12-22 05:03:38,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 05:03:38,250 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-22 05:03:38,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [926862166] [2020-12-22 05:03:38,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 05:03:38,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-22 05:03:38,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 05:03:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 05:03:38,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935266408] [2020-12-22 05:03:38,498 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-22 05:03:38,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926862166] [2020-12-22 05:03:38,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-22 05:03:38,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-12-22 05:03:38,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456807676] [2020-12-22 05:03:38,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 05:03:38,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 05:03:38,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 05:03:38,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-22 05:03:38,501 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand 9 states. [2020-12-22 05:03:38,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 05:03:38,941 INFO L93 Difference]: Finished difference Result 181 states and 210 transitions. [2020-12-22 05:03:38,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 05:03:38,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-12-22 05:03:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 05:03:38,944 INFO L225 Difference]: With dead ends: 181 [2020-12-22 05:03:38,944 INFO L226 Difference]: Without dead ends: 109 [2020-12-22 05:03:38,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2020-12-22 05:03:38,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-12-22 05:03:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2020-12-22 05:03:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-22 05:03:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2020-12-22 05:03:38,963 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 26 [2020-12-22 05:03:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 05:03:38,964 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2020-12-22 05:03:38,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 05:03:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2020-12-22 05:03:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-22 05:03:38,965 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 05:03:38,965 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 05:03:39,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-22 05:03:39,181 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 05:03:39,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 05:03:39,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1828677220, now seen corresponding path program 2 times [2020-12-22 05:03:39,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 05:03:39,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832862396] [2020-12-22 05:03:39,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 05:03:39,202 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-22 05:03:39,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801343655] [2020-12-22 05:03:39,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:39,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 05:03:39,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 05:03:39,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-22 05:03:39,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 05:03:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 05:03:39,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832862396] [2020-12-22 05:03:39,564 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-22 05:03:39,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801343655] [2020-12-22 05:03:39,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-22 05:03:39,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-12-22 05:03:39,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047452139] [2020-12-22 05:03:39,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 05:03:39,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 05:03:39,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 05:03:39,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-12-22 05:03:39,566 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 13 states. [2020-12-22 05:03:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 05:03:40,410 INFO L93 Difference]: Finished difference Result 191 states and 219 transitions. [2020-12-22 05:03:40,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 05:03:40,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-12-22 05:03:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 05:03:40,413 INFO L225 Difference]: With dead ends: 191 [2020-12-22 05:03:40,414 INFO L226 Difference]: Without dead ends: 140 [2020-12-22 05:03:40,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2020-12-22 05:03:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-12-22 05:03:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 78. [2020-12-22 05:03:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-12-22 05:03:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2020-12-22 05:03:40,452 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 34 [2020-12-22 05:03:40,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 05:03:40,453 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2020-12-22 05:03:40,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 05:03:40,455 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2020-12-22 05:03:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 05:03:40,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 05:03:40,457 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 05:03:40,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:40,659 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 05:03:40,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 05:03:40,659 INFO L82 PathProgramCache]: Analyzing trace with hash -797667638, now seen corresponding path program 1 times [2020-12-22 05:03:40,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 05:03:40,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372333044] [2020-12-22 05:03:40,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 05:03:40,675 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-22 05:03:40,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189339883] [2020-12-22 05:03:40,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 05:03:40,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 46 conjunts are in the unsatisfiable core [2020-12-22 05:03:40,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 05:03:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 05:03:41,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372333044] [2020-12-22 05:03:41,309 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-22 05:03:41,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189339883] [2020-12-22 05:03:41,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-22 05:03:41,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-12-22 05:03:41,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669772341] [2020-12-22 05:03:41,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 05:03:41,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 05:03:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 05:03:41,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2020-12-22 05:03:41,311 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 16 states. [2020-12-22 05:03:42,307 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2020-12-22 05:03:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 05:03:42,829 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2020-12-22 05:03:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-22 05:03:42,830 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2020-12-22 05:03:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 05:03:42,831 INFO L225 Difference]: With dead ends: 123 [2020-12-22 05:03:42,831 INFO L226 Difference]: Without dead ends: 113 [2020-12-22 05:03:42,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2020-12-22 05:03:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-12-22 05:03:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2020-12-22 05:03:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-12-22 05:03:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2020-12-22 05:03:42,848 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 35 [2020-12-22 05:03:42,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 05:03:42,849 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2020-12-22 05:03:42,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 05:03:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2020-12-22 05:03:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-22 05:03:42,850 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 05:03:42,850 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 05:03:43,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:43,064 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 05:03:43,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 05:03:43,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1074581755, now seen corresponding path program 2 times [2020-12-22 05:03:43,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 05:03:43,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224473848] [2020-12-22 05:03:43,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 05:03:43,082 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-22 05:03:43,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113906845] [2020-12-22 05:03:43,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:43,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 05:03:43,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 05:03:43,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-22 05:03:43,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 05:03:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 05:03:43,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224473848] [2020-12-22 05:03:43,597 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-22 05:03:43,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113906845] [2020-12-22 05:03:43,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-22 05:03:43,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-12-22 05:03:43,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858636469] [2020-12-22 05:03:43,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 05:03:43,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 05:03:43,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 05:03:43,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-12-22 05:03:43,606 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 14 states. [2020-12-22 05:03:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 05:03:44,550 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2020-12-22 05:03:44,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 05:03:44,551 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2020-12-22 05:03:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 05:03:44,551 INFO L225 Difference]: With dead ends: 152 [2020-12-22 05:03:44,552 INFO L226 Difference]: Without dead ends: 142 [2020-12-22 05:03:44,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2020-12-22 05:03:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-12-22 05:03:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 109. [2020-12-22 05:03:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-12-22 05:03:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2020-12-22 05:03:44,570 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 44 [2020-12-22 05:03:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 05:03:44,587 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2020-12-22 05:03:44,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 05:03:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2020-12-22 05:03:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-22 05:03:44,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 05:03:44,589 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 05:03:44,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-12-22 05:03:44,803 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 05:03:44,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 05:03:44,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1128629901, now seen corresponding path program 3 times [2020-12-22 05:03:44,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 05:03:44,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733693873] [2020-12-22 05:03:44,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 05:03:44,823 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-22 05:03:44,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683564980] [2020-12-22 05:03:44,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:44,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-12-22 05:03:44,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 05:03:44,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-22 05:03:44,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 05:03:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-22 05:03:45,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733693873] [2020-12-22 05:03:45,131 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-22 05:03:45,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683564980] [2020-12-22 05:03:45,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-22 05:03:45,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-12-22 05:03:45,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23682795] [2020-12-22 05:03:45,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 05:03:45,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 05:03:45,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 05:03:45,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-12-22 05:03:45,133 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 10 states. [2020-12-22 05:03:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 05:03:49,553 INFO L93 Difference]: Finished difference Result 156 states and 174 transitions. [2020-12-22 05:03:49,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 05:03:49,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2020-12-22 05:03:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 05:03:49,556 INFO L225 Difference]: With dead ends: 156 [2020-12-22 05:03:49,556 INFO L226 Difference]: Without dead ends: 105 [2020-12-22 05:03:49,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-12-22 05:03:49,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-12-22 05:03:49,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2020-12-22 05:03:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-22 05:03:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2020-12-22 05:03:49,581 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 48 [2020-12-22 05:03:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 05:03:49,581 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2020-12-22 05:03:49,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 05:03:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2020-12-22 05:03:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-22 05:03:49,583 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 05:03:49,584 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 05:03:49,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:49,785 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 05:03:49,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 05:03:49,786 INFO L82 PathProgramCache]: Analyzing trace with hash -413997928, now seen corresponding path program 4 times [2020-12-22 05:03:49,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 05:03:49,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965144354] [2020-12-22 05:03:49,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 05:03:49,800 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-22 05:03:49,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719939549] [2020-12-22 05:03:49,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:49,871 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-22 05:03:49,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 05:03:49,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-22 05:03:49,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 05:03:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 37 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 05:03:49,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965144354] [2020-12-22 05:03:49,987 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-22 05:03:49,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719939549] [2020-12-22 05:03:49,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-22 05:03:49,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-12-22 05:03:49,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065048076] [2020-12-22 05:03:49,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 05:03:49,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 05:03:49,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 05:03:49,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-22 05:03:49,989 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 7 states. [2020-12-22 05:03:50,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 05:03:50,153 INFO L93 Difference]: Finished difference Result 189 states and 196 transitions. [2020-12-22 05:03:50,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 05:03:50,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2020-12-22 05:03:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 05:03:50,154 INFO L225 Difference]: With dead ends: 189 [2020-12-22 05:03:50,155 INFO L226 Difference]: Without dead ends: 123 [2020-12-22 05:03:50,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-22 05:03:50,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-22 05:03:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 115. [2020-12-22 05:03:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-12-22 05:03:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2020-12-22 05:03:50,177 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 57 [2020-12-22 05:03:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 05:03:50,177 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2020-12-22 05:03:50,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 05:03:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2020-12-22 05:03:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-22 05:03:50,179 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 05:03:50,179 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 05:03:50,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:50,393 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 05:03:50,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 05:03:50,394 INFO L82 PathProgramCache]: Analyzing trace with hash 300678153, now seen corresponding path program 5 times [2020-12-22 05:03:50,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 05:03:50,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45859537] [2020-12-22 05:03:50,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 05:03:50,422 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-22 05:03:50,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083364635] [2020-12-22 05:03:50,423 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 05:03:50,500 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2020-12-22 05:03:50,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 05:03:50,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-22 05:03:50,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 05:03:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 05:03:50,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45859537] [2020-12-22 05:03:50,797 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-22 05:03:50,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083364635] [2020-12-22 05:03:50,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-12-22 05:03:50,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-12-22 05:03:50,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916006420] [2020-12-22 05:03:50,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 05:03:50,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 05:03:50,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 05:03:50,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-22 05:03:50,799 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 12 states. [2020-12-22 05:03:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 05:03:51,346 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2020-12-22 05:03:51,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-22 05:03:51,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2020-12-22 05:03:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 05:03:51,348 INFO L225 Difference]: With dead ends: 115 [2020-12-22 05:03:51,348 INFO L226 Difference]: Without dead ends: 0 [2020-12-22 05:03:51,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-12-22 05:03:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-22 05:03:51,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-22 05:03:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-22 05:03:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-22 05:03:51,350 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2020-12-22 05:03:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 05:03:51,350 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-22 05:03:51,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 05:03:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-22 05:03:51,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-22 05:03:51,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-22 05:03:51,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-22 05:03:51,714 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2020-12-22 05:03:52,609 WARN L197 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2020-12-22 05:03:53,043 WARN L197 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2020-12-22 05:03:53,459 WARN L197 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2020-12-22 05:03:54,063 WARN L197 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2020-12-22 05:03:54,450 WARN L197 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2020-12-22 05:03:54,656 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 29 [2020-12-22 05:03:55,261 WARN L197 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 64 [2020-12-22 05:03:55,653 WARN L197 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2020-12-22 05:03:55,657 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-22 05:03:55,658 INFO L189 CegarLoopUtils]: For program point L11(lines 11 13) no Hoare annotation was computed. [2020-12-22 05:03:55,658 INFO L189 CegarLoopUtils]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2020-12-22 05:03:55,658 INFO L189 CegarLoopUtils]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2020-12-22 05:03:55,658 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-22 05:03:55,658 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-22 05:03:55,658 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-22 05:03:55,658 INFO L189 CegarLoopUtils]: For program point L12(line 12) no Hoare annotation was computed. [2020-12-22 05:03:55,658 INFO L189 CegarLoopUtils]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-12-22 05:03:55,658 INFO L189 CegarLoopUtils]: For program point L12-4(line 12) no Hoare annotation was computed. [2020-12-22 05:03:55,659 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-22 05:03:55,659 INFO L185 CegarLoopUtils]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse3 (* ULTIMATE.start_main_~y~0 4)) (.cse6 (<= 1 ULTIMATE.start_main_~y~0)) (.cse7 (<= ULTIMATE.start_main_~y~0 5)) (.cse8 (<= 0 ULTIMATE.start_main_~x~0))) (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (let ((.cse10 (<= ULTIMATE.start_main_~r~0 5))) (or (and .cse6 .cse7 .cse10 (= ULTIMATE.start_main_~a~0 2) .cse8 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2))) (and .cse6 (= ULTIMATE.start_main_~b~0 .cse3) (<= (* 4 ULTIMATE.start_main_~y~0) 5) .cse10 .cse8 (= ULTIMATE.start_main_~a~0 4)) (and .cse6 (= ULTIMATE.start_main_~a~0 1) .cse7 .cse10 .cse8 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))) (.cse2 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse4 (<= ULTIMATE.start_main_~x~0 5))) (or (and .cse0 .cse1 (<= 0 ULTIMATE.start_main_~r~0) .cse2 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse3)) .cse4 (= ULTIMATE.start_main_~q~0 4)) (let ((.cse5 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse5)) (<= .cse5 ULTIMATE.start_main_~x~0) .cse0 (< (+ (* 2 ULTIMATE.start_main_~r~0) .cse5) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)) .cse1 .cse2 .cse4)) (and .cse6 .cse7 .cse8 (= ULTIMATE.start_main_~a~0 0) (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse2 .cse4 (= ULTIMATE.start_main_~b~0 0)) (let ((.cse9 (* 2 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~q~0) .cse0 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~b~0)) (<= ULTIMATE.start_main_~b~0 .cse9) .cse1 (< ULTIMATE.start_main_~x~0 (* 2 ULTIMATE.start_main_~b~0)) .cse2 .cse4 (<= .cse9 ULTIMATE.start_main_~x~0)))))) [2020-12-22 05:03:55,659 INFO L189 CegarLoopUtils]: For program point L38-3(lines 38 62) no Hoare annotation was computed. [2020-12-22 05:03:55,659 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-22 05:03:55,660 INFO L185 CegarLoopUtils]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse4 (* 2 ULTIMATE.start_main_~y~0)) (.cse8 (= ULTIMATE.start_main_~a~0 1)) (.cse9 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse10 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0)) (.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse7 (* ULTIMATE.start_main_~y~0 4)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse3 (= ULTIMATE.start_main_~q~0 0)) (.cse5 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse6 (<= ULTIMATE.start_main_~x~0 5))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~a~0 2) .cse2 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse3 (<= .cse4 ULTIMATE.start_main_~r~0) .cse5 .cse6) (and (or (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse4)) (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0) .cse5 .cse6) (and .cse0 .cse5 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse7)) .cse6 (= ULTIMATE.start_main_~q~0 4))) .cse8 .cse1 .cse9 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse9 .cse10 .cse6) (and .cse0 (<= (* 4 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (= ULTIMATE.start_main_~b~0 .cse7) .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~a~0 4) .cse5 .cse6))) [2020-12-22 05:03:55,660 INFO L189 CegarLoopUtils]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2020-12-22 05:03:55,660 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-22 05:03:55,660 INFO L189 CegarLoopUtils]: For program point L15(lines 15 18) no Hoare annotation was computed. [2020-12-22 05:03:55,660 INFO L185 CegarLoopUtils]: At program point L15-2(lines 14 20) the Hoare annotation is: (let ((.cse9 (* ULTIMATE.start_main_~y~0 4)) (.cse4 (<= 1 ULTIMATE.start_main_~y~0)) (.cse5 (<= ULTIMATE.start_main_~y~0 5)) (.cse6 (<= 0 ULTIMATE.start_main_~x~0)) (.cse7 (= ULTIMATE.start_assume_abort_if_not_~cond 1))) (let ((.cse1 (* 2 ULTIMATE.start_main_~r~0)) (.cse0 (let ((.cse10 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse11 (<= ULTIMATE.start_main_~r~0 5))) (or (and .cse4 .cse5 .cse10 .cse11 (= ULTIMATE.start_main_~a~0 2) .cse6 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse7) (and .cse4 (= ULTIMATE.start_main_~b~0 .cse9) (<= (* 4 ULTIMATE.start_main_~y~0) 5) .cse10 .cse11 .cse6 .cse7 (= ULTIMATE.start_main_~a~0 4)) (and .cse4 (= ULTIMATE.start_main_~a~0 1) .cse5 .cse10 .cse11 .cse6 .cse7 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))) (.cse3 (<= ULTIMATE.start_main_~x~0 5))) (or (let ((.cse2 (* 2 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~q~0) .cse0 (< .cse1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~b~0)) (<= ULTIMATE.start_main_~b~0 .cse2) .cse3 (<= .cse2 ULTIMATE.start_main_~x~0))) (and .cse4 .cse5 .cse6 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse7 .cse3) (let ((.cse8 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse8)) .cse0 (<= .cse8 ULTIMATE.start_main_~x~0) (< (+ .cse1 .cse8) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)) .cse3)) (and .cse0 (<= 0 ULTIMATE.start_main_~r~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse9)) .cse3 (= ULTIMATE.start_main_~q~0 4))))) [2020-12-22 05:03:55,660 INFO L189 CegarLoopUtils]: For program point L15-3(lines 15 18) no Hoare annotation was computed. [2020-12-22 05:03:55,661 INFO L185 CegarLoopUtils]: At program point L15-5(lines 42 43) the Hoare annotation is: (let ((.cse5 (* ULTIMATE.start_main_~y~0 4)) (.cse7 (<= 1 ULTIMATE.start_main_~y~0)) (.cse8 (<= ULTIMATE.start_main_~y~0 5)) (.cse9 (<= 0 ULTIMATE.start_main_~x~0))) (let ((.cse6 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse0 (* 2 ULTIMATE.start_main_~r~0)) (.cse2 (let ((.cse11 (<= ULTIMATE.start_main_~r~0 5))) (or (and .cse7 .cse8 .cse11 (= ULTIMATE.start_main_~a~0 2) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2))) (and .cse7 (= ULTIMATE.start_main_~b~0 .cse5) (<= (* 4 ULTIMATE.start_main_~y~0) 5) .cse11 (= ULTIMATE.start_main_~a~0 4)) (and .cse7 .cse8 (= ULTIMATE.start_main_~a~0 1) .cse11 .cse9 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))) (.cse3 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse4 (<= ULTIMATE.start_main_~x~0 5))) (or (and (or (let ((.cse1 (* 2 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~q~0) (< .cse0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~b~0)) (<= ULTIMATE.start_main_~b~0 .cse1) .cse2 .cse3 .cse4 (<= .cse1 ULTIMATE.start_main_~x~0))) (and .cse2 (<= 0 ULTIMATE.start_main_~r~0) .cse3 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse5)) .cse4 (= ULTIMATE.start_main_~q~0 4))) .cse6) (and .cse7 .cse8 .cse6 .cse9 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0) .cse3 .cse4) (let ((.cse10 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse10)) (<= .cse10 ULTIMATE.start_main_~x~0) .cse6 (< (+ .cse0 .cse10) (+ ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0)) .cse9 .cse2 .cse3 .cse4))))) [2020-12-22 05:03:55,662 INFO L189 CegarLoopUtils]: For program point L15-6(lines 15 18) no Hoare annotation was computed. [2020-12-22 05:03:55,662 INFO L185 CegarLoopUtils]: At program point L15-8(lines 14 20) the Hoare annotation is: (let ((.cse4 (* 2 ULTIMATE.start_main_~y~0)) (.cse7 (= ULTIMATE.start_main_~a~0 1)) (.cse9 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse10 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0)) (.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse8 (* ULTIMATE.start_main_~y~0 4)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse3 (= ULTIMATE.start_main_~q~0 0)) (.cse5 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse6 (<= ULTIMATE.start_main_~x~0 5))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~a~0 2) .cse2 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse3 (<= .cse4 ULTIMATE.start_main_~r~0) .cse5 .cse6) (and (or (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse4)) .cse7 .cse1 (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0) .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse5 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse8)) .cse6 (= ULTIMATE.start_main_~q~0 4))) .cse9 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse3 .cse5 .cse9 .cse10 .cse6) (and .cse0 (<= (* 4 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (= ULTIMATE.start_main_~b~0 .cse8) .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~a~0 4) .cse5 .cse6))) [2020-12-22 05:03:55,662 INFO L189 CegarLoopUtils]: For program point L15-9(lines 15 18) no Hoare annotation was computed. [2020-12-22 05:03:55,663 INFO L185 CegarLoopUtils]: At program point L15-11(lines 14 20) the Hoare annotation is: (let ((.cse4 (* 2 ULTIMATE.start_main_~y~0)) (.cse8 (= ULTIMATE.start_main_~a~0 1)) (.cse9 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse10 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0)) (.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse7 (* ULTIMATE.start_main_~y~0 4)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse3 (= ULTIMATE.start_main_~q~0 0)) (.cse5 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse6 (<= ULTIMATE.start_main_~x~0 5))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~a~0 2) .cse2 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse3 (<= .cse4 ULTIMATE.start_main_~r~0) .cse5 .cse6) (and (or (and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) (<= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse4)) (< (* 2 ULTIMATE.start_main_~r~0) ULTIMATE.start_main_~x~0) .cse5 .cse6) (and .cse0 .cse5 (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 .cse7)) .cse6 (= ULTIMATE.start_main_~q~0 4))) .cse8 .cse1 .cse9 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse9 .cse10 .cse6) (and .cse0 (<= (* 4 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (= ULTIMATE.start_main_~b~0 .cse7) .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~a~0 4) .cse5 .cse6))) [2020-12-22 05:03:55,663 INFO L189 CegarLoopUtils]: For program point L15-12(lines 15 18) no Hoare annotation was computed. [2020-12-22 05:03:55,663 INFO L185 CegarLoopUtils]: At program point L15-14(lines 52 53) the Hoare annotation is: (let ((.cse6 (= ULTIMATE.start_main_~a~0 1)) (.cse7 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)) (.cse8 (<= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~r~0)) (.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse1 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse3 (= ULTIMATE.start_main_~q~0 0)) (.cse4 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse5 (<= ULTIMATE.start_main_~x~0 5))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~a~0 2) .cse2 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse3 (<= (* 2 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) .cse4 .cse5) (and (< ULTIMATE.start_main_~r~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~y~0))) .cse6 (<= ULTIMATE.start_main_~r~0 5) .cse1 (<= 0 ULTIMATE.start_main_~x~0) .cse4 .cse7 .cse8 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse5) (and .cse0 (<= (* 4 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 4)) .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~a~0 4) .cse4 .cse5))) [2020-12-22 05:03:55,663 INFO L192 CegarLoopUtils]: At program point L65(lines 22 66) the Hoare annotation is: true [2020-12-22 05:03:55,663 INFO L189 CegarLoopUtils]: For program point L15-15(lines 15 18) no Hoare annotation was computed. [2020-12-22 05:03:55,663 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-22 05:03:55,664 INFO L185 CegarLoopUtils]: At program point L15-17(lines 14 20) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~y~0)) (.cse1 (<= (* 2 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~r~0)) (.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (= ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~x~0)) (.cse4 (= ULTIMATE.start_main_~q~0 0)) (.cse5 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse6 (<= ULTIMATE.start_main_~x~0 5))) (or (and .cse0 (= ULTIMATE.start_main_~a~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) .cse6) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~a~0 2) .cse3 (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~y~0 2)) .cse4 .cse5 .cse6))) [2020-12-22 05:03:55,664 INFO L189 CegarLoopUtils]: For program point L15-18(lines 15 18) no Hoare annotation was computed. [2020-12-22 05:03:55,664 INFO L192 CegarLoopUtils]: At program point L15-20(lines 14 20) the Hoare annotation is: true [2020-12-22 05:03:55,664 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-22 05:03:55,664 INFO L189 CegarLoopUtils]: For program point L16(lines 16 17) no Hoare annotation was computed. [2020-12-22 05:03:55,664 INFO L189 CegarLoopUtils]: For program point L16-1(lines 16 17) no Hoare annotation was computed. [2020-12-22 05:03:55,664 INFO L189 CegarLoopUtils]: For program point L16-2(lines 16 17) no Hoare annotation was computed. [2020-12-22 05:03:55,664 INFO L189 CegarLoopUtils]: For program point L16-3(lines 16 17) no Hoare annotation was computed. [2020-12-22 05:03:55,664 INFO L189 CegarLoopUtils]: For program point L16-4(lines 16 17) no Hoare annotation was computed. [2020-12-22 05:03:55,665 INFO L189 CegarLoopUtils]: For program point L16-5(lines 16 17) no Hoare annotation was computed. [2020-12-22 05:03:55,665 INFO L189 CegarLoopUtils]: For program point L16-6(lines 16 17) no Hoare annotation was computed. [2020-12-22 05:03:55,665 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-22 05:03:55,665 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-22 05:03:55,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 05:03:55 BoogieIcfgContainer [2020-12-22 05:03:55,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 05:03:55,743 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 05:03:55,743 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 05:03:55,743 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 05:03:55,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 05:03:33" (3/4) ... [2020-12-22 05:03:55,752 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-22 05:03:55,769 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2020-12-22 05:03:55,769 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-22 05:03:55,769 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 05:03:55,769 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 05:03:55,864 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c-witness.graphml [2020-12-22 05:03:55,864 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 05:03:55,866 INFO L168 Benchmark]: Toolchain (without parser) took 22789.51 ms. Allocated memory was 157.3 MB in the beginning and 272.6 MB in the end (delta: 115.3 MB). Free memory was 133.4 MB in the beginning and 98.7 MB in the end (delta: 34.6 MB). Peak memory consumption was 150.9 MB. Max. memory is 8.0 GB. [2020-12-22 05:03:55,866 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 157.3 MB. Free memory is still 128.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 05:03:55,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.21 ms. Allocated memory is still 157.3 MB. Free memory was 133.2 MB in the beginning and 123.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-12-22 05:03:55,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.19 ms. Allocated memory is still 157.3 MB. Free memory was 123.3 MB in the beginning and 121.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-22 05:03:55,867 INFO L168 Benchmark]: Boogie Preprocessor took 30.24 ms. Allocated memory is still 157.3 MB. Free memory was 121.6 MB in the beginning and 120.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-22 05:03:55,868 INFO L168 Benchmark]: RCFGBuilder took 420.02 ms. Allocated memory is still 157.3 MB. Free memory was 120.4 MB in the beginning and 103.6 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2020-12-22 05:03:55,868 INFO L168 Benchmark]: TraceAbstraction took 21882.24 ms. Allocated memory was 157.3 MB in the beginning and 272.6 MB in the end (delta: 115.3 MB). Free memory was 103.1 MB in the beginning and 102.9 MB in the end (delta: 180.7 kB). Peak memory consumption was 124.7 MB. Max. memory is 8.0 GB. [2020-12-22 05:03:55,869 INFO L168 Benchmark]: Witness Printer took 121.40 ms. Allocated memory is still 272.6 MB. Free memory was 102.9 MB in the beginning and 98.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-12-22 05:03:55,871 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 157.3 MB. Free memory is still 128.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 279.21 ms. Allocated memory is still 157.3 MB. Free memory was 133.2 MB in the beginning and 123.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 44.19 ms. Allocated memory is still 157.3 MB. Free memory was 123.3 MB in the beginning and 121.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 30.24 ms. Allocated memory is still 157.3 MB. Free memory was 121.6 MB in the beginning and 120.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 420.02 ms. Allocated memory is still 157.3 MB. Free memory was 120.4 MB in the beginning and 103.6 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 21882.24 ms. Allocated memory was 157.3 MB in the beginning and 272.6 MB in the end (delta: 115.3 MB). Free memory was 103.1 MB in the beginning and 102.9 MB in the end (delta: 180.7 kB). Peak memory consumption was 124.7 MB. Max. memory is 8.0 GB. * Witness Printer took 121.40 ms. Allocated memory is still 272.6 MB. Free memory was 102.9 MB in the beginning and 98.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((((a == q && 2 * r < x) && x == r + b) && b <= 2 * y) && ((((((1 <= y && y <= 5) && r <= 5) && a == 2) && b == y * 2) || ((((1 <= y && b == y * 4) && 4 * y <= 5) && r <= 5) && a == 4)) || (((((1 <= y && y <= 5) && a == 1) && r <= 5) && 0 <= x) && b == y))) && cond == 1) && x <= 5) && 2 * y <= x) || (((((((((((1 <= y && y <= 5) && r <= 5) && a == 2) && b == y * 2) || ((((1 <= y && b == y * 4) && 4 * y <= 5) && r <= 5) && a == 4)) || (((((1 <= y && y <= 5) && a == 1) && r <= 5) && 0 <= x) && b == y)) && 0 <= r) && cond == 1) && x == r + y * 4) && x <= 5) && q == 4)) && 1 == cond) || (((((((1 <= y && y <= 5) && 1 == cond) && 0 <= x) && r == x) && q == 0) && cond == 1) && x <= 5)) || (((((((x == r + q * y && q * y <= x) && 1 == cond) && 2 * r + q * y < y + x) && 0 <= x) && ((((((1 <= y && y <= 5) && r <= 5) && a == 2) && b == y * 2) || ((((1 <= y && b == y * 4) && 4 * y <= 5) && r <= 5) && a == 4)) || (((((1 <= y && y <= 5) && a == 1) && r <= 5) && 0 <= x) && b == y))) && cond == 1) && x <= 5) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((((((1 <= y && 1 == cond) && a == 2) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) && x <= 5) || (((((((((r < 2 * b && x == r + q * y) && a == 1) && r <= 5) && 1 == cond) && 0 <= x) && cond == 1) && b == y) && y <= r) && x <= 5)) || ((((((((1 <= y && a == 1) && 1 == cond) && r == x) && q == 0) && cond == 1) && b == y) && y <= r) && x <= 5)) || ((((((((1 <= y && 4 * y <= r) && b == y * 4) && 1 == cond) && r == x) && q == 0) && a == 4) && cond == 1) && x <= 5) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((((1 <= y && 1 == cond) && a == 2) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) && x <= 5) || (((((((((x == r + q * y && x <= r + 2 * y) && a == 1) && 1 == cond) && 2 * r < x) && cond == 1) && x <= 5) || ((((((1 <= y && a == 1) && 1 == cond) && cond == 1) && x == r + y * 4) && x <= 5) && q == 4)) && b == y) && y <= r)) || ((((((((1 <= y && a == 1) && 1 == cond) && r == x) && q == 0) && cond == 1) && b == y) && y <= r) && x <= 5)) || ((((((((1 <= y && 4 * y <= r) && b == y * 4) && 1 == cond) && r == x) && q == 0) && a == 4) && cond == 1) && x <= 5) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((a == q && (((((((((1 <= y && y <= 5) && 1 == cond) && r <= 5) && a == 2) && 0 <= x) && b == y * 2) && cond == 1) || (((((((1 <= y && b == y * 4) && 4 * y <= 5) && 1 == cond) && r <= 5) && 0 <= x) && cond == 1) && a == 4)) || (((((((1 <= y && a == 1) && y <= 5) && 1 == cond) && r <= 5) && 0 <= x) && cond == 1) && b == y))) && 2 * r < x) && x == r + b) && b <= 2 * y) && x <= 5) && 2 * y <= x) || ((((((1 <= y && y <= 5) && 0 <= x) && r == x) && q == 0) && cond == 1) && x <= 5)) || ((((x == r + q * y && (((((((((1 <= y && y <= 5) && 1 == cond) && r <= 5) && a == 2) && 0 <= x) && b == y * 2) && cond == 1) || (((((((1 <= y && b == y * 4) && 4 * y <= 5) && 1 == cond) && r <= 5) && 0 <= x) && cond == 1) && a == 4)) || (((((((1 <= y && a == 1) && y <= 5) && 1 == cond) && r <= 5) && 0 <= x) && cond == 1) && b == y))) && q * y <= x) && 2 * r + q * y < y + x) && x <= 5)) || (((((((((((((1 <= y && y <= 5) && 1 == cond) && r <= 5) && a == 2) && 0 <= x) && b == y * 2) && cond == 1) || (((((((1 <= y && b == y * 4) && 4 * y <= 5) && 1 == cond) && r <= 5) && 0 <= x) && cond == 1) && a == 4)) || (((((((1 <= y && a == 1) && y <= 5) && 1 == cond) && r <= 5) && 0 <= x) && cond == 1) && b == y)) && 0 <= r) && x == r + y * 4) && x <= 5) && q == 4) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((1 <= y && 1 == cond) && a == 2) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) && x <= 5) || (((((((((x == r + q * y && x <= r + 2 * y) && 2 * r < x) && cond == 1) && x <= 5) || ((((1 <= y && cond == 1) && x == r + y * 4) && x <= 5) && q == 4)) && a == 1) && 1 == cond) && b == y) && y <= r)) || ((((((((1 <= y && a == 1) && 1 == cond) && r == x) && q == 0) && cond == 1) && b == y) && y <= r) && x <= 5)) || ((((((((1 <= y && 4 * y <= r) && b == y * 4) && 1 == cond) && r == x) && q == 0) && a == 4) && cond == 1) && x <= 5) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((1 <= y && a == 1) && 2 * b <= r) && 1 == cond) && r == x) && q == 0) && cond == 1) && b == y) && x <= 5) || ((((((((1 <= y && 2 * b <= r) && 1 == cond) && a == 2) && r == x) && b == y * 2) && q == 0) && cond == 1) && x <= 5) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((((((1 <= y && 1 == cond) && a == 2) && r == x) && b == y * 2) && q == 0) && 2 * y <= r) && cond == 1) && x <= 5) || (((((((((x == r + q * y && x <= r + 2 * y) && 2 * r < x) && cond == 1) && x <= 5) || ((((1 <= y && cond == 1) && x == r + y * 4) && x <= 5) && q == 4)) && a == 1) && 1 == cond) && b == y) && y <= r)) || ((((((((1 <= y && a == 1) && 1 == cond) && r == x) && q == 0) && cond == 1) && b == y) && y <= r) && x <= 5)) || ((((((((1 <= y && 4 * y <= r) && b == y * 4) && 1 == cond) && r == x) && q == 0) && a == 4) && cond == 1) && x <= 5) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((((((1 == cond && (((((((1 <= y && y <= 5) && r <= 5) && a == 2) && 0 <= x) && b == y * 2) || (((((1 <= y && b == y * 4) && 4 * y <= 5) && r <= 5) && 0 <= x) && a == 4)) || (((((1 <= y && a == 1) && y <= 5) && r <= 5) && 0 <= x) && b == y))) && 0 <= r) && cond == 1) && x == r + y * 4) && x <= 5) && q == 4) || ((((((x == r + q * y && q * y <= x) && 1 == cond) && 2 * r + q * y < y + x) && (((((((1 <= y && y <= 5) && r <= 5) && a == 2) && 0 <= x) && b == y * 2) || (((((1 <= y && b == y * 4) && 4 * y <= 5) && r <= 5) && 0 <= x) && a == 4)) || (((((1 <= y && a == 1) && y <= 5) && r <= 5) && 0 <= x) && b == y))) && cond == 1) && x <= 5)) || ((((((((1 <= y && y <= 5) && 0 <= x) && a == 0) && r == x) && q == 0) && cond == 1) && x <= 5) && b == 0)) || ((((((((a == q && 1 == cond) && x == r + b) && b <= 2 * y) && (((((((1 <= y && y <= 5) && r <= 5) && a == 2) && 0 <= x) && b == y * 2) || (((((1 <= y && b == y * 4) && 4 * y <= 5) && r <= 5) && 0 <= x) && a == 4)) || (((((1 <= y && a == 1) && y <= 5) && r <= 5) && 0 <= x) && b == y))) && x < 2 * b) && cond == 1) && x <= 5) && 2 * y <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 17.5s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 336 SDtfs, 1918 SDslu, 841 SDs, 0 SdLazy, 1871 SolverSat, 474 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 454 GetRequests, 274 SyntacticMatches, 3 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 229 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 50 NumberOfFragments, 1601 HoareAnnotationTreeSize, 10 FomulaSimplifications, 23392 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 10 FomulaSimplificationsInter, 2959 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 386 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 374 ConstructedInterpolants, 0 QuantifiedInterpolants, 159535 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1349 ConjunctsInSsa, 302 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 140/240 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! Received shutdown request...