/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 10:45:28,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 10:45:28,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 10:45:28,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 10:45:28,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 10:45:28,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 10:45:28,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 10:45:28,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 10:45:28,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 10:45:28,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 10:45:28,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 10:45:28,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 10:45:28,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 10:45:28,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 10:45:28,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 10:45:28,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 10:45:28,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 10:45:28,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 10:45:28,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 10:45:28,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 10:45:28,460 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 10:45:28,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 10:45:28,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 10:45:28,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 10:45:28,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 10:45:28,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 10:45:28,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 10:45:28,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 10:45:28,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 10:45:28,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 10:45:28,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 10:45:28,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 10:45:28,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 10:45:28,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 10:45:28,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 10:45:28,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 10:45:28,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 10:45:28,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 10:45:28,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 10:45:28,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 10:45:28,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 10:45:28,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 10:45:28,478 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 10:45:28,488 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 10:45:28,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 10:45:28,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 10:45:28,489 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 10:45:28,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 10:45:28,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 10:45:28,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 10:45:28,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 10:45:28,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 10:45:28,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 10:45:28,491 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 10:45:28,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 10:45:28,491 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 10:45:28,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 10:45:28,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 10:45:28,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 10:45:28,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 10:45:28,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 10:45:28,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:45:28,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 10:45:28,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 10:45:28,492 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 10:45:28,492 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 10:45:28,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 10:45:28,493 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 10:45:28,493 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 10:45:28,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 10:45:28,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 10:45:28,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 10:45:28,711 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 10:45:28,711 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 10:45:28,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound5.c [2022-04-15 10:45:28,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6808d09a8/8cf7aa9884db4ac19c6c2e2997b52afa/FLAG1bfd2cd08 [2022-04-15 10:45:29,121 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 10:45:29,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound5.c [2022-04-15 10:45:29,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6808d09a8/8cf7aa9884db4ac19c6c2e2997b52afa/FLAG1bfd2cd08 [2022-04-15 10:45:29,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6808d09a8/8cf7aa9884db4ac19c6c2e2997b52afa [2022-04-15 10:45:29,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 10:45:29,141 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 10:45:29,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 10:45:29,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 10:45:29,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 10:45:29,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:45:29" (1/1) ... [2022-04-15 10:45:29,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@192bcadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:45:29, skipping insertion in model container [2022-04-15 10:45:29,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:45:29" (1/1) ... [2022-04-15 10:45:29,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 10:45:29,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 10:45:29,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound5.c[458,471] [2022-04-15 10:45:29,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:45:29,331 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 10:45:29,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_valuebound5.c[458,471] [2022-04-15 10:45:29,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:45:29,357 INFO L208 MainTranslator]: Completed translation [2022-04-15 10:45:29,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:45:29 WrapperNode [2022-04-15 10:45:29,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 10:45:29,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 10:45:29,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 10:45:29,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 10:45:29,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:45:29" (1/1) ... [2022-04-15 10:45:29,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:45:29" (1/1) ... [2022-04-15 10:45:29,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:45:29" (1/1) ... [2022-04-15 10:45:29,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:45:29" (1/1) ... [2022-04-15 10:45:29,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:45:29" (1/1) ... [2022-04-15 10:45:29,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:45:29" (1/1) ... [2022-04-15 10:45:29,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:45:29" (1/1) ... [2022-04-15 10:45:29,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 10:45:29,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 10:45:29,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 10:45:29,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 10:45:29,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:45:29" (1/1) ... [2022-04-15 10:45:29,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:45:29,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:45:29,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 10:45:29,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 10:45:29,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 10:45:29,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 10:45:29,444 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 10:45:29,444 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 10:45:29,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 10:45:29,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 10:45:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 10:45:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 10:45:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 10:45:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 10:45:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-15 10:45:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 10:45:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 10:45:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 10:45:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 10:45:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 10:45:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 10:45:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 10:45:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 10:45:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 10:45:29,493 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 10:45:29,494 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 10:45:29,640 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 10:45:29,645 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 10:45:29,645 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 10:45:29,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:45:29 BoogieIcfgContainer [2022-04-15 10:45:29,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 10:45:29,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 10:45:29,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 10:45:29,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 10:45:29,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 10:45:29" (1/3) ... [2022-04-15 10:45:29,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d181f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:45:29, skipping insertion in model container [2022-04-15 10:45:29,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:45:29" (2/3) ... [2022-04-15 10:45:29,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d181f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:45:29, skipping insertion in model container [2022-04-15 10:45:29,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:45:29" (3/3) ... [2022-04-15 10:45:29,671 INFO L111 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound5.c [2022-04-15 10:45:29,675 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 10:45:29,675 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 10:45:29,715 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 10:45:29,721 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 10:45:29,721 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 10:45:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:45:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 10:45:29,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:45:29,741 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:45:29,741 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:45:29,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:45:29,746 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 1 times [2022-04-15 10:45:29,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:29,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1109438250] [2022-04-15 10:45:29,762 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:45:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash -630235283, now seen corresponding path program 2 times [2022-04-15 10:45:29,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:45:29,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166388393] [2022-04-15 10:45:29,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:45:29,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:45:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:45:29,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 10:45:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:45:29,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-15 10:45:29,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-15 10:45:29,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-15 10:45:29,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 10:45:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:45:29,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-15 10:45:29,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-15 10:45:29,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-15 10:45:29,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-15 10:45:29,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 10:45:29,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-15 10:45:29,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-15 10:45:29,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #60#return; {31#true} is VALID [2022-04-15 10:45:29,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2022-04-15 10:45:29,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {31#true} is VALID [2022-04-15 10:45:29,980 INFO L272 TraceCheckUtils]: 6: Hoare triple {31#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {31#true} is VALID [2022-04-15 10:45:29,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-04-15 10:45:29,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-04-15 10:45:29,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2022-04-15 10:45:29,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32#false} {31#true} #52#return; {32#false} is VALID [2022-04-15 10:45:29,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {32#false} is VALID [2022-04-15 10:45:29,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume false; {32#false} is VALID [2022-04-15 10:45:29,984 INFO L272 TraceCheckUtils]: 13: Hoare triple {32#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {32#false} is VALID [2022-04-15 10:45:29,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-15 10:45:29,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-15 10:45:29,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-15 10:45:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:45:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:45:29,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166388393] [2022-04-15 10:45:29,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166388393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:45:29,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:45:29,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:45:29,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:45:29,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1109438250] [2022-04-15 10:45:29,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1109438250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:45:29,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:45:29,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:45:29,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717521362] [2022-04-15 10:45:29,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:45:29,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 10:45:29,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:45:30,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:45:30,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:30,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 10:45:30,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:30,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 10:45:30,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 10:45:30,066 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:45:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:30,207 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-15 10:45:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 10:45:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 10:45:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:45:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:45:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-15 10:45:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:45:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-15 10:45:30,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-15 10:45:30,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:30,319 INFO L225 Difference]: With dead ends: 47 [2022-04-15 10:45:30,320 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 10:45:30,322 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 10:45:30,325 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:45:30,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:45:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 10:45:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 10:45:30,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:45:30,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:45:30,355 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:45:30,355 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:45:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:30,361 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 10:45:30,361 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 10:45:30,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:30,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:30,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-15 10:45:30,362 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-04-15 10:45:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:30,365 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 10:45:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 10:45:30,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:30,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:30,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:45:30,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:45:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:45:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-15 10:45:30,369 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2022-04-15 10:45:30,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:45:30,370 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-15 10:45:30,370 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:45:30,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-15 10:45:30,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 10:45:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 10:45:30,400 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:45:30,400 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:45:30,401 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 10:45:30,401 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:45:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:45:30,402 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 1 times [2022-04-15 10:45:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:30,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1331591242] [2022-04-15 10:45:30,404 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:45:30,404 INFO L85 PathProgramCache]: Analyzing trace with hash 51610547, now seen corresponding path program 2 times [2022-04-15 10:45:30,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:45:30,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141973606] [2022-04-15 10:45:30,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:45:30,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:45:30,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:45:30,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [916417009] [2022-04-15 10:45:30,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:45:30,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:30,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:45:30,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:45:30,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 10:45:30,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 10:45:30,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:45:30,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 10:45:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:45:30,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:45:30,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2022-04-15 10:45:30,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {229#true} is VALID [2022-04-15 10:45:30,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-15 10:45:30,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #60#return; {229#true} is VALID [2022-04-15 10:45:30,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret5 := main(); {229#true} is VALID [2022-04-15 10:45:30,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {229#true} is VALID [2022-04-15 10:45:30,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {229#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {229#true} is VALID [2022-04-15 10:45:30,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#true} ~cond := #in~cond; {229#true} is VALID [2022-04-15 10:45:30,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#true} assume !(0 == ~cond); {229#true} is VALID [2022-04-15 10:45:30,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#true} assume true; {229#true} is VALID [2022-04-15 10:45:30,671 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {229#true} {229#true} #52#return; {229#true} is VALID [2022-04-15 10:45:30,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:30,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {267#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:30,674 INFO L272 TraceCheckUtils]: 13: Hoare triple {267#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:45:30,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:45:30,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {230#false} is VALID [2022-04-15 10:45:30,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-04-15 10:45:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:45:30,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:45:30,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:45:30,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141973606] [2022-04-15 10:45:30,677 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:45:30,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916417009] [2022-04-15 10:45:30,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916417009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:45:30,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:45:30,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:45:30,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:45:30,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1331591242] [2022-04-15 10:45:30,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1331591242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:45:30,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:45:30,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:45:30,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087181181] [2022-04-15 10:45:30,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:45:30,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 10:45:30,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:45:30,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:45:30,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:30,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:45:30,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:30,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:45:30,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 10:45:30,702 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:45:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:31,125 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 10:45:31,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 10:45:31,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 10:45:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:45:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:45:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-15 10:45:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:45:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-15 10:45:31,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-15 10:45:31,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:31,168 INFO L225 Difference]: With dead ends: 34 [2022-04-15 10:45:31,168 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 10:45:31,169 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 10:45:31,170 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:45:31,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:45:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 10:45:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 10:45:31,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:45:31,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:45:31,192 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:45:31,192 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:45:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:31,197 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 10:45:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 10:45:31,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:31,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:31,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-15 10:45:31,199 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-15 10:45:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:31,204 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 10:45:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 10:45:31,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:31,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:31,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:45:31,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:45:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:45:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-15 10:45:31,207 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-15 10:45:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:45:31,207 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-15 10:45:31,208 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 10:45:31,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-15 10:45:31,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 10:45:31,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 10:45:31,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:45:31,253 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:45:31,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 10:45:31,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:31,475 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:45:31,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:45:31,476 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 1 times [2022-04-15 10:45:31,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:31,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [587452502] [2022-04-15 10:45:31,664 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:45:31,664 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:45:31,664 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:45:31,664 INFO L85 PathProgramCache]: Analyzing trace with hash 311787922, now seen corresponding path program 2 times [2022-04-15 10:45:31,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:45:31,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93346515] [2022-04-15 10:45:31,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:45:31,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:45:31,677 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:45:31,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [24206989] [2022-04-15 10:45:31,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:45:31,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:31,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:45:31,678 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:45:31,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 10:45:31,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:45:31,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:45:31,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 10:45:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:45:31,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:45:31,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-15 10:45:31,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {474#true} is VALID [2022-04-15 10:45:31,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-15 10:45:31,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-15 10:45:31,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-15 10:45:31,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {474#true} is VALID [2022-04-15 10:45:31,869 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {474#true} is VALID [2022-04-15 10:45:31,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-15 10:45:31,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-15 10:45:31,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-15 10:45:31,873 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-15 10:45:31,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:31,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:31,875 INFO L272 TraceCheckUtils]: 13: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-15 10:45:31,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-15 10:45:31,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-15 10:45:31,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-15 10:45:31,877 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {512#(and (= main_~x~0 0) (= main_~y~0 0))} #54#return; {512#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:31,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-15 10:45:31,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} assume !false; {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} is VALID [2022-04-15 10:45:31,879 INFO L272 TraceCheckUtils]: 20: Hoare triple {534#(and (= main_~y~0 1) (= (* main_~y~0 (* main_~y~0 main_~y~0)) main_~x~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:45:31,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:45:31,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-15 10:45:31,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-15 10:45:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 10:45:31,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:45:32,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2022-04-15 10:45:32,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {545#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {475#false} is VALID [2022-04-15 10:45:32,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {545#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:45:32,081 INFO L272 TraceCheckUtils]: 20: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {541#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:45:32,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 10:45:32,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 10:45:32,338 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {474#true} {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} #54#return; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 10:45:32,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-15 10:45:32,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-15 10:45:32,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-15 10:45:32,339 INFO L272 TraceCheckUtils]: 13: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {474#true} is VALID [2022-04-15 10:45:32,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} assume !false; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 10:45:32,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {561#(= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4))} is VALID [2022-04-15 10:45:32,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {474#true} {474#true} #52#return; {474#true} is VALID [2022-04-15 10:45:32,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-15 10:45:32,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2022-04-15 10:45:32,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2022-04-15 10:45:32,341 INFO L272 TraceCheckUtils]: 6: Hoare triple {474#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {474#true} is VALID [2022-04-15 10:45:32,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {474#true} is VALID [2022-04-15 10:45:32,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret5 := main(); {474#true} is VALID [2022-04-15 10:45:32,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #60#return; {474#true} is VALID [2022-04-15 10:45:32,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2022-04-15 10:45:32,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {474#true} is VALID [2022-04-15 10:45:32,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2022-04-15 10:45:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 10:45:32,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:45:32,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93346515] [2022-04-15 10:45:32,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:45:32,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24206989] [2022-04-15 10:45:32,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24206989] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 10:45:32,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:45:32,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 10:45:32,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:45:32,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [587452502] [2022-04-15 10:45:32,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [587452502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:45:32,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:45:32,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:45:32,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102122882] [2022-04-15 10:45:32,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:45:32,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-15 10:45:32,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:45:32,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:45:32,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:32,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:45:32,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:32,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:45:32,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 10:45:32,837 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:45:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:32,961 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-15 10:45:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 10:45:32,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-15 10:45:32,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:45:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:45:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-15 10:45:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:45:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-15 10:45:32,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-15 10:45:33,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:33,447 INFO L225 Difference]: With dead ends: 36 [2022-04-15 10:45:33,447 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 10:45:33,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 10:45:33,451 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:45:33,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:45:33,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 10:45:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 10:45:33,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:45:33,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:45:33,474 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:45:33,474 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:45:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:33,476 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 10:45:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 10:45:33,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:33,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:33,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-15 10:45:33,477 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-04-15 10:45:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:33,479 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 10:45:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 10:45:33,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:33,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:33,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:45:33,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:45:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 10:45:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-15 10:45:33,481 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2022-04-15 10:45:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:45:33,481 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-15 10:45:33,482 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:45:33,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-15 10:45:33,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 10:45:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 10:45:33,961 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:45:33,962 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:45:33,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 10:45:34,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 10:45:34,172 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:45:34,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:45:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 1 times [2022-04-15 10:45:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:34,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1269762869] [2022-04-15 10:45:34,310 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:45:34,310 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:45:34,310 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:45:34,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1417466424, now seen corresponding path program 2 times [2022-04-15 10:45:34,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:45:34,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456877444] [2022-04-15 10:45:34,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:45:34,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:45:34,340 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:45:34,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551150364] [2022-04-15 10:45:34,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:45:34,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:34,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:45:34,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:45:34,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 10:45:34,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:45:34,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:45:34,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 10:45:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:45:34,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:45:34,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2022-04-15 10:45:34,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {822#true} is VALID [2022-04-15 10:45:34,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-15 10:45:34,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #60#return; {822#true} is VALID [2022-04-15 10:45:34,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret5 := main(); {822#true} is VALID [2022-04-15 10:45:34,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {822#true} is VALID [2022-04-15 10:45:34,659 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {822#true} is VALID [2022-04-15 10:45:34,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-15 10:45:34,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-15 10:45:34,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-15 10:45:34,660 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #52#return; {822#true} is VALID [2022-04-15 10:45:34,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:34,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:34,661 INFO L272 TraceCheckUtils]: 13: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-15 10:45:34,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-15 10:45:34,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-15 10:45:34,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-15 10:45:34,663 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {822#true} {860#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {860#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:34,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 10:45:34,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 10:45:34,664 INFO L272 TraceCheckUtils]: 20: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {822#true} is VALID [2022-04-15 10:45:34,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-15 10:45:34,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-15 10:45:34,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-15 10:45:34,665 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {822#true} {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #54#return; {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-15 10:45:34,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {882#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-15 10:45:34,667 INFO L272 TraceCheckUtils]: 26: Hoare triple {904#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:45:34,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:45:34,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {823#false} is VALID [2022-04-15 10:45:34,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-15 10:45:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 10:45:34,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:45:35,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:45:35,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456877444] [2022-04-15 10:45:35,017 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:45:35,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551150364] [2022-04-15 10:45:35,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551150364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:45:35,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:45:35,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-15 10:45:35,018 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:45:35,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1269762869] [2022-04-15 10:45:35,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1269762869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:45:35,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:45:35,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 10:45:35,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470881807] [2022-04-15 10:45:35,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:45:35,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-15 10:45:35,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:45:35,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 10:45:35,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:35,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 10:45:35,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:35,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 10:45:35,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 10:45:35,047 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 10:45:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:35,269 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-15 10:45:35,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 10:45:35,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-15 10:45:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:45:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 10:45:35,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-15 10:45:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 10:45:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-15 10:45:35,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-15 10:45:35,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:35,301 INFO L225 Difference]: With dead ends: 39 [2022-04-15 10:45:35,301 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 10:45:35,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-15 10:45:35,302 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 10:45:35,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 10:45:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 10:45:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 10:45:35,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:45:35,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:45:35,322 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:45:35,322 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:45:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:35,324 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-15 10:45:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-15 10:45:35,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:35,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:35,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-15 10:45:35,325 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-15 10:45:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:35,327 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-15 10:45:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-15 10:45:35,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:35,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:35,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:45:35,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:45:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:45:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-15 10:45:35,329 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2022-04-15 10:45:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:45:35,329 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-15 10:45:35,329 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 10:45:35,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-15 10:45:35,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-15 10:45:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 10:45:35,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:45:35,822 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:45:35,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 10:45:36,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:36,035 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:45:36,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:45:36,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 3 times [2022-04-15 10:45:36,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:36,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2085796619] [2022-04-15 10:45:36,164 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:45:36,164 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:45:36,164 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:45:36,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2045316535, now seen corresponding path program 4 times [2022-04-15 10:45:36,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:45:36,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949927309] [2022-04-15 10:45:36,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:45:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:45:36,180 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:45:36,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [609498134] [2022-04-15 10:45:36,180 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:45:36,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:36,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:45:36,182 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:45:36,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 10:45:36,233 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:45:36,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:45:36,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 10:45:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:45:36,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:45:36,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {1178#true} call ULTIMATE.init(); {1178#true} is VALID [2022-04-15 10:45:36,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {1178#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1178#true} is VALID [2022-04-15 10:45:36,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-15 10:45:36,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1178#true} {1178#true} #60#return; {1178#true} is VALID [2022-04-15 10:45:36,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {1178#true} call #t~ret5 := main(); {1178#true} is VALID [2022-04-15 10:45:36,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {1178#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1178#true} is VALID [2022-04-15 10:45:36,636 INFO L272 TraceCheckUtils]: 6: Hoare triple {1178#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1178#true} is VALID [2022-04-15 10:45:36,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-15 10:45:36,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-15 10:45:36,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-15 10:45:36,637 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1178#true} {1178#true} #52#return; {1178#true} is VALID [2022-04-15 10:45:36,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:36,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:36,638 INFO L272 TraceCheckUtils]: 13: Hoare triple {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-15 10:45:36,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-15 10:45:36,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-15 10:45:36,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-15 10:45:36,639 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1178#true} {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:36,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {1216#(and (= main_~x~0 0) (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-15 10:45:36,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} assume !false; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-15 10:45:36,640 INFO L272 TraceCheckUtils]: 20: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-15 10:45:36,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#true} ~cond := #in~cond; {1178#true} is VALID [2022-04-15 10:45:36,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#true} assume !(0 == ~cond); {1178#true} is VALID [2022-04-15 10:45:36,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#true} assume true; {1178#true} is VALID [2022-04-15 10:45:36,641 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1178#true} {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} #54#return; {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} is VALID [2022-04-15 10:45:36,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {1238#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0 main_~y~0 main_~y~0)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} is VALID [2022-04-15 10:45:36,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} assume !false; {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} is VALID [2022-04-15 10:45:36,642 INFO L272 TraceCheckUtils]: 27: Hoare triple {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1178#true} is VALID [2022-04-15 10:45:36,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#true} ~cond := #in~cond; {1270#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:45:36,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {1270#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:45:36,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:45:36,644 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1274#(not (= |__VERIFIER_assert_#in~cond| 0))} {1260#(and (< 1 main_~k~0) (= (+ (- 2) main_~y~0) 0) (= (+ (* main_~y~0 (* main_~y~0 main_~y~0)) (* (+ (- 1) main_~y~0) (+ (- 1) main_~y~0) (+ (- 1) main_~y~0))) main_~x~0) (<= main_~c~0 2))} #54#return; {1281#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-15 10:45:36,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {1281#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1285#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 10:45:36,646 INFO L272 TraceCheckUtils]: 33: Hoare triple {1285#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1289#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:45:36,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {1289#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1293#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:45:36,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {1293#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1179#false} is VALID [2022-04-15 10:45:36,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#false} assume !false; {1179#false} is VALID [2022-04-15 10:45:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 10:45:36,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:45:51,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:45:51,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949927309] [2022-04-15 10:45:51,246 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:45:51,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609498134] [2022-04-15 10:45:51,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609498134] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:45:51,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:45:51,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-15 10:45:51,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:45:51,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2085796619] [2022-04-15 10:45:51,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2085796619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:45:51,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:45:51,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 10:45:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049886562] [2022-04-15 10:45:51,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:45:51,247 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-15 10:45:51,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:45:51,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 10:45:51,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:51,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 10:45:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:51,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 10:45:51,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-15 10:45:51,285 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 10:45:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:51,812 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-04-15 10:45:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 10:45:51,812 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2022-04-15 10:45:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:45:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 10:45:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-15 10:45:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 10:45:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-15 10:45:51,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-15 10:45:51,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:51,857 INFO L225 Difference]: With dead ends: 46 [2022-04-15 10:45:51,857 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 10:45:51,857 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-04-15 10:45:51,858 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 10:45:51,858 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 154 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 10:45:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 10:45:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 10:45:51,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:45:51,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:45:51,883 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:45:51,883 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:45:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:51,885 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-15 10:45:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 10:45:51,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:51,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:51,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 41 states. [2022-04-15 10:45:51,886 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 41 states. [2022-04-15 10:45:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:51,888 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-15 10:45:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 10:45:51,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:51,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:51,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:45:51,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:45:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:45:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-04-15 10:45:51,890 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 37 [2022-04-15 10:45:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:45:51,890 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-04-15 10:45:51,891 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 10:45:51,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 42 transitions. [2022-04-15 10:45:52,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 10:45:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 10:45:52,398 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:45:52,398 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:45:52,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 10:45:52,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:52,603 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:45:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:45:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 5 times [2022-04-15 10:45:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:52,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [990616472] [2022-04-15 10:45:52,695 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:45:52,695 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:45:52,695 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:45:52,695 INFO L85 PathProgramCache]: Analyzing trace with hash -285848920, now seen corresponding path program 6 times [2022-04-15 10:45:52,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:45:52,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330869099] [2022-04-15 10:45:52,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:45:52,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:45:52,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:45:52,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694454135] [2022-04-15 10:45:52,713 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 10:45:52,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:52,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:45:52,716 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:45:52,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 10:45:52,815 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 10:45:52,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:45:52,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 10:45:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:45:52,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:45:53,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {1605#true} call ULTIMATE.init(); {1605#true} is VALID [2022-04-15 10:45:53,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {1605#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1605#true} is VALID [2022-04-15 10:45:53,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-15 10:45:53,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1605#true} {1605#true} #60#return; {1605#true} is VALID [2022-04-15 10:45:53,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {1605#true} call #t~ret5 := main(); {1605#true} is VALID [2022-04-15 10:45:53,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {1605#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1605#true} is VALID [2022-04-15 10:45:53,206 INFO L272 TraceCheckUtils]: 6: Hoare triple {1605#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {1605#true} is VALID [2022-04-15 10:45:53,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-15 10:45:53,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-15 10:45:53,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-15 10:45:53,207 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1605#true} {1605#true} #52#return; {1605#true} is VALID [2022-04-15 10:45:53,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {1605#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1643#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:53,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {1643#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1643#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:53,208 INFO L272 TraceCheckUtils]: 13: Hoare triple {1643#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1605#true} is VALID [2022-04-15 10:45:53,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-15 10:45:53,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-15 10:45:53,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-15 10:45:53,209 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1605#true} {1643#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {1643#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:53,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {1643#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:45:53,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !false; {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:45:53,211 INFO L272 TraceCheckUtils]: 20: Hoare triple {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1605#true} is VALID [2022-04-15 10:45:53,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-15 10:45:53,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-15 10:45:53,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-15 10:45:53,212 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1605#true} {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} #54#return; {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} is VALID [2022-04-15 10:45:53,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {1665#(and (= (+ (- 1) main_~y~0) 0) (= (+ (- 1) main_~c~0) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:45:53,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !false; {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:45:53,213 INFO L272 TraceCheckUtils]: 27: Hoare triple {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1605#true} is VALID [2022-04-15 10:45:53,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-15 10:45:53,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-15 10:45:53,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-15 10:45:53,216 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1605#true} {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} #54#return; {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:45:53,216 INFO L290 TraceCheckUtils]: 32: Hoare triple {1687#(and (= main_~y~0 2) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 10:45:53,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !false; {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 10:45:53,217 INFO L272 TraceCheckUtils]: 34: Hoare triple {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1605#true} is VALID [2022-04-15 10:45:53,217 INFO L290 TraceCheckUtils]: 35: Hoare triple {1605#true} ~cond := #in~cond; {1605#true} is VALID [2022-04-15 10:45:53,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {1605#true} assume !(0 == ~cond); {1605#true} is VALID [2022-04-15 10:45:53,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {1605#true} assume true; {1605#true} is VALID [2022-04-15 10:45:53,218 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1605#true} {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} #54#return; {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 10:45:53,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {1709#(and (<= main_~c~0 3) (= main_~y~0 3) (< 2 main_~k~0))} assume !(~c~0 < ~k~0); {1731#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} is VALID [2022-04-15 10:45:53,219 INFO L272 TraceCheckUtils]: 40: Hoare triple {1731#(and (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {1735#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:45:53,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {1735#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1739#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:45:53,220 INFO L290 TraceCheckUtils]: 42: Hoare triple {1739#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1606#false} is VALID [2022-04-15 10:45:53,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {1606#false} assume !false; {1606#false} is VALID [2022-04-15 10:45:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 10:45:53,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:45:53,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:45:53,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330869099] [2022-04-15 10:45:53,547 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:45:53,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694454135] [2022-04-15 10:45:53,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694454135] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:45:53,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:45:53,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 10:45:53,548 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:45:53,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [990616472] [2022-04-15 10:45:53,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [990616472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:45:53,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:45:53,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 10:45:53,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210615312] [2022-04-15 10:45:53,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:45:53,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-15 10:45:53,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:45:53,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 10:45:53,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:53,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 10:45:53,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:53,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 10:45:53,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 10:45:53,579 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 10:45:53,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:53,917 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-15 10:45:53,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 10:45:53,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2022-04-15 10:45:53,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:45:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 10:45:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 10:45:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 10:45:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 10:45:53,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-15 10:45:53,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:53,959 INFO L225 Difference]: With dead ends: 49 [2022-04-15 10:45:53,959 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 10:45:53,959 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-15 10:45:53,960 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 10:45:53,960 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 10:45:53,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 10:45:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 10:45:53,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:45:53,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:45:53,987 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:45:53,987 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:45:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:53,989 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 10:45:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 10:45:53,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:53,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:53,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-15 10:45:53,990 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-15 10:45:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:53,992 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 10:45:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 10:45:53,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:53,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:53,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:45:53,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:45:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:45:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-15 10:45:53,994 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 44 [2022-04-15 10:45:53,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:45:53,995 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-15 10:45:53,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 10:45:53,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-15 10:45:54,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 10:45:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 10:45:54,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:45:54,510 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:45:54,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 10:45:54,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:54,715 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:45:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:45:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 7 times [2022-04-15 10:45:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:54,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [901055292] [2022-04-15 10:45:54,814 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:45:54,814 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:45:54,814 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:45:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1858889367, now seen corresponding path program 8 times [2022-04-15 10:45:54,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:45:54,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153665689] [2022-04-15 10:45:54,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:45:54,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:45:54,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:45:54,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386402245] [2022-04-15 10:45:54,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:45:54,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:54,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:45:54,848 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:45:54,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 10:45:54,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:45:54,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:45:54,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 10:45:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:45:54,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:45:55,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-15 10:45:55,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2065#true} is VALID [2022-04-15 10:45:55,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 10:45:55,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #60#return; {2065#true} is VALID [2022-04-15 10:45:55,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret5 := main(); {2065#true} is VALID [2022-04-15 10:45:55,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2065#true} is VALID [2022-04-15 10:45:55,328 INFO L272 TraceCheckUtils]: 6: Hoare triple {2065#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2065#true} is VALID [2022-04-15 10:45:55,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 10:45:55,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 10:45:55,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 10:45:55,328 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2065#true} {2065#true} #52#return; {2065#true} is VALID [2022-04-15 10:45:55,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2103#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:55,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {2103#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2103#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:55,329 INFO L272 TraceCheckUtils]: 13: Hoare triple {2103#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 10:45:55,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 10:45:55,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 10:45:55,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 10:45:55,330 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2065#true} {2103#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2103#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:55,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {2103#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 10:45:55,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !false; {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 10:45:55,331 INFO L272 TraceCheckUtils]: 20: Hoare triple {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 10:45:55,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 10:45:55,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 10:45:55,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 10:45:55,332 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2065#true} {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} #54#return; {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} is VALID [2022-04-15 10:45:55,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {2125#(and (= (+ (- 1) main_~c~0) 0) (= main_~y~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:45:55,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !false; {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:45:55,333 INFO L272 TraceCheckUtils]: 27: Hoare triple {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 10:45:55,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 10:45:55,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 10:45:55,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 10:45:55,334 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2065#true} {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} #54#return; {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} is VALID [2022-04-15 10:45:55,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {2147#(and (= (+ (- 1) main_~y~0) 1) (= 0 (+ (- 2) main_~c~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-15 10:45:55,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !false; {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-15 10:45:55,336 INFO L272 TraceCheckUtils]: 34: Hoare triple {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 10:45:55,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 10:45:55,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 10:45:55,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 10:45:55,337 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2065#true} {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} #54#return; {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} is VALID [2022-04-15 10:45:55,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {2169#(and (= (+ (- 2) main_~y~0) 1) (= (+ main_~c~0 (- 3)) 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 10:45:55,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !false; {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 10:45:55,338 INFO L272 TraceCheckUtils]: 41: Hoare triple {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 10:45:55,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 10:45:55,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 10:45:55,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 10:45:55,339 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2065#true} {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} #54#return; {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} is VALID [2022-04-15 10:45:55,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {2191#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~c~0 4))} assume !(~c~0 < ~k~0); {2213#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} is VALID [2022-04-15 10:45:55,340 INFO L272 TraceCheckUtils]: 47: Hoare triple {2213#(and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:45:55,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {2217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:45:55,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {2221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-15 10:45:55,341 INFO L290 TraceCheckUtils]: 50: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-15 10:45:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 10:45:55,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:45:55,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:45:55,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153665689] [2022-04-15 10:45:55,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:45:55,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386402245] [2022-04-15 10:45:55,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386402245] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:45:55,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:45:55,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-15 10:45:55,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:45:55,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [901055292] [2022-04-15 10:45:55,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [901055292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:45:55,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:45:55,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 10:45:55,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450554137] [2022-04-15 10:45:55,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:45:55,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-15 10:45:55,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:45:55,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 10:45:55,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:55,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 10:45:55,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:55,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 10:45:55,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-15 10:45:55,660 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 10:45:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:56,067 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-04-15 10:45:56,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 10:45:56,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-04-15 10:45:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:45:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 10:45:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-15 10:45:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 10:45:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-15 10:45:56,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-15 10:45:56,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:56,122 INFO L225 Difference]: With dead ends: 52 [2022-04-15 10:45:56,122 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 10:45:56,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-15 10:45:56,123 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 10:45:56,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 10:45:56,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 10:45:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 10:45:56,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:45:56,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:45:56,159 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:45:56,159 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:45:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:56,161 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-15 10:45:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 10:45:56,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:56,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:56,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-15 10:45:56,163 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-15 10:45:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:56,165 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-15 10:45:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 10:45:56,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:56,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:56,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:45:56,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:45:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:45:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-15 10:45:56,169 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 51 [2022-04-15 10:45:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:45:56,170 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-15 10:45:56,170 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 10:45:56,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-15 10:45:56,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 10:45:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 10:45:56,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:45:56,756 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:45:56,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 10:45:56,956 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:56,957 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:45:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:45:56,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 9 times [2022-04-15 10:45:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:56,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2101384145] [2022-04-15 10:45:57,064 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:45:57,064 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:45:57,064 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:45:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1288003464, now seen corresponding path program 10 times [2022-04-15 10:45:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:45:57,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098806972] [2022-04-15 10:45:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:45:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:45:57,086 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:45:57,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828676555] [2022-04-15 10:45:57,086 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:45:57,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:57,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:45:57,092 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:45:57,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 10:45:57,189 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:45:57,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:45:57,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 10:45:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:45:57,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:45:57,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {2565#true} call ULTIMATE.init(); {2565#true} is VALID [2022-04-15 10:45:57,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {2565#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2565#true} is VALID [2022-04-15 10:45:57,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-15 10:45:57,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2565#true} {2565#true} #60#return; {2565#true} is VALID [2022-04-15 10:45:57,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {2565#true} call #t~ret5 := main(); {2565#true} is VALID [2022-04-15 10:45:57,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {2565#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {2565#true} is VALID [2022-04-15 10:45:57,578 INFO L272 TraceCheckUtils]: 6: Hoare triple {2565#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {2565#true} is VALID [2022-04-15 10:45:57,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-15 10:45:57,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-15 10:45:57,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-15 10:45:57,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2565#true} {2565#true} #52#return; {2565#true} is VALID [2022-04-15 10:45:57,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {2565#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2603#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:57,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {2603#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {2603#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:57,579 INFO L272 TraceCheckUtils]: 13: Hoare triple {2603#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-15 10:45:57,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-15 10:45:57,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-15 10:45:57,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-15 10:45:57,580 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2565#true} {2603#(and (= main_~c~0 0) (= main_~y~0 0))} #54#return; {2603#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-15 10:45:57,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {2603#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:45:57,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !false; {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:45:57,581 INFO L272 TraceCheckUtils]: 20: Hoare triple {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-15 10:45:57,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-15 10:45:57,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-15 10:45:57,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-15 10:45:57,581 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2565#true} {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} #54#return; {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} is VALID [2022-04-15 10:45:57,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {2625#(and (= (+ (- 1) main_~y~0) 0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2647#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:45:57,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {2647#(and (= main_~y~0 2) (= main_~c~0 2))} assume !false; {2647#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:45:57,582 INFO L272 TraceCheckUtils]: 27: Hoare triple {2647#(and (= main_~y~0 2) (= main_~c~0 2))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-15 10:45:57,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-15 10:45:57,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-15 10:45:57,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-15 10:45:57,583 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2565#true} {2647#(and (= main_~y~0 2) (= main_~c~0 2))} #54#return; {2647#(and (= main_~y~0 2) (= main_~c~0 2))} is VALID [2022-04-15 10:45:57,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {2647#(and (= main_~y~0 2) (= main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2669#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-15 10:45:57,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {2669#(and (= main_~y~0 3) (= main_~c~0 3))} assume !false; {2669#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-15 10:45:57,584 INFO L272 TraceCheckUtils]: 34: Hoare triple {2669#(and (= main_~y~0 3) (= main_~c~0 3))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-15 10:45:57,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-15 10:45:57,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-15 10:45:57,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-15 10:45:57,585 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2565#true} {2669#(and (= main_~y~0 3) (= main_~c~0 3))} #54#return; {2669#(and (= main_~y~0 3) (= main_~c~0 3))} is VALID [2022-04-15 10:45:57,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {2669#(and (= main_~y~0 3) (= main_~c~0 3))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-15 10:45:57,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !false; {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-15 10:45:57,586 INFO L272 TraceCheckUtils]: 41: Hoare triple {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-15 10:45:57,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-15 10:45:57,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-15 10:45:57,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-15 10:45:57,587 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2565#true} {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} #54#return; {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} is VALID [2022-04-15 10:45:57,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {2691#(and (= (+ (- 1) main_~c~0) 3) (= main_~y~0 4))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-15 10:45:57,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !false; {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-15 10:45:57,589 INFO L272 TraceCheckUtils]: 48: Hoare triple {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2565#true} is VALID [2022-04-15 10:45:57,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {2565#true} ~cond := #in~cond; {2565#true} is VALID [2022-04-15 10:45:57,589 INFO L290 TraceCheckUtils]: 50: Hoare triple {2565#true} assume !(0 == ~cond); {2565#true} is VALID [2022-04-15 10:45:57,589 INFO L290 TraceCheckUtils]: 51: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-15 10:45:57,590 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2565#true} {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} #54#return; {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-15 10:45:57,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {2713#(and (<= main_~c~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} assume !(~c~0 < ~k~0); {2735#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} is VALID [2022-04-15 10:45:57,591 INFO L272 TraceCheckUtils]: 54: Hoare triple {2735#(and (<= main_~k~0 5) (= (+ (- 1) main_~y~0) 4) (< 4 main_~k~0))} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {2739#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:45:57,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {2739#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2743#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:45:57,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {2743#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2566#false} is VALID [2022-04-15 10:45:57,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {2566#false} assume !false; {2566#false} is VALID [2022-04-15 10:45:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 10:45:57,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:45:57,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:45:57,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098806972] [2022-04-15 10:45:57,877 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:45:57,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828676555] [2022-04-15 10:45:57,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828676555] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:45:57,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:45:57,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-15 10:45:57,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:45:57,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2101384145] [2022-04-15 10:45:57,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2101384145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:45:57,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:45:57,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 10:45:57,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886582225] [2022-04-15 10:45:57,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:45:57,878 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-15 10:45:57,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:45:57,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 10:45:57,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:57,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 10:45:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:57,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 10:45:57,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 10:45:57,912 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 10:45:58,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:58,470 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-15 10:45:58,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 10:45:58,470 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2022-04-15 10:45:58,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:45:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 10:45:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-15 10:45:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 10:45:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2022-04-15 10:45:58,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2022-04-15 10:45:58,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:58,528 INFO L225 Difference]: With dead ends: 55 [2022-04-15 10:45:58,528 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 10:45:58,528 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-15 10:45:58,529 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 10:45:58,529 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 239 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 10:45:58,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 10:45:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 10:45:58,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:45:58,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:45:58,560 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:45:58,560 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:45:58,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:58,563 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-15 10:45:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 10:45:58,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:58,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:58,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 50 states. [2022-04-15 10:45:58,564 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 50 states. [2022-04-15 10:45:58,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:45:58,566 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-15 10:45:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 10:45:58,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:45:58,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:45:58,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:45:58,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:45:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:45:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-15 10:45:58,568 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 58 [2022-04-15 10:45:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:45:58,569 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-15 10:45:58,569 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 10:45:58,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-15 10:45:59,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:45:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 10:45:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 10:45:59,092 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:45:59,092 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:45:59,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 10:45:59,292 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:59,293 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:45:59,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:45:59,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 11 times [2022-04-15 10:45:59,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:45:59,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [666244748] [2022-04-15 10:45:59,416 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 10:45:59,417 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 10:45:59,417 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 10:45:59,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1494042761, now seen corresponding path program 12 times [2022-04-15 10:45:59,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:45:59,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167254208] [2022-04-15 10:45:59,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:45:59,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:45:59,436 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:45:59,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417777177] [2022-04-15 10:45:59,436 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 10:45:59,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:45:59,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:45:59,438 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:45:59,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 10:45:59,533 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 10:45:59,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:45:59,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 10:45:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:45:59,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:46:00,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {3105#true} call ULTIMATE.init(); {3105#true} is VALID [2022-04-15 10:46:00,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {3105#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {3105#true} is VALID [2022-04-15 10:46:00,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-15 10:46:00,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3105#true} {3105#true} #60#return; {3105#true} is VALID [2022-04-15 10:46:00,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {3105#true} call #t~ret5 := main(); {3105#true} is VALID [2022-04-15 10:46:00,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {3105#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {3105#true} is VALID [2022-04-15 10:46:00,014 INFO L272 TraceCheckUtils]: 6: Hoare triple {3105#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 5 then 1 else 0)); {3105#true} is VALID [2022-04-15 10:46:00,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {3105#true} ~cond := #in~cond; {3131#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:46:00,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {3131#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3135#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:46:00,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {3135#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3135#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:46:00,016 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3135#(not (= |assume_abort_if_not_#in~cond| 0))} {3105#true} #52#return; {3142#(and (<= main_~k~0 5) (<= 0 main_~k~0))} is VALID [2022-04-15 10:46:00,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {3142#(and (<= main_~k~0 5) (<= 0 main_~k~0))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-15 10:46:00,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !false; {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-15 10:46:00,017 INFO L272 TraceCheckUtils]: 13: Hoare triple {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-15 10:46:00,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-15 10:46:00,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-15 10:46:00,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-15 10:46:00,027 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3105#true} {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} #54#return; {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} is VALID [2022-04-15 10:46:00,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {3146#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 0 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-15 10:46:00,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !false; {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-15 10:46:00,029 INFO L272 TraceCheckUtils]: 20: Hoare triple {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-15 10:46:00,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-15 10:46:00,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-15 10:46:00,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-15 10:46:00,035 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3105#true} {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} #54#return; {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} is VALID [2022-04-15 10:46:00,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {3168#(and (<= main_~k~0 5) (<= 1 main_~c~0) (<= 0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-15 10:46:00,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !false; {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-15 10:46:00,037 INFO L272 TraceCheckUtils]: 27: Hoare triple {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-15 10:46:00,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-15 10:46:00,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-15 10:46:00,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-15 10:46:00,038 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3105#true} {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} #54#return; {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} is VALID [2022-04-15 10:46:00,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {3190#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 2 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-15 10:46:00,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !false; {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-15 10:46:00,040 INFO L272 TraceCheckUtils]: 34: Hoare triple {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-15 10:46:00,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-15 10:46:00,040 INFO L290 TraceCheckUtils]: 36: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-15 10:46:00,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-15 10:46:00,041 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3105#true} {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} #54#return; {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} is VALID [2022-04-15 10:46:00,041 INFO L290 TraceCheckUtils]: 39: Hoare triple {3212#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 3 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-15 10:46:00,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !false; {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-15 10:46:00,042 INFO L272 TraceCheckUtils]: 41: Hoare triple {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-15 10:46:00,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-15 10:46:00,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-15 10:46:00,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-15 10:46:00,043 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3105#true} {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} #54#return; {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} is VALID [2022-04-15 10:46:00,044 INFO L290 TraceCheckUtils]: 46: Hoare triple {3234#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 4 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-15 10:46:00,045 INFO L290 TraceCheckUtils]: 47: Hoare triple {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !false; {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-15 10:46:00,045 INFO L272 TraceCheckUtils]: 48: Hoare triple {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3105#true} is VALID [2022-04-15 10:46:00,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {3105#true} ~cond := #in~cond; {3105#true} is VALID [2022-04-15 10:46:00,045 INFO L290 TraceCheckUtils]: 50: Hoare triple {3105#true} assume !(0 == ~cond); {3105#true} is VALID [2022-04-15 10:46:00,045 INFO L290 TraceCheckUtils]: 51: Hoare triple {3105#true} assume true; {3105#true} is VALID [2022-04-15 10:46:00,046 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3105#true} {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} #54#return; {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} is VALID [2022-04-15 10:46:00,047 INFO L290 TraceCheckUtils]: 53: Hoare triple {3256#(and (<= main_~k~0 5) (<= 0 main_~k~0) (<= 5 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 + ~x~0; {3106#false} is VALID [2022-04-15 10:46:00,047 INFO L290 TraceCheckUtils]: 54: Hoare triple {3106#false} assume !false; {3106#false} is VALID [2022-04-15 10:46:00,047 INFO L272 TraceCheckUtils]: 55: Hoare triple {3106#false} call __VERIFIER_assert((if 0 == 4 * ~x~0 - ~y~0 * ~y~0 * ~y~0 * ~y~0 - 2 * ~y~0 * ~y~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3106#false} is VALID [2022-04-15 10:46:00,047 INFO L290 TraceCheckUtils]: 56: Hoare triple {3106#false} ~cond := #in~cond; {3106#false} is VALID [2022-04-15 10:46:00,047 INFO L290 TraceCheckUtils]: 57: Hoare triple {3106#false} assume !(0 == ~cond); {3106#false} is VALID [2022-04-15 10:46:00,047 INFO L290 TraceCheckUtils]: 58: Hoare triple {3106#false} assume true; {3106#false} is VALID [2022-04-15 10:46:00,047 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3106#false} {3106#false} #54#return; {3106#false} is VALID [2022-04-15 10:46:00,047 INFO L290 TraceCheckUtils]: 60: Hoare triple {3106#false} assume !(~c~0 < ~k~0); {3106#false} is VALID [2022-04-15 10:46:00,048 INFO L272 TraceCheckUtils]: 61: Hoare triple {3106#false} call __VERIFIER_assert((if 0 == ~k~0 * ~y~0 - ~y~0 * ~y~0 then 1 else 0)); {3106#false} is VALID [2022-04-15 10:46:00,048 INFO L290 TraceCheckUtils]: 62: Hoare triple {3106#false} ~cond := #in~cond; {3106#false} is VALID [2022-04-15 10:46:00,048 INFO L290 TraceCheckUtils]: 63: Hoare triple {3106#false} assume 0 == ~cond; {3106#false} is VALID [2022-04-15 10:46:00,049 INFO L290 TraceCheckUtils]: 64: Hoare triple {3106#false} assume !false; {3106#false} is VALID [2022-04-15 10:46:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-15 10:46:00,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:46:00,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:46:00,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167254208] [2022-04-15 10:46:00,051 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:46:00,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417777177] [2022-04-15 10:46:00,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417777177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:00,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:00,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 10:46:00,053 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:46:00,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [666244748] [2022-04-15 10:46:00,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [666244748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:46:00,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:46:00,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 10:46:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961125641] [2022-04-15 10:46:00,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:46:00,054 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-15 10:46:00,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:46:00,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 10:46:00,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:00,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 10:46:00,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:46:00,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 10:46:00,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 10:46:00,108 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 10:46:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:00,370 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-15 10:46:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 10:46:00,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 65 [2022-04-15 10:46:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:46:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 10:46:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-15 10:46:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 10:46:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-15 10:46:00,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2022-04-15 10:46:00,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:00,417 INFO L225 Difference]: With dead ends: 54 [2022-04-15 10:46:00,417 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 10:46:00,418 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-04-15 10:46:00,418 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 10:46:00,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 127 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 10:46:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 10:46:00,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 10:46:00,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:46:00,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 10:46:00,419 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 10:46:00,419 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 10:46:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:00,419 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 10:46:00,419 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 10:46:00,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:00,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:00,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 10:46:00,420 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 10:46:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:46:00,420 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 10:46:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 10:46:00,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:00,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:46:00,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:46:00,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:46:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 10:46:00,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 10:46:00,421 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2022-04-15 10:46:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:46:00,421 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 10:46:00,421 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 10:46:00,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 10:46:00,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:46:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 10:46:00,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:46:00,423 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 10:46:00,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 10:46:00,624 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 10:46:00,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 10:46:01,308 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 10:46:01,309 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 10:46:01,309 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 10:46:01,309 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-15 10:46:01,309 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-15 10:46:01,309 INFO L878 garLoopResultBuilder]: At program point L7-2(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-15 10:46:01,309 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-15 10:46:01,309 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 17 40) the Hoare annotation is: true [2022-04-15 10:46:01,309 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (<= main_~c~0 5) .cse0 (= 5 main_~y~0) .cse1 (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1))) [2022-04-15 10:46:01,309 INFO L878 garLoopResultBuilder]: At program point L28-1(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (<= main_~c~0 5) .cse0 (= 5 main_~y~0) .cse1 (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1))) [2022-04-15 10:46:01,310 INFO L878 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 5)) (.cse1 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and .cse0 (= main_~y~0 1) (< 0 main_~k~0) .cse1 (= main_~c~0 1)) (and .cse0 (= main_~y~0 4) (= main_~c~0 4) (< 3 main_~k~0) .cse1) (and (<= main_~c~0 5) .cse0 (= 5 main_~y~0) .cse1 (<= 5 main_~c~0) (< 4 main_~k~0)) (and .cse0 (<= 0 main_~k~0) (= main_~c~0 0) (= main_~y~0 0) .cse1) (and .cse0 (= main_~y~0 3) (< 2 main_~k~0) .cse1 (= main_~c~0 3)) (and (= main_~y~0 2) .cse0 (< 1 main_~k~0) (= main_~c~0 2) .cse1))) [2022-04-15 10:46:01,310 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 17 40) the Hoare annotation is: true [2022-04-15 10:46:01,310 INFO L878 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2) (<= main_~c~0 2) .cse0) (and (<= main_~c~0 3) (= main_~y~0 3) (<= main_~k~0 3) (< 2 main_~k~0) .cse0) (and (<= main_~k~0 1) (= main_~y~0 1) (< 0 main_~k~0) .cse0 (<= main_~c~0 1)) (and (<= main_~c~0 5) (<= main_~k~0 5) (= 5 main_~y~0) .cse0 (< 4 main_~k~0)) (and (= main_~y~0 4) (< 3 main_~k~0) (<= main_~k~0 4) .cse0 (<= main_~c~0 4)))) [2022-04-15 10:46:01,310 INFO L885 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-15 10:46:01,310 INFO L878 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= main_~k~0 5) (<= 0 main_~k~0)) [2022-04-15 10:46:01,310 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 17 40) the Hoare annotation is: true [2022-04-15 10:46:01,310 INFO L885 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-04-15 10:46:01,310 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ (* main_~y~0 main_~y~0 main_~y~0 main_~y~0) (* main_~y~0 main_~y~0) (* (* main_~y~0 main_~y~0 main_~y~0) 2)) (* main_~x~0 4)) [2022-04-15 10:46:01,310 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 10:46:01,310 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 10:46:01,310 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 10:46:01,310 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 10:46:01,311 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 10:46:01,311 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 10:46:01,311 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 10:46:01,311 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-15 10:46:01,311 INFO L878 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 10:46:01,311 INFO L878 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 10:46:01,312 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 10:46:01,312 INFO L878 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 10:46:01,312 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 10:46:01,318 INFO L719 BasicCegarLoop]: Path program histogram: [12, 2, 2, 2] [2022-04-15 10:46:01,319 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 10:46:01,324 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 10:46:01,325 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 10:46:01,356 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 10:46:01,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 10:46:01 BoogieIcfgContainer [2022-04-15 10:46:01,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 10:46:01,368 INFO L158 Benchmark]: Toolchain (without parser) took 32227.14ms. Allocated memory was 184.5MB in the beginning and 263.2MB in the end (delta: 78.6MB). Free memory was 125.8MB in the beginning and 225.0MB in the end (delta: -99.2MB). Peak memory consumption was 124.6MB. Max. memory is 8.0GB. [2022-04-15 10:46:01,368 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 10:46:01,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.35ms. Allocated memory was 184.5MB in the beginning and 263.2MB in the end (delta: 78.6MB). Free memory was 125.6MB in the beginning and 234.7MB in the end (delta: -109.2MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-04-15 10:46:01,369 INFO L158 Benchmark]: Boogie Preprocessor took 23.83ms. Allocated memory is still 263.2MB. Free memory was 234.7MB in the beginning and 233.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 10:46:01,369 INFO L158 Benchmark]: RCFGBuilder took 272.92ms. Allocated memory is still 263.2MB. Free memory was 233.2MB in the beginning and 221.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 10:46:01,369 INFO L158 Benchmark]: TraceAbstraction took 31702.98ms. Allocated memory is still 263.2MB. Free memory was 221.1MB in the beginning and 225.0MB in the end (delta: -3.9MB). Peak memory consumption was 141.3MB. Max. memory is 8.0GB. [2022-04-15 10:46:01,370 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.35ms. Allocated memory was 184.5MB in the beginning and 263.2MB in the end (delta: 78.6MB). Free memory was 125.6MB in the beginning and 234.7MB in the end (delta: -109.2MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.83ms. Allocated memory is still 263.2MB. Free memory was 234.7MB in the beginning and 233.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 272.92ms. Allocated memory is still 263.2MB. Free memory was 233.2MB in the beginning and 221.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 31702.98ms. Allocated memory is still 263.2MB. Free memory was 221.1MB in the beginning and 225.0MB in the end (delta: -3.9MB). Peak memory consumption was 141.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.6s, OverallIterations: 9, TraceHistogramMax: 8, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 1189 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 941 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 743 IncrementalHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 248 mSDtfsCounter, 743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 334 SyntacticMatches, 7 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=8, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 136 PreInvPairs, 204 NumberOfFragments, 853 HoareAnnotationTreeSize, 136 FomulaSimplifications, 273 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 28 FomulaSimplificationsInter, 187 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((k <= 5 && y == 1) && 0 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 1) || ((((k <= 5 && y == 4) && c == 4) && 3 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || (((((c <= 5 && k <= 5) && 5 == y) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && 5 <= c) && 4 < k)) || ((((k <= 5 && 0 <= k) && c == 0) && y == 0) && y * y * y * y + y * y + y * y * y * 2 == x * 4)) || ((((k <= 5 && y == 3) && 2 < k) && y * y * y * y + y * y + y * y * y * 2 == x * 4) && c == 3)) || ((((y == 2 && k <= 5) && 1 < k) && c == 2) && y * y * y * y + y * y + y * y * y * 2 == x * 4) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-15 10:46:01,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...