/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/prod4br-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:27:12,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:27:12,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:27:12,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:27:12,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:27:12,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:27:12,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:27:12,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:27:12,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:27:12,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:27:12,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:27:12,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:27:12,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:27:12,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:27:12,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:27:12,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:27:12,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:27:12,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:27:12,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:27:12,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:27:12,718 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:27:12,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:27:12,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:27:12,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:27:12,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:27:12,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:27:12,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:27:12,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:27:12,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:27:12,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:27:12,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:27:12,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:27:12,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:27:12,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:27:12,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:27:12,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:27:12,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:27:12,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:27:12,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:27:12,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:27:12,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:27:12,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:27:12,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 07:27:12,740 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:27:12,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:27:12,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:27:12,742 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:27:12,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:27:12,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:27:12,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:27:12,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:27:12,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:27:12,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:27:12,743 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:27:12,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:27:12,743 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:27:12,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:27:12,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:27:12,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:27:12,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:27:12,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:27:12,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:27:12,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:27:12,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:27:12,744 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:27:12,744 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:27:12,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:27:12,744 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:27:12,744 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-08 07:27:12,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:27:12,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:27:12,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:27:12,951 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:27:12,951 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:27:12,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound5.c [2022-04-08 07:27:12,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9c08109/a1906c4e3a5c42fc926508f4333800bc/FLAGdf7c573ee [2022-04-08 07:27:13,374 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:27:13,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound5.c [2022-04-08 07:27:13,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9c08109/a1906c4e3a5c42fc926508f4333800bc/FLAGdf7c573ee [2022-04-08 07:27:13,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9c08109/a1906c4e3a5c42fc926508f4333800bc [2022-04-08 07:27:13,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:27:13,397 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:27:13,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:27:13,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:27:13,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:27:13,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:27:13" (1/1) ... [2022-04-08 07:27:13,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d6712a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:27:13, skipping insertion in model container [2022-04-08 07:27:13,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:27:13" (1/1) ... [2022-04-08 07:27:13,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:27:13,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:27:13,581 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/prod4br-ll_valuebound5.c[524,537] [2022-04-08 07:27:13,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:27:13,620 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:27:13,628 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/prod4br-ll_valuebound5.c[524,537] [2022-04-08 07:27:13,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:27:13,656 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:27:13,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:27:13 WrapperNode [2022-04-08 07:27:13,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:27:13,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:27:13,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:27:13,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:27:13,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:27:13" (1/1) ... [2022-04-08 07:27:13,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:27:13" (1/1) ... [2022-04-08 07:27:13,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:27:13" (1/1) ... [2022-04-08 07:27:13,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:27:13" (1/1) ... [2022-04-08 07:27:13,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:27:13" (1/1) ... [2022-04-08 07:27:13,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:27:13" (1/1) ... [2022-04-08 07:27:13,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:27:13" (1/1) ... [2022-04-08 07:27:13,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:27:13,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:27:13,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:27:13,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:27:13,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:27:13" (1/1) ... [2022-04-08 07:27:13,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:27:13,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:27:13,729 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-08 07:27:13,757 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-08 07:27:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:27:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:27:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:27:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:27:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:27:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:27:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:27:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:27:13,766 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:27:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:27:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 07:27:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:27:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:27:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:27:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:27:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:27:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:27:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:27:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:27:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:27:13,811 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:27:13,812 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:27:13,982 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:27:13,992 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:27:13,993 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:27:13,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:27:13 BoogieIcfgContainer [2022-04-08 07:27:13,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:27:13,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:27:13,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:27:14,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:27:14,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:27:13" (1/3) ... [2022-04-08 07:27:14,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f425a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:27:14, skipping insertion in model container [2022-04-08 07:27:14,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:27:13" (2/3) ... [2022-04-08 07:27:14,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f425a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:27:14, skipping insertion in model container [2022-04-08 07:27:14,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:27:13" (3/3) ... [2022-04-08 07:27:14,014 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound5.c [2022-04-08 07:27:14,017 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:27:14,017 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:27:14,060 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:27:14,064 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-08 07:27:14,064 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:27:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:27:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 07:27:14,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:27:14,081 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:27:14,082 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:27:14,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:27:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 1 times [2022-04-08 07:27:14,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:27:14,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [230428771] [2022-04-08 07:27:14,099 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:27:14,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 2 times [2022-04-08 07:27:14,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:27:14,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040456602] [2022-04-08 07:27:14,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:27:14,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:27:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:27:14,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:27:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:27:14,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(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(13, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-08 07:27:14,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-08 07:27:14,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-08 07:27:14,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 07:27:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:27:14,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 07:27:14,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 07:27:14,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 07:27:14,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-08 07:27:14,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 07:27:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:27:14,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 07:27:14,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 07:27:14,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 07:27:14,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-08 07:27:14,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 07:27:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:27:14,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 07:27:14,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 07:27:14,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 07:27:14,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-08 07:27:14,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 07:27:14,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(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(13, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-08 07:27:14,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-08 07:27:14,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-08 07:27:14,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-08 07:27:14,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {37#true} is VALID [2022-04-08 07:27:14,244 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {37#true} is VALID [2022-04-08 07:27:14,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 07:27:14,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 07:27:14,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 07:27:14,244 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-08 07:27:14,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38#false} is VALID [2022-04-08 07:27:14,245 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {37#true} is VALID [2022-04-08 07:27:14,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 07:27:14,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 07:27:14,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 07:27:14,246 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-08 07:27:14,246 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-08 07:27:14,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-08 07:27:14,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-08 07:27:14,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-08 07:27:14,247 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-08 07:27:14,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {38#false} is VALID [2022-04-08 07:27:14,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-08 07:27:14,247 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {38#false} is VALID [2022-04-08 07:27:14,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-08 07:27:14,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-08 07:27:14,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-08 07:27:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:27:14,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:27:14,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040456602] [2022-04-08 07:27:14,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040456602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:27:14,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:27:14,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:27:14,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:27:14,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [230428771] [2022-04-08 07:27:14,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [230428771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:27:14,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:27:14,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:27:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209384305] [2022-04-08 07:27:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:27:14,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-08 07:27:14,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:27:14,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:27:14,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:27:14,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:27:14,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:27:14,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:27:14,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:27:14,293 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:27:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:27:14,402 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-08 07:27:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 07:27:14,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-08 07:27:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:27:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:27:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-08 07:27:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:27:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-08 07:27:14,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-04-08 07:27:14,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:27:14,502 INFO L225 Difference]: With dead ends: 61 [2022-04-08 07:27:14,502 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 07:27:14,504 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-08 07:27:14,506 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:27:14,507 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:27:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 07:27:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 07:27:14,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:27:14,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:27:14,529 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:27:14,529 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:27:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:27:14,533 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-08 07:27:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-08 07:27:14,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:27:14,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:27:14,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-08 07:27:14,534 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-08 07:27:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:27:14,536 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-08 07:27:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-08 07:27:14,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:27:14,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:27:14,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:27:14,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:27:14,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:27:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-08 07:27:14,540 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-08 07:27:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:27:14,541 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-08 07:27:14,541 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:27:14,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 36 transitions. [2022-04-08 07:27:14,575 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-08 07:27:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-08 07:27:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 07:27:14,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:27:14,576 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:27:14,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 07:27:14,576 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:27:14,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:27:14,577 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 1 times [2022-04-08 07:27:14,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:27:14,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1891390123] [2022-04-08 07:27:14,578 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:27:14,578 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 2 times [2022-04-08 07:27:14,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:27:14,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359760534] [2022-04-08 07:27:14,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:27:14,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:27:14,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:27:14,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473122280] [2022-04-08 07:27:14,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:27:14,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:27:14,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:27:14,612 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-08 07:27:14,634 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-08 07:27:14,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:27:14,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:27:14,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:27:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:27:14,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:27:14,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} call ULTIMATE.init(); {295#true} is VALID [2022-04-08 07:27:14,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#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(13, 2);call #Ultimate.allocInit(12, 3); {295#true} is VALID [2022-04-08 07:27:14,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-08 07:27:14,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} #83#return; {295#true} is VALID [2022-04-08 07:27:14,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} call #t~ret6 := main(); {295#true} is VALID [2022-04-08 07:27:14,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {295#true} is VALID [2022-04-08 07:27:14,872 INFO L272 TraceCheckUtils]: 6: Hoare triple {295#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {295#true} is VALID [2022-04-08 07:27:14,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-08 07:27:14,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-08 07:27:14,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-08 07:27:14,873 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {295#true} {295#true} #71#return; {295#true} is VALID [2022-04-08 07:27:14,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {295#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {295#true} is VALID [2022-04-08 07:27:14,875 INFO L272 TraceCheckUtils]: 12: Hoare triple {295#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {295#true} is VALID [2022-04-08 07:27:14,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-08 07:27:14,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-08 07:27:14,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-08 07:27:14,876 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {295#true} {295#true} #73#return; {295#true} is VALID [2022-04-08 07:27:14,876 INFO L272 TraceCheckUtils]: 17: Hoare triple {295#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {295#true} is VALID [2022-04-08 07:27:14,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-08 07:27:14,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-08 07:27:14,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-08 07:27:14,877 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {295#true} {295#true} #75#return; {295#true} is VALID [2022-04-08 07:27:14,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {295#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:27:14,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:27:14,879 INFO L272 TraceCheckUtils]: 24: Hoare triple {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {373#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:27:14,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {373#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {377#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:27:14,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {377#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {296#false} is VALID [2022-04-08 07:27:14,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-04-08 07:27:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:27:14,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:27:14,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:27:14,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359760534] [2022-04-08 07:27:14,882 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:27:14,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473122280] [2022-04-08 07:27:14,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473122280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:27:14,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:27:14,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:27:14,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:27:14,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1891390123] [2022-04-08 07:27:14,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1891390123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:27:14,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:27:14,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:27:14,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675656149] [2022-04-08 07:27:14,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:27:14,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-08 07:27:14,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:27:14,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 07:27:14,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:27:14,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:27:14,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:27:14,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:27:14,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 07:27:14,918 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 07:27:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:27:15,105 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-08 07:27:15,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:27:15,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-08 07:27:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:27:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 07:27:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 07:27:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 07:27:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 07:27:15,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-08 07:27:15,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:27:15,157 INFO L225 Difference]: With dead ends: 43 [2022-04-08 07:27:15,157 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 07:27:15,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-08 07:27:15,158 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:27:15,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 92 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:27:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 07:27:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2022-04-08 07:27:15,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:27:15,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:27:15,167 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:27:15,167 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:27:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:27:15,169 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-08 07:27:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-08 07:27:15,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:27:15,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:27:15,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-08 07:27:15,171 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-08 07:27:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:27:15,173 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-08 07:27:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-08 07:27:15,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:27:15,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:27:15,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:27:15,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:27:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:27:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-04-08 07:27:15,176 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 28 [2022-04-08 07:27:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:27:15,176 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-04-08 07:27:15,176 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 07:27:15,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 42 transitions. [2022-04-08 07:27:15,214 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-08 07:27:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-08 07:27:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 07:27:15,216 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:27:15,216 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:27:15,233 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-08 07:27:15,426 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-08 07:27:15,426 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:27:15,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:27:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 1 times [2022-04-08 07:27:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:27:15,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2063219185] [2022-04-08 07:27:15,427 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:27:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 2 times [2022-04-08 07:27:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:27:15,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128821315] [2022-04-08 07:27:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:27:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:27:15,444 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:27:15,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858028716] [2022-04-08 07:27:15,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:27:15,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:27:15,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:27:15,445 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-08 07:27:15,451 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-08 07:27:15,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:27:15,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:27:15,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 07:27:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:27:15,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:27:25,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-08 07:27:25,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#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(13, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-08 07:27:25,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-08 07:27:25,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-08 07:27:25,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-08 07:27:25,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {623#true} is VALID [2022-04-08 07:27:25,248 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {623#true} is VALID [2022-04-08 07:27:25,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:27:25,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:27:25,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:27:25,250 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {653#(not (= |assume_abort_if_not_#in~cond| 0))} {623#true} #71#return; {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 07:27:25,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 07:27:25,251 INFO L272 TraceCheckUtils]: 12: Hoare triple {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {623#true} is VALID [2022-04-08 07:27:25,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-08 07:27:25,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-08 07:27:25,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-08 07:27:25,252 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {623#true} {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #73#return; {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 07:27:25,252 INFO L272 TraceCheckUtils]: 17: Hoare triple {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-08 07:27:25,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#true} ~cond := #in~cond; {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:27:25,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:27:25,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:27:25,253 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#(not (= |assume_abort_if_not_#in~cond| 0))} {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #75#return; {694#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} is VALID [2022-04-08 07:27:25,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {694#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {698#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 07:27:25,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {698#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !false; {698#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-08 07:27:25,254 INFO L272 TraceCheckUtils]: 24: Hoare triple {698#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {623#true} is VALID [2022-04-08 07:27:25,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#true} ~cond := #in~cond; {708#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:27:25,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {708#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:27:25,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:27:27,259 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} {698#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} #77#return; {719#(and (<= 0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-08 07:27:27,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {719#(and (<= 0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {723#(and (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-08 07:27:27,271 INFO L272 TraceCheckUtils]: 30: Hoare triple {723#(and (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:27:27,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:27:27,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-08 07:27:27,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-08 07:27:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 07:27:27,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:27:39,216 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-08 07:27:39,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-08 07:27:39,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:27:39,218 INFO L272 TraceCheckUtils]: 30: Hoare triple {747#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:27:39,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {751#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {747#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-08 07:27:39,221 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} {623#true} #77#return; {751#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-08 07:27:39,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:27:39,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:27:39,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#true} ~cond := #in~cond; {764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 07:27:39,223 INFO L272 TraceCheckUtils]: 24: Hoare triple {623#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {623#true} is VALID [2022-04-08 07:27:39,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {623#true} assume !false; {623#true} is VALID [2022-04-08 07:27:39,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {623#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {623#true} is VALID [2022-04-08 07:27:39,225 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {623#true} {623#true} #75#return; {623#true} is VALID [2022-04-08 07:27:39,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-08 07:27:39,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-08 07:27:39,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-08 07:27:39,236 INFO L272 TraceCheckUtils]: 17: Hoare triple {623#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-08 07:27:39,236 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {623#true} {623#true} #73#return; {623#true} is VALID [2022-04-08 07:27:39,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-08 07:27:39,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-08 07:27:39,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-08 07:27:39,236 INFO L272 TraceCheckUtils]: 12: Hoare triple {623#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {623#true} is VALID [2022-04-08 07:27:39,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {623#true} is VALID [2022-04-08 07:27:39,237 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {623#true} {623#true} #71#return; {623#true} is VALID [2022-04-08 07:27:39,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-08 07:27:39,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-08 07:27:39,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-08 07:27:39,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {623#true} is VALID [2022-04-08 07:27:39,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {623#true} is VALID [2022-04-08 07:27:39,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-08 07:27:39,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-08 07:27:39,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-08 07:27:39,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#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(13, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-08 07:27:39,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-08 07:27:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:27:39,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:27:39,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128821315] [2022-04-08 07:27:39,238 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:27:39,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858028716] [2022-04-08 07:27:39,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858028716] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:27:39,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:27:39,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-08 07:27:39,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:27:39,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2063219185] [2022-04-08 07:27:39,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2063219185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:27:39,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:27:39,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 07:27:39,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558384984] [2022-04-08 07:27:39,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:27:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2022-04-08 07:27:39,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:27:39,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 07:27:41,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:27:41,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 07:27:41,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:27:41,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 07:27:41,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-04-08 07:27:41,310 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 07:27:43,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:27:49,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:27:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:27:49,619 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-08 07:27:49,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:27:49,619 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2022-04-08 07:27:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:27:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 07:27:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-08 07:27:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 07:27:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-08 07:27:49,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2022-04-08 07:27:49,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:27:49,673 INFO L225 Difference]: With dead ends: 47 [2022-04-08 07:27:49,673 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 07:27:49,674 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-08 07:27:49,675 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:27:49,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 137 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 5.2s Time] [2022-04-08 07:27:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 07:27:49,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-04-08 07:27:49,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:27:49,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:27:49,721 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:27:49,721 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:27:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:27:49,725 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-08 07:27:49,725 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-08 07:27:49,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:27:49,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:27:49,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-08 07:27:49,732 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-08 07:27:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:27:49,736 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-08 07:27:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-08 07:27:49,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:27:49,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:27:49,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:27:49,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:27:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:27:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-08 07:27:49,744 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 34 [2022-04-08 07:27:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:27:49,745 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-08 07:27:49,745 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 07:27:49,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 49 transitions. [2022-04-08 07:27:49,798 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-08 07:27:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-08 07:27:49,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 07:27:49,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:27:49,799 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:27:49,816 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-08 07:27:50,011 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-08 07:27:50,012 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:27:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:27:50,012 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 1 times [2022-04-08 07:27:50,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:27:50,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [839330512] [2022-04-08 07:27:50,013 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:27:50,013 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 2 times [2022-04-08 07:27:50,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:27:50,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291905956] [2022-04-08 07:27:50,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:27:50,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:27:50,035 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:27:50,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1247405048] [2022-04-08 07:27:50,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:27:50,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:27:50,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:27:50,043 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-08 07:27:50,064 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-08 07:27:50,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:27:50,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:27:50,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-08 07:27:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:27:50,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:27:51,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 07:27:51,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#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(13, 2);call #Ultimate.allocInit(12, 3); {1116#true} is VALID [2022-04-08 07:27:51,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:27:51,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #83#return; {1116#true} is VALID [2022-04-08 07:27:51,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 07:27:51,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-08 07:27:51,397 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:27:51,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:27:51,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:27:51,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:27:51,401 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1116#true} #71#return; {1153#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 07:27:51,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {1153#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1153#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 07:27:51,402 INFO L272 TraceCheckUtils]: 12: Hoare triple {1153#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:27:51,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#true} ~cond := #in~cond; {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:27:51,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:27:51,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:27:51,403 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1153#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #73#return; {1172#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} is VALID [2022-04-08 07:27:51,404 INFO L272 TraceCheckUtils]: 17: Hoare triple {1172#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:27:51,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {1116#true} ~cond := #in~cond; {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:27:51,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:27:51,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:27:51,405 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1172#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} #75#return; {1188#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 07:27:51,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {1188#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0) (<= main_~y~0 5))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-08 07:27:51,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} assume !false; {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-08 07:27:51,406 INFO L272 TraceCheckUtils]: 24: Hoare triple {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:27:51,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {1116#true} ~cond := #in~cond; {1202#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:27:51,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {1202#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:27:51,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:27:51,411 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} #77#return; {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-08 07:27:51,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1216#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~a~0 0)) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-08 07:27:51,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {1216#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~a~0 0)) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1220#(and (= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (<= main_~y~0 5) (= (mod main_~x~0 2) 0) (not (= main_~x~0 0)))} is VALID [2022-04-08 07:27:51,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {1220#(and (= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (<= main_~y~0 5) (= (mod main_~x~0 2) 0) (not (= main_~x~0 0)))} assume !false; {1220#(and (= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (<= main_~y~0 5) (= (mod main_~x~0 2) 0) (not (= main_~x~0 0)))} is VALID [2022-04-08 07:27:51,427 INFO L272 TraceCheckUtils]: 32: Hoare triple {1220#(and (= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (<= main_~y~0 5) (= (mod main_~x~0 2) 0) (not (= main_~x~0 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1227#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:27:51,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {1227#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1231#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:27:51,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {1231#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 07:27:51,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 07:27:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:27:51,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:29:26,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-08 07:29:26,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {1231#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-08 07:29:26,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {1227#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1231#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:29:26,625 INFO L272 TraceCheckUtils]: 32: Hoare triple {1247#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1227#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:29:26,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {1247#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {1247#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 07:29:26,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {1254#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1247#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 07:29:26,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {1258#(or (= main_~a~0 0) (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume !!(0 != ~a~0 && 0 != ~b~0); {1254#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-08 07:29:26,662 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} {1262#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)) (<= 0 main_~b~0))} #77#return; {1258#(or (= main_~a~0 0) (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-08 07:29:26,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:29:26,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {1272#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:29:26,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {1116#true} ~cond := #in~cond; {1272#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 07:29:26,663 INFO L272 TraceCheckUtils]: 24: Hoare triple {1262#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:29:26,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {1262#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)) (<= 0 main_~b~0))} assume !false; {1262#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)) (<= 0 main_~b~0))} is VALID [2022-04-08 07:29:26,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {1282#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1262#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)) (<= 0 main_~b~0))} is VALID [2022-04-08 07:29:26,665 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1116#true} #75#return; {1282#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-08 07:29:26,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:29:26,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {1295#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:29:26,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {1116#true} ~cond := #in~cond; {1295#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 07:29:26,667 INFO L272 TraceCheckUtils]: 17: Hoare triple {1116#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:29:26,667 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1116#true} {1116#true} #73#return; {1116#true} is VALID [2022-04-08 07:29:26,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:29:26,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 07:29:26,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 07:29:26,667 INFO L272 TraceCheckUtils]: 12: Hoare triple {1116#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:29:26,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1116#true} is VALID [2022-04-08 07:29:26,667 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #71#return; {1116#true} is VALID [2022-04-08 07:29:26,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:29:26,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-08 07:29:26,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-08 07:29:26,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1116#true} is VALID [2022-04-08 07:29:26,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-08 07:29:26,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-08 07:29:26,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #83#return; {1116#true} is VALID [2022-04-08 07:29:26,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-08 07:29:26,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#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(13, 2);call #Ultimate.allocInit(12, 3); {1116#true} is VALID [2022-04-08 07:29:26,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-08 07:29:26,669 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 07:29:26,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:29:26,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291905956] [2022-04-08 07:29:26,669 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:29:26,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247405048] [2022-04-08 07:29:26,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247405048] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:29:26,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:29:26,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2022-04-08 07:29:26,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:29:26,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [839330512] [2022-04-08 07:29:26,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [839330512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:29:26,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:29:26,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 07:29:26,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345929552] [2022-04-08 07:29:26,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:29:26,671 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2022-04-08 07:29:26,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:29:26,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:29:26,695 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-08 07:29:26,695 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 07:29:26,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:29:26,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 07:29:26,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-04-08 07:29:26,696 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:29:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:29:27,576 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2022-04-08 07:29:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:29:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2022-04-08 07:29:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:29:27,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:29:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-08 07:29:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:29:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-08 07:29:27,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2022-04-08 07:29:27,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:29:27,639 INFO L225 Difference]: With dead ends: 63 [2022-04-08 07:29:27,639 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 07:29:27,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-04-08 07:29:27,640 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:29:27,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 148 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 07:29:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 07:29:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-04-08 07:29:27,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:29:27,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:29:27,692 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:29:27,692 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:29:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:29:27,694 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-08 07:29:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-08 07:29:27,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:29:27,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:29:27,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 55 states. [2022-04-08 07:29:27,694 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 55 states. [2022-04-08 07:29:27,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:29:27,696 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-08 07:29:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-08 07:29:27,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:29:27,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:29:27,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:29:27,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:29:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:29:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-04-08 07:29:27,698 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 36 [2022-04-08 07:29:27,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:29:27,698 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-04-08 07:29:27,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 07:29:27,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 58 transitions. [2022-04-08 07:29:27,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:29:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-04-08 07:29:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 07:29:27,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:29:27,764 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:29:27,780 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-08 07:29:27,980 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-08 07:29:27,980 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:29:27,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:29:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2032180221, now seen corresponding path program 1 times [2022-04-08 07:29:27,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:29:27,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [153115884] [2022-04-08 07:29:27,981 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:29:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2032180221, now seen corresponding path program 2 times [2022-04-08 07:29:27,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:29:27,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377676539] [2022-04-08 07:29:27,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:29:27,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:29:28,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:29:28,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078139311] [2022-04-08 07:29:28,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:29:28,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:29:28,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:29:28,021 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-08 07:29:28,052 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-08 07:29:28,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:29:28,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:29:28,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 07:29:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:29:28,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:29:28,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {1692#true} call ULTIMATE.init(); {1692#true} is VALID [2022-04-08 07:29:28,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {1692#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(13, 2);call #Ultimate.allocInit(12, 3); {1692#true} is VALID [2022-04-08 07:29:28,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-08 07:29:28,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1692#true} {1692#true} #83#return; {1692#true} is VALID [2022-04-08 07:29:28,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {1692#true} call #t~ret6 := main(); {1692#true} is VALID [2022-04-08 07:29:28,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {1692#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1692#true} is VALID [2022-04-08 07:29:28,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {1692#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1692#true} is VALID [2022-04-08 07:29:28,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {1692#true} ~cond := #in~cond; {1692#true} is VALID [2022-04-08 07:29:28,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {1692#true} assume !(0 == ~cond); {1692#true} is VALID [2022-04-08 07:29:28,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-08 07:29:28,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1692#true} {1692#true} #71#return; {1692#true} is VALID [2022-04-08 07:29:28,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {1692#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1692#true} is VALID [2022-04-08 07:29:28,435 INFO L272 TraceCheckUtils]: 12: Hoare triple {1692#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1692#true} is VALID [2022-04-08 07:29:28,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {1692#true} ~cond := #in~cond; {1692#true} is VALID [2022-04-08 07:29:28,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {1692#true} assume !(0 == ~cond); {1692#true} is VALID [2022-04-08 07:29:28,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-08 07:29:28,435 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1692#true} {1692#true} #73#return; {1692#true} is VALID [2022-04-08 07:29:28,435 INFO L272 TraceCheckUtils]: 17: Hoare triple {1692#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1692#true} is VALID [2022-04-08 07:29:28,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {1692#true} ~cond := #in~cond; {1751#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:29:28,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {1751#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1755#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:29:28,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {1755#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1755#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:29:28,437 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1755#(not (= |assume_abort_if_not_#in~cond| 0))} {1692#true} #75#return; {1762#(<= 1 main_~y~0)} is VALID [2022-04-08 07:29:28,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {1762#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:28,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:28,438 INFO L272 TraceCheckUtils]: 24: Hoare triple {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1692#true} is VALID [2022-04-08 07:29:28,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {1692#true} ~cond := #in~cond; {1776#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:29:28,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {1776#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:29:28,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:29:28,439 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:28,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:28,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:28,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1796#(and (= (* main_~b~0 main_~p~0) main_~q~0) (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:28,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {1796#(and (= (* main_~b~0 main_~p~0) main_~q~0) (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} assume !false; {1796#(and (= (* main_~b~0 main_~p~0) main_~q~0) (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:28,443 INFO L272 TraceCheckUtils]: 33: Hoare triple {1796#(and (= (* main_~b~0 main_~p~0) main_~q~0) (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1803#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:29:28,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {1803#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1807#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:29:28,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {1807#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1693#false} is VALID [2022-04-08 07:29:28,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2022-04-08 07:29:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 07:29:28,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:29:40,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2022-04-08 07:29:40,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {1807#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1693#false} is VALID [2022-04-08 07:29:40,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {1803#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1807#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:29:40,503 INFO L272 TraceCheckUtils]: 33: Hoare triple {1823#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1803#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:29:40,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {1823#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {1823#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 07:29:40,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {1830#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1823#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 07:29:40,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {1830#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1830#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 07:29:40,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {1837#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)) (= main_~b~0 0))} assume !!(0 != ~a~0 && 0 != ~b~0); {1830#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 07:29:40,514 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} {1692#true} #77#return; {1837#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)) (= main_~b~0 0))} is VALID [2022-04-08 07:29:40,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:29:40,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {1850#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:29:40,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {1692#true} ~cond := #in~cond; {1850#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 07:29:40,519 INFO L272 TraceCheckUtils]: 24: Hoare triple {1692#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1692#true} is VALID [2022-04-08 07:29:40,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {1692#true} assume !false; {1692#true} is VALID [2022-04-08 07:29:40,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {1692#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1692#true} is VALID [2022-04-08 07:29:40,519 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1692#true} {1692#true} #75#return; {1692#true} is VALID [2022-04-08 07:29:40,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-08 07:29:40,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {1692#true} assume !(0 == ~cond); {1692#true} is VALID [2022-04-08 07:29:40,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {1692#true} ~cond := #in~cond; {1692#true} is VALID [2022-04-08 07:29:40,520 INFO L272 TraceCheckUtils]: 17: Hoare triple {1692#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1692#true} is VALID [2022-04-08 07:29:40,520 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1692#true} {1692#true} #73#return; {1692#true} is VALID [2022-04-08 07:29:40,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-08 07:29:40,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {1692#true} assume !(0 == ~cond); {1692#true} is VALID [2022-04-08 07:29:40,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {1692#true} ~cond := #in~cond; {1692#true} is VALID [2022-04-08 07:29:40,520 INFO L272 TraceCheckUtils]: 12: Hoare triple {1692#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1692#true} is VALID [2022-04-08 07:29:40,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {1692#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1692#true} is VALID [2022-04-08 07:29:40,520 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1692#true} {1692#true} #71#return; {1692#true} is VALID [2022-04-08 07:29:40,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-08 07:29:40,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {1692#true} assume !(0 == ~cond); {1692#true} is VALID [2022-04-08 07:29:40,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {1692#true} ~cond := #in~cond; {1692#true} is VALID [2022-04-08 07:29:40,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {1692#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1692#true} is VALID [2022-04-08 07:29:40,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {1692#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1692#true} is VALID [2022-04-08 07:29:40,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {1692#true} call #t~ret6 := main(); {1692#true} is VALID [2022-04-08 07:29:40,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1692#true} {1692#true} #83#return; {1692#true} is VALID [2022-04-08 07:29:40,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-08 07:29:40,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {1692#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(13, 2);call #Ultimate.allocInit(12, 3); {1692#true} is VALID [2022-04-08 07:29:40,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {1692#true} call ULTIMATE.init(); {1692#true} is VALID [2022-04-08 07:29:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:29:40,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:29:40,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377676539] [2022-04-08 07:29:40,522 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:29:40,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078139311] [2022-04-08 07:29:40,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078139311] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:29:40,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:29:40,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-04-08 07:29:40,522 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:29:40,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [153115884] [2022-04-08 07:29:40,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [153115884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:29:40,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:29:40,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:29:40,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481073797] [2022-04-08 07:29:40,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:29:40,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-08 07:29:40,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:29:40,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:29:40,546 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-08 07:29:40,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:29:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:29:40,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:29:40,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:29:40,547 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:29:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:29:41,447 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-08 07:29:41,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 07:29:41,447 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-08 07:29:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:29:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:29:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-04-08 07:29:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:29:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-04-08 07:29:41,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 87 transitions. [2022-04-08 07:29:41,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:29:41,517 INFO L225 Difference]: With dead ends: 78 [2022-04-08 07:29:41,517 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 07:29:41,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-08 07:29:41,518 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 33 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:29:41,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 121 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 07:29:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 07:29:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2022-04-08 07:29:41,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:29:41,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 60 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:29:41,590 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 60 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:29:41,590 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 60 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:29:41,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:29:41,592 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2022-04-08 07:29:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2022-04-08 07:29:41,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:29:41,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:29:41,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 64 states. [2022-04-08 07:29:41,592 INFO L87 Difference]: Start difference. First operand has 60 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 64 states. [2022-04-08 07:29:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:29:41,594 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2022-04-08 07:29:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2022-04-08 07:29:41,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:29:41,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:29:41,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:29:41,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:29:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 07:29:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2022-04-08 07:29:41,596 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 37 [2022-04-08 07:29:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:29:41,596 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2022-04-08 07:29:41,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:29:41,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 73 transitions. [2022-04-08 07:29:41,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:29:41,680 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2022-04-08 07:29:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 07:29:41,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:29:41,681 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:29:41,699 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-08 07:29:41,881 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-08 07:29:41,882 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:29:41,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:29:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 1 times [2022-04-08 07:29:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:29:41,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1124539643] [2022-04-08 07:29:41,882 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:29:41,883 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 2 times [2022-04-08 07:29:41,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:29:41,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532166483] [2022-04-08 07:29:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:29:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:29:41,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:29:41,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210562815] [2022-04-08 07:29:41,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:29:41,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:29:41,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:29:41,894 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-08 07:29:41,894 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-08 07:29:41,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:29:41,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:29:41,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 07:29:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:29:41,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:29:42,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-08 07:29:42,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#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(13, 2);call #Ultimate.allocInit(12, 3); {2338#true} is VALID [2022-04-08 07:29:42,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-08 07:29:42,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2338#true} {2338#true} #83#return; {2338#true} is VALID [2022-04-08 07:29:42,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {2338#true} call #t~ret6 := main(); {2338#true} is VALID [2022-04-08 07:29:42,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {2338#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2338#true} is VALID [2022-04-08 07:29:42,143 INFO L272 TraceCheckUtils]: 6: Hoare triple {2338#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2338#true} is VALID [2022-04-08 07:29:42,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {2338#true} ~cond := #in~cond; {2364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:29:42,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {2364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:29:42,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {2368#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:29:42,145 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2368#(not (= |assume_abort_if_not_#in~cond| 0))} {2338#true} #71#return; {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 07:29:42,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 07:29:42,145 INFO L272 TraceCheckUtils]: 12: Hoare triple {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2338#true} is VALID [2022-04-08 07:29:42,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-08 07:29:42,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-08 07:29:42,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-08 07:29:42,146 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2338#true} {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #73#return; {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 07:29:42,146 INFO L272 TraceCheckUtils]: 17: Hoare triple {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2338#true} is VALID [2022-04-08 07:29:42,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {2338#true} ~cond := #in~cond; {2364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:29:42,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {2364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:29:42,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {2368#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:29:42,148 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2368#(not (= |assume_abort_if_not_#in~cond| 0))} {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #75#return; {2409#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} is VALID [2022-04-08 07:29:42,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {2409#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-08 07:29:42,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !false; {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-08 07:29:42,149 INFO L272 TraceCheckUtils]: 24: Hoare triple {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2338#true} is VALID [2022-04-08 07:29:42,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-08 07:29:42,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-08 07:29:42,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-08 07:29:42,150 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2338#true} {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} #77#return; {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-08 07:29:42,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {2435#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-08 07:29:42,150 INFO L272 TraceCheckUtils]: 30: Hoare triple {2435#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2338#true} is VALID [2022-04-08 07:29:42,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-08 07:29:42,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-08 07:29:42,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-08 07:29:42,151 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2338#true} {2435#(and (= main_~a~0 0) (<= 1 main_~b~0))} #79#return; {2435#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-08 07:29:42,152 INFO L272 TraceCheckUtils]: 35: Hoare triple {2435#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2454#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:29:42,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {2454#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2458#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:29:42,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {2458#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2339#false} is VALID [2022-04-08 07:29:42,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-08 07:29:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 07:29:42,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:29:42,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-08 07:29:42,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {2458#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2339#false} is VALID [2022-04-08 07:29:42,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {2454#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2458#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:29:42,360 INFO L272 TraceCheckUtils]: 35: Hoare triple {2474#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2454#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:29:42,361 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2338#true} {2474#(= (* main_~b~0 main_~a~0) 0)} #79#return; {2474#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-08 07:29:42,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-08 07:29:42,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-08 07:29:42,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-08 07:29:42,361 INFO L272 TraceCheckUtils]: 30: Hoare triple {2474#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2338#true} is VALID [2022-04-08 07:29:42,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {2338#true} assume !(0 != ~a~0 && 0 != ~b~0); {2474#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-08 07:29:42,362 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2338#true} {2338#true} #77#return; {2338#true} is VALID [2022-04-08 07:29:42,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-08 07:29:42,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-08 07:29:42,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-08 07:29:42,363 INFO L272 TraceCheckUtils]: 24: Hoare triple {2338#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2338#true} is VALID [2022-04-08 07:29:42,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {2338#true} assume !false; {2338#true} is VALID [2022-04-08 07:29:42,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {2338#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2338#true} is VALID [2022-04-08 07:29:42,363 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2338#true} {2338#true} #75#return; {2338#true} is VALID [2022-04-08 07:29:42,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-08 07:29:42,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-08 07:29:42,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-08 07:29:42,363 INFO L272 TraceCheckUtils]: 17: Hoare triple {2338#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2338#true} is VALID [2022-04-08 07:29:42,363 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2338#true} {2338#true} #73#return; {2338#true} is VALID [2022-04-08 07:29:42,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-08 07:29:42,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-08 07:29:42,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-08 07:29:42,364 INFO L272 TraceCheckUtils]: 12: Hoare triple {2338#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2338#true} is VALID [2022-04-08 07:29:42,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {2338#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2338#true} is VALID [2022-04-08 07:29:42,364 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2338#true} {2338#true} #71#return; {2338#true} is VALID [2022-04-08 07:29:42,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-08 07:29:42,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-08 07:29:42,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-08 07:29:42,364 INFO L272 TraceCheckUtils]: 6: Hoare triple {2338#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2338#true} is VALID [2022-04-08 07:29:42,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {2338#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2338#true} is VALID [2022-04-08 07:29:42,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {2338#true} call #t~ret6 := main(); {2338#true} is VALID [2022-04-08 07:29:42,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2338#true} {2338#true} #83#return; {2338#true} is VALID [2022-04-08 07:29:42,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-08 07:29:42,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#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(13, 2);call #Ultimate.allocInit(12, 3); {2338#true} is VALID [2022-04-08 07:29:42,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-08 07:29:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 07:29:42,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:29:42,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532166483] [2022-04-08 07:29:42,365 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:29:42,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210562815] [2022-04-08 07:29:42,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210562815] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 07:29:42,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 07:29:42,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-08 07:29:42,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:29:42,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1124539643] [2022-04-08 07:29:42,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1124539643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:29:42,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:29:42,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:29:42,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908490249] [2022-04-08 07:29:42,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:29:42,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-08 07:29:42,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:29:42,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 07:29:42,406 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-08 07:29:42,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:29:42,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:29:42,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:29:42,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-08 07:29:42,407 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 07:29:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:29:42,807 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-08 07:29:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:29:42,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-08 07:29:42,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:29:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 07:29:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 07:29:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 07:29:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 07:29:42,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 07:29:42,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:29:42,836 INFO L225 Difference]: With dead ends: 66 [2022-04-08 07:29:42,836 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 07:29:42,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:29:42,838 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:29:42,838 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 125 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:29:42,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 07:29:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 07:29:42,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:29:42,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:29:42,907 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:29:42,908 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:29:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:29:42,910 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-08 07:29:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-08 07:29:42,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:29:42,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:29:42,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 07:29:42,911 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 07:29:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:29:42,913 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-08 07:29:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-08 07:29:42,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:29:42,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:29:42,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:29:42,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:29:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:29:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-08 07:29:42,914 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 39 [2022-04-08 07:29:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:29:42,915 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-08 07:29:42,915 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 07:29:42,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-08 07:29:43,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:29:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-08 07:29:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 07:29:43,000 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:29:43,000 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:29:43,019 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-08 07:29:43,201 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-08 07:29:43,201 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:29:43,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:29:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash 844519116, now seen corresponding path program 1 times [2022-04-08 07:29:43,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:29:43,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [196777090] [2022-04-08 07:29:43,202 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:29:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash 844519116, now seen corresponding path program 2 times [2022-04-08 07:29:43,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:29:43,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556495406] [2022-04-08 07:29:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:29:43,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:29:43,213 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:29:43,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595292118] [2022-04-08 07:29:43,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:29:43,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:29:43,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:29:43,215 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-08 07:29:43,216 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-08 07:29:43,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:29:43,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:29:43,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 07:29:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:29:43,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:29:43,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} call ULTIMATE.init(); {2932#true} is VALID [2022-04-08 07:29:43,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#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(13, 2);call #Ultimate.allocInit(12, 3); {2932#true} is VALID [2022-04-08 07:29:43,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-08 07:29:43,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} #83#return; {2932#true} is VALID [2022-04-08 07:29:43,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} call #t~ret6 := main(); {2932#true} is VALID [2022-04-08 07:29:43,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2932#true} is VALID [2022-04-08 07:29:43,683 INFO L272 TraceCheckUtils]: 6: Hoare triple {2932#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2932#true} is VALID [2022-04-08 07:29:43,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {2932#true} ~cond := #in~cond; {2958#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:29:43,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2962#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:29:43,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {2962#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2962#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:29:43,684 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2962#(not (= |assume_abort_if_not_#in~cond| 0))} {2932#true} #71#return; {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 07:29:43,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 07:29:43,685 INFO L272 TraceCheckUtils]: 12: Hoare triple {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2932#true} is VALID [2022-04-08 07:29:43,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {2932#true} ~cond := #in~cond; {2932#true} is VALID [2022-04-08 07:29:43,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#true} assume !(0 == ~cond); {2932#true} is VALID [2022-04-08 07:29:43,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-08 07:29:43,686 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2932#true} {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #73#return; {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 07:29:43,686 INFO L272 TraceCheckUtils]: 17: Hoare triple {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2932#true} is VALID [2022-04-08 07:29:43,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {2932#true} ~cond := #in~cond; {2932#true} is VALID [2022-04-08 07:29:43,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#true} assume !(0 == ~cond); {2932#true} is VALID [2022-04-08 07:29:43,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-08 07:29:43,687 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2932#true} {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #75#return; {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-08 07:29:43,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:43,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:43,688 INFO L272 TraceCheckUtils]: 24: Hoare triple {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2932#true} is VALID [2022-04-08 07:29:43,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {2932#true} ~cond := #in~cond; {3016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:29:43,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {3016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:29:43,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:29:43,689 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:43,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:43,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:43,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:43,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3039#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (<= 0 main_~x~0) (= (* main_~a~0 main_~p~0) main_~q~0) (<= main_~x~0 5) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:43,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {3039#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (<= 0 main_~x~0) (= (* main_~a~0 main_~p~0) main_~q~0) (<= main_~x~0 5) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3039#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (<= 0 main_~x~0) (= (* main_~a~0 main_~p~0) main_~q~0) (<= main_~x~0 5) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 07:29:43,694 INFO L272 TraceCheckUtils]: 34: Hoare triple {3039#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (<= 0 main_~x~0) (= (* main_~a~0 main_~p~0) main_~q~0) (<= main_~x~0 5) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:29:43,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:29:43,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {3050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2933#false} is VALID [2022-04-08 07:29:43,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-04-08 07:29:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 07:29:43,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:30:04,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-04-08 07:30:04,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {3050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2933#false} is VALID [2022-04-08 07:30:04,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:30:04,159 INFO L272 TraceCheckUtils]: 34: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:30:04,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 07:30:04,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 07:30:04,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-08 07:30:04,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-08 07:30:04,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !!(0 != ~a~0 && 0 != ~b~0); {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-08 07:30:04,180 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} {2932#true} #77#return; {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-08 07:30:04,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:30:04,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {3095#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:30:04,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {2932#true} ~cond := #in~cond; {3095#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 07:30:04,181 INFO L272 TraceCheckUtils]: 24: Hoare triple {2932#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2932#true} is VALID [2022-04-08 07:30:04,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {2932#true} assume !false; {2932#true} is VALID [2022-04-08 07:30:04,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {2932#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2932#true} is VALID [2022-04-08 07:30:04,182 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2932#true} {2932#true} #75#return; {2932#true} is VALID [2022-04-08 07:30:04,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-08 07:30:04,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#true} assume !(0 == ~cond); {2932#true} is VALID [2022-04-08 07:30:04,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {2932#true} ~cond := #in~cond; {2932#true} is VALID [2022-04-08 07:30:04,182 INFO L272 TraceCheckUtils]: 17: Hoare triple {2932#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2932#true} is VALID [2022-04-08 07:30:04,182 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2932#true} {2932#true} #73#return; {2932#true} is VALID [2022-04-08 07:30:04,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-08 07:30:04,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#true} assume !(0 == ~cond); {2932#true} is VALID [2022-04-08 07:30:04,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {2932#true} ~cond := #in~cond; {2932#true} is VALID [2022-04-08 07:30:04,182 INFO L272 TraceCheckUtils]: 12: Hoare triple {2932#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2932#true} is VALID [2022-04-08 07:30:04,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {2932#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2932#true} is VALID [2022-04-08 07:30:04,182 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2932#true} {2932#true} #71#return; {2932#true} is VALID [2022-04-08 07:30:04,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-08 07:30:04,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {2932#true} assume !(0 == ~cond); {2932#true} is VALID [2022-04-08 07:30:04,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {2932#true} ~cond := #in~cond; {2932#true} is VALID [2022-04-08 07:30:04,183 INFO L272 TraceCheckUtils]: 6: Hoare triple {2932#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2932#true} is VALID [2022-04-08 07:30:04,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2932#true} is VALID [2022-04-08 07:30:04,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} call #t~ret6 := main(); {2932#true} is VALID [2022-04-08 07:30:04,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} #83#return; {2932#true} is VALID [2022-04-08 07:30:04,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-08 07:30:04,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#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(13, 2);call #Ultimate.allocInit(12, 3); {2932#true} is VALID [2022-04-08 07:30:04,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} call ULTIMATE.init(); {2932#true} is VALID [2022-04-08 07:30:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:30:04,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:30:04,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556495406] [2022-04-08 07:30:04,184 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:30:04,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595292118] [2022-04-08 07:30:04,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595292118] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:30:04,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:30:04,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2022-04-08 07:30:04,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:30:04,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [196777090] [2022-04-08 07:30:04,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [196777090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:30:04,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:30:04,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:30:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924430014] [2022-04-08 07:30:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:30:04,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-08 07:30:04,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:30:04,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 07:30:04,210 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-08 07:30:04,210 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:30:04,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:30:04,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:30:04,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-08 07:30:04,211 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 07:30:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:30:04,843 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2022-04-08 07:30:04,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 07:30:04,843 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-08 07:30:04,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:30:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 07:30:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2022-04-08 07:30:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 07:30:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2022-04-08 07:30:04,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 77 transitions. [2022-04-08 07:30:04,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:30:04,907 INFO L225 Difference]: With dead ends: 79 [2022-04-08 07:30:04,907 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 07:30:04,908 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:30:04,909 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:30:04,909 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 126 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 07:30:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 07:30:04,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-08 07:30:04,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:30:04,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:30:04,988 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:30:04,988 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:30:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:30:04,990 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-04-08 07:30:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-04-08 07:30:04,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:30:04,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:30:04,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 66 states. [2022-04-08 07:30:04,991 INFO L87 Difference]: Start difference. First operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 66 states. [2022-04-08 07:30:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:30:04,992 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-04-08 07:30:04,992 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-04-08 07:30:04,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:30:04,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:30:04,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:30:04,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:30:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:30:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-08 07:30:04,994 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 38 [2022-04-08 07:30:04,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:30:04,994 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2022-04-08 07:30:04,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 07:30:04,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 78 transitions. [2022-04-08 07:30:05,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:30:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-08 07:30:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 07:30:05,106 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:30:05,106 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:30:05,122 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-08 07:30:05,319 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-08 07:30:05,319 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:30:05,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:30:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash 901777418, now seen corresponding path program 1 times [2022-04-08 07:30:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:30:05,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1444303199] [2022-04-08 07:30:05,320 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:30:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash 901777418, now seen corresponding path program 2 times [2022-04-08 07:30:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:30:05,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946596225] [2022-04-08 07:30:05,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:30:05,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:30:05,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:30:05,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625625446] [2022-04-08 07:30:05,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:30:05,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:30:05,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:30:05,335 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-08 07:30:05,335 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-08 07:30:05,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:30:05,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:30:05,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-08 07:30:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:30:05,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:30:06,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:30:06,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946596225] [2022-04-08 07:30:06,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:30:06,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625625446] [2022-04-08 07:30:06,409 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-08 07:30:06,415 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-08 07:30:06,614 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-08 07:30:06,614 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: transformation to positive normal form unsound at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.positiveNormalForm(PolynomialRelation.java:434) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:477) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DerScout.transduceAtom(DerScout.java:101) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DerScout.transduceAtom(DerScout.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.CondisTermTransducer.transduceImmediately(CondisTermTransducer.java:67) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.TermTransducer$TermTransducerHelper.convert(TermTransducer.java:76) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.TermTransducer.transduce(TermTransducer.java:60) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:684) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:203) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 07:30:06,622 INFO L158 Benchmark]: Toolchain (without parser) took 173225.66ms. Allocated memory was 161.5MB in the beginning and 215.0MB in the end (delta: 53.5MB). Free memory was 112.1MB in the beginning and 168.2MB in the end (delta: -56.1MB). Peak memory consumption was 101.0MB. Max. memory is 8.0GB. [2022-04-08 07:30:06,623 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 161.5MB. Free memory was 128.6MB in the beginning and 128.6MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 07:30:06,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.33ms. Allocated memory is still 161.5MB. Free memory was 111.9MB in the beginning and 136.3MB in the end (delta: -24.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 07:30:06,623 INFO L158 Benchmark]: Boogie Preprocessor took 37.05ms. Allocated memory is still 161.5MB. Free memory was 136.3MB in the beginning and 134.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 07:30:06,623 INFO L158 Benchmark]: RCFGBuilder took 298.59ms. Allocated memory is still 161.5MB. Free memory was 134.6MB in the beginning and 121.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 07:30:06,624 INFO L158 Benchmark]: TraceAbstraction took 172626.54ms. Allocated memory was 161.5MB in the beginning and 215.0MB in the end (delta: 53.5MB). Free memory was 121.2MB in the beginning and 168.2MB in the end (delta: -47.0MB). Peak memory consumption was 110.9MB. Max. memory is 8.0GB. [2022-04-08 07:30:06,625 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 161.5MB. Free memory was 128.6MB in the beginning and 128.6MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 258.33ms. Allocated memory is still 161.5MB. Free memory was 111.9MB in the beginning and 136.3MB in the end (delta: -24.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.05ms. Allocated memory is still 161.5MB. Free memory was 136.3MB in the beginning and 134.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 298.59ms. Allocated memory is still 161.5MB. Free memory was 134.6MB in the beginning and 121.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 172626.54ms. Allocated memory was 161.5MB in the beginning and 215.0MB in the end (delta: 53.5MB). Free memory was 121.2MB in the beginning and 168.2MB in the end (delta: -47.0MB). Peak memory consumption was 110.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: transformation to positive normal form unsound de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: transformation to positive normal form unsound: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.positiveNormalForm(PolynomialRelation.java:434) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 07:30:06,659 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...