/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 11:06:56,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 11:06:56,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 11:06:56,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 11:06:56,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 11:06:56,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 11:06:56,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 11:06:56,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 11:06:56,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 11:06:56,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 11:06:56,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 11:06:56,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 11:06:56,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 11:06:56,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 11:06:56,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 11:06:56,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 11:06:56,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 11:06:56,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 11:06:56,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 11:06:56,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 11:06:56,097 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 11:06:56,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 11:06:56,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 11:06:56,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 11:06:56,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 11:06:56,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 11:06:56,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 11:06:56,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 11:06:56,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 11:06:56,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 11:06:56,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 11:06:56,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 11:06:56,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 11:06:56,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 11:06:56,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 11:06:56,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 11:06:56,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 11:06:56,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 11:06:56,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 11:06:56,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 11:06:56,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 11:06:56,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 11:06:56,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 11:06:56,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 11:06:56,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 11:06:56,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 11:06:56,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 11:06:56,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 11:06:56,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 11:06:56,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 11:06:56,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 11:06:56,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 11:06:56,127 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 11:06:56,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 11:06:56,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 11:06:56,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 11:06:56,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 11:06:56,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 11:06:56,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:06:56,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 11:06:56,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 11:06:56,129 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 11:06:56,129 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 11:06:56,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 11:06:56,129 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 11:06:56,129 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 11:06:56,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 11:06:56,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 11:06:56,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 11:06:56,365 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 11:06:56,366 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 11:06:56,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound5.c [2022-04-08 11:06:56,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d102da15/6cfdd7ca3e754b6fb7da32230f0308ea/FLAG73d152656 [2022-04-08 11:06:56,890 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 11:06:56,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound5.c [2022-04-08 11:06:56,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d102da15/6cfdd7ca3e754b6fb7da32230f0308ea/FLAG73d152656 [2022-04-08 11:06:57,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d102da15/6cfdd7ca3e754b6fb7da32230f0308ea [2022-04-08 11:06:57,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 11:06:57,275 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 11:06:57,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 11:06:57,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 11:06:57,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 11:06:57,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:06:57" (1/1) ... [2022-04-08 11:06:57,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77dc72d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:06:57, skipping insertion in model container [2022-04-08 11:06:57,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 11:06:57" (1/1) ... [2022-04-08 11:06:57,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 11:06:57,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 11:06:57,434 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/bresenham-ll_valuebound5.c[597,610] [2022-04-08 11:06:57,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:06:57,459 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 11:06:57,469 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/bresenham-ll_valuebound5.c[597,610] [2022-04-08 11:06:57,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 11:06:57,488 INFO L208 MainTranslator]: Completed translation [2022-04-08 11:06:57,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:06:57 WrapperNode [2022-04-08 11:06:57,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 11:06:57,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 11:06:57,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 11:06:57,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 11:06:57,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:06:57" (1/1) ... [2022-04-08 11:06:57,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:06:57" (1/1) ... [2022-04-08 11:06:57,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:06:57" (1/1) ... [2022-04-08 11:06:57,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:06:57" (1/1) ... [2022-04-08 11:06:57,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:06:57" (1/1) ... [2022-04-08 11:06:57,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:06:57" (1/1) ... [2022-04-08 11:06:57,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:06:57" (1/1) ... [2022-04-08 11:06:57,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 11:06:57,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 11:06:57,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 11:06:57,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 11:06:57,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:06:57" (1/1) ... [2022-04-08 11:06:57,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 11:06:57,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:06:57,549 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 11:06:57,553 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 11:06:57,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 11:06:57,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 11:06:57,588 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 11:06:57,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 11:06:57,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 11:06:57,589 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 11:06:57,589 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 11:06:57,589 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 11:06:57,589 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 11:06:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 11:06:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 11:06:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 11:06:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 11:06:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 11:06:57,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 11:06:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 11:06:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 11:06:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 11:06:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 11:06:57,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 11:06:57,649 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 11:06:57,650 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 11:06:57,805 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 11:06:57,811 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 11:06:57,811 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 11:06:57,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:06:57 BoogieIcfgContainer [2022-04-08 11:06:57,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 11:06:57,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 11:06:57,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 11:06:57,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 11:06:57,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 11:06:57" (1/3) ... [2022-04-08 11:06:57,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb67a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:06:57, skipping insertion in model container [2022-04-08 11:06:57,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 11:06:57" (2/3) ... [2022-04-08 11:06:57,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb67a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 11:06:57, skipping insertion in model container [2022-04-08 11:06:57,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 11:06:57" (3/3) ... [2022-04-08 11:06:57,820 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound5.c [2022-04-08 11:06:57,824 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 11:06:57,824 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 11:06:57,860 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 11:06:57,866 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 11:06:57,866 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 11:06:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:06:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 11:06:57,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:06:57,891 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:06:57,892 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:06:57,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:06:57,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 1 times [2022-04-08 11:06:57,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:06:57,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1111601193] [2022-04-08 11:06:57,915 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:06:57,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 2 times [2022-04-08 11:06:57,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:06:57,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025253599] [2022-04-08 11:06:57,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:06:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:06:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:06:58,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 11:06:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:06:58,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(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(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-08 11:06:58,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 11:06:58,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-08 11:06:58,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 11:06:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:06:58,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 11:06:58,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 11:06:58,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 11:06:58,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 11:06:58,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 11:06:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:06:58,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 11:06:58,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 11:06:58,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 11:06:58,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 11:06:58,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 11:06:58,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(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(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-08 11:06:58,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 11:06:58,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-08 11:06:58,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2022-04-08 11:06:58,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-08 11:06:58,143 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {35#true} is VALID [2022-04-08 11:06:58,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 11:06:58,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 11:06:58,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 11:06:58,147 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 11:06:58,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-08 11:06:58,147 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {35#true} is VALID [2022-04-08 11:06:58,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 11:06:58,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 11:06:58,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 11:06:58,150 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 11:06:58,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {36#false} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {36#false} is VALID [2022-04-08 11:06:58,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {36#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {36#false} is VALID [2022-04-08 11:06:58,151 INFO L272 TraceCheckUtils]: 19: Hoare triple {36#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {36#false} is VALID [2022-04-08 11:06:58,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-08 11:06:58,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-08 11:06:58,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-08 11:06:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 11:06:58,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:06:58,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025253599] [2022-04-08 11:06:58,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025253599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:06:58,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:06:58,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:06:58,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:06:58,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1111601193] [2022-04-08 11:06:58,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1111601193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:06:58,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:06:58,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 11:06:58,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796333665] [2022-04-08 11:06:58,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:06:58,172 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 11:06:58,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:06:58,177 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:06:58,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:06:58,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 11:06:58,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:06:58,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 11:06:58,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 11:06:58,271 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:06:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:58,408 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-08 11:06:58,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 11:06:58,409 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 11:06:58,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:06:58,410 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:06:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-08 11:06:58,418 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:06:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-08 11:06:58,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-04-08 11:06:58,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:06:58,508 INFO L225 Difference]: With dead ends: 57 [2022-04-08 11:06:58,508 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 11:06:58,511 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 11:06:58,513 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:06:58,514 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 11:06:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 11:06:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 11:06:58,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:06:58,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:06:58,559 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:06:58,560 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:06:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:58,570 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 11:06:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 11:06:58,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:06:58,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:06:58,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-08 11:06:58,574 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-08 11:06:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:58,577 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 11:06:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 11:06:58,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:06:58,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:06:58,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:06:58,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:06:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 11:06:58,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-08 11:06:58,582 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-08 11:06:58,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:06:58,582 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-08 11:06:58,582 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 11:06:58,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-08 11:06:58,619 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 11:06:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 11:06:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 11:06:58,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:06:58,621 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:06:58,622 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 11:06:58,622 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:06:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:06:58,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 1 times [2022-04-08 11:06:58,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:06:58,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1043614533] [2022-04-08 11:06:58,631 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:06:58,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 2 times [2022-04-08 11:06:58,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:06:58,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641960710] [2022-04-08 11:06:58,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:06:58,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:06:58,655 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:06:58,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1666326140] [2022-04-08 11:06:58,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:06:58,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:06:58,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:06:58,658 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 11:06:58,666 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 11:06:58,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 11:06:58,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:06:58,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 11:06:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:06:58,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:06:58,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2022-04-08 11:06:58,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#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(15, 2);call #Ultimate.allocInit(12, 3); {273#true} is VALID [2022-04-08 11:06:58,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-08 11:06:58,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #69#return; {273#true} is VALID [2022-04-08 11:06:58,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret8 := main(); {273#true} is VALID [2022-04-08 11:06:58,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {273#true} is VALID [2022-04-08 11:06:58,949 INFO L272 TraceCheckUtils]: 6: Hoare triple {273#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {273#true} is VALID [2022-04-08 11:06:58,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-08 11:06:58,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-08 11:06:58,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-08 11:06:58,951 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {273#true} {273#true} #61#return; {273#true} is VALID [2022-04-08 11:06:58,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {273#true} is VALID [2022-04-08 11:06:58,951 INFO L272 TraceCheckUtils]: 12: Hoare triple {273#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {273#true} is VALID [2022-04-08 11:06:58,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-08 11:06:58,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-08 11:06:58,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-08 11:06:58,955 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {273#true} {273#true} #63#return; {273#true} is VALID [2022-04-08 11:06:58,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {273#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {329#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:06:58,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {329#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {333#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-08 11:06:58,959 INFO L272 TraceCheckUtils]: 19: Hoare triple {333#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:06:58,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:06:58,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {274#false} is VALID [2022-04-08 11:06:58,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-08 11:06:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 11:06:58,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 11:06:58,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:06:58,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641960710] [2022-04-08 11:06:58,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:06:58,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666326140] [2022-04-08 11:06:58,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666326140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:06:58,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:06:58,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:06:58,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:06:58,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1043614533] [2022-04-08 11:06:58,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1043614533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:06:58,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:06:58,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 11:06:58,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572293899] [2022-04-08 11:06:58,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:06:58,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-08 11:06:58,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:06:58,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 11:06:58,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:06:58,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 11:06:58,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:06:58,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 11:06:58,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:06:58,993 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 11:06:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:59,243 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-08 11:06:59,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 11:06:59,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-08 11:06:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:06:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 11:06:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 11:06:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 11:06:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 11:06:59,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-08 11:06:59,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:06:59,298 INFO L225 Difference]: With dead ends: 39 [2022-04-08 11:06:59,298 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 11:06:59,299 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 11:06:59,300 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:06:59,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:06:59,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 11:06:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-08 11:06:59,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:06:59,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 11:06:59,315 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 11:06:59,315 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 11:06:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:59,318 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 11:06:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 11:06:59,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:06:59,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:06:59,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-08 11:06:59,319 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-08 11:06:59,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:06:59,322 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 11:06:59,322 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 11:06:59,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:06:59,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:06:59,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:06:59,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:06:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 11:06:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-08 11:06:59,326 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 23 [2022-04-08 11:06:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:06:59,326 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-08 11:06:59,327 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 11:06:59,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-08 11:06:59,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:06:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-08 11:06:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 11:06:59,371 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:06:59,372 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:06:59,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 11:06:59,595 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 11:06:59,596 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:06:59,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:06:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 1 times [2022-04-08 11:06:59,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:06:59,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1325728464] [2022-04-08 11:06:59,598 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:06:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 2 times [2022-04-08 11:06:59,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:06:59,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686625629] [2022-04-08 11:06:59,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:06:59,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:06:59,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:06:59,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645964674] [2022-04-08 11:06:59,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:06:59,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:06:59,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:06:59,645 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 11:06:59,647 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 11:06:59,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:06:59,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:06:59,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 11:06:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:06:59,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:07:00,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-08 11:07:00,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#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(15, 2);call #Ultimate.allocInit(12, 3); {567#true} is VALID [2022-04-08 11:07:00,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:07:00,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-08 11:07:00,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-08 11:07:00,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {567#true} is VALID [2022-04-08 11:07:00,150 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {567#true} is VALID [2022-04-08 11:07:00,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 11:07:00,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 11:07:00,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:07:00,152 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-08 11:07:00,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {567#true} is VALID [2022-04-08 11:07:00,152 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {567#true} is VALID [2022-04-08 11:07:00,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} ~cond := #in~cond; {611#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:07:00,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {611#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {615#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:07:00,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {615#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {615#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:07:00,154 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {615#(not (= |assume_abort_if_not_#in~cond| 0))} {567#true} #63#return; {622#(and (<= 0 main_~Y~0) (<= main_~Y~0 5))} is VALID [2022-04-08 11:07:00,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#(and (<= 0 main_~Y~0) (<= main_~Y~0 5))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5))} is VALID [2022-04-08 11:07:00,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5))} is VALID [2022-04-08 11:07:00,156 INFO L272 TraceCheckUtils]: 19: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {567#true} is VALID [2022-04-08 11:07:00,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 11:07:00,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 11:07:00,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:07:00,158 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {567#true} {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5))} #65#return; {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5))} is VALID [2022-04-08 11:07:00,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5))} assume !!(~x~0 <= ~X~0); {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5))} is VALID [2022-04-08 11:07:00,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {651#(and (= main_~x~0 0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:07:00,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {651#(and (= main_~x~0 0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {655#(and (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:07:00,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {655#(and (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {659#(and (= main_~xy~0 0) (<= 0 main_~Y~0) (= main_~Y~0 main_~yx~0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:07:00,162 INFO L272 TraceCheckUtils]: 28: Hoare triple {659#(and (= main_~xy~0 0) (<= 0 main_~Y~0) (= main_~Y~0 main_~yx~0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:07:00,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:00,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-08 11:07:00,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-08 11:07:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 11:07:00,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:07:00,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-08 11:07:00,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-08 11:07:00,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:00,453 INFO L272 TraceCheckUtils]: 28: Hoare triple {683#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:07:00,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {683#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:07:00,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {691#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:07:00,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {691#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 11:07:00,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:07:00,459 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {567#true} {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #65#return; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:07:00,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:07:00,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 11:07:00,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 11:07:00,460 INFO L272 TraceCheckUtils]: 19: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {567#true} is VALID [2022-04-08 11:07:00,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:07:00,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {567#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:07:00,464 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {567#true} {567#true} #63#return; {567#true} is VALID [2022-04-08 11:07:00,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:07:00,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 11:07:00,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 11:07:00,465 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {567#true} is VALID [2022-04-08 11:07:00,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {567#true} is VALID [2022-04-08 11:07:00,465 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-08 11:07:00,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:07:00,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-08 11:07:00,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-08 11:07:00,466 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {567#true} is VALID [2022-04-08 11:07:00,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {567#true} is VALID [2022-04-08 11:07:00,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-08 11:07:00,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-08 11:07:00,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-08 11:07:00,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#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(15, 2);call #Ultimate.allocInit(12, 3); {567#true} is VALID [2022-04-08 11:07:00,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-08 11:07:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 11:07:00,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:07:00,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686625629] [2022-04-08 11:07:00,468 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:07:00,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645964674] [2022-04-08 11:07:00,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645964674] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:07:00,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:07:00,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-04-08 11:07:00,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:07:00,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1325728464] [2022-04-08 11:07:00,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1325728464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:07:00,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:07:00,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 11:07:00,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905164106] [2022-04-08 11:07:00,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:07:00,470 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-08 11:07:00,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:07:00,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:07:00,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:07:00,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 11:07:00,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:07:00,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 11:07:00,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:07:00,506 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:07:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:07:01,192 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-08 11:07:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 11:07:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-08 11:07:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:07:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:07:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-08 11:07:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:07:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-08 11:07:01,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2022-04-08 11:07:01,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:07:01,247 INFO L225 Difference]: With dead ends: 48 [2022-04-08 11:07:01,247 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 11:07:01,248 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-08 11:07:01,249 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 11:07:01,249 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 150 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 11:07:01,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 11:07:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-08 11:07:01,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:07:01,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:07:01,287 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:07:01,287 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:07:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:07:01,290 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-08 11:07:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-08 11:07:01,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:07:01,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:07:01,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-08 11:07:01,291 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-08 11:07:01,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:07:01,294 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-08 11:07:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-08 11:07:01,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:07:01,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:07:01,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:07:01,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:07:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:07:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-08 11:07:01,297 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 32 [2022-04-08 11:07:01,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:07:01,297 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-08 11:07:01,298 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:07:01,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-08 11:07:01,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:07:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-08 11:07:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 11:07:01,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:07:01,349 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:07:01,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 11:07:01,555 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 11:07:01,556 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:07:01,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:07:01,556 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 1 times [2022-04-08 11:07:01,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:07:01,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695880559] [2022-04-08 11:07:01,557 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:07:01,557 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 2 times [2022-04-08 11:07:01,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:07:01,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472904731] [2022-04-08 11:07:01,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:07:01,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:07:01,579 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:07:01,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078227007] [2022-04-08 11:07:01,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:07:01,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:07:01,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:07:01,581 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 11:07:01,592 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 11:07:01,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:07:01,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:07:01,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 11:07:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:07:01,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:07:01,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-08 11:07:01,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#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(15, 2);call #Ultimate.allocInit(12, 3); {1048#true} is VALID [2022-04-08 11:07:01,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:07:01,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-08 11:07:01,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-08 11:07:01,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1048#true} is VALID [2022-04-08 11:07:01,947 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {1048#true} is VALID [2022-04-08 11:07:01,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 11:07:01,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 11:07:01,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:07:01,948 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-08 11:07:01,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1048#true} is VALID [2022-04-08 11:07:01,948 INFO L272 TraceCheckUtils]: 12: Hoare triple {1048#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {1048#true} is VALID [2022-04-08 11:07:01,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 11:07:01,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 11:07:01,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:07:01,949 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-08 11:07:01,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:07:01,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:07:01,950 INFO L272 TraceCheckUtils]: 19: Hoare triple {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1048#true} is VALID [2022-04-08 11:07:01,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 11:07:01,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 11:07:01,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:07:01,952 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1048#true} {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:07:01,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1126#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:07:01,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1130#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:07:01,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {1130#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1134#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:07:01,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {1134#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1138#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-08 11:07:01,957 INFO L272 TraceCheckUtils]: 28: Hoare triple {1138#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:07:01,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:01,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-08 11:07:01,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-08 11:07:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 11:07:01,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:07:02,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-08 11:07:02,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-08 11:07:02,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:02,202 INFO L272 TraceCheckUtils]: 28: Hoare triple {1162#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:07:02,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1162#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:07:02,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {1170#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:07:02,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1170#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 11:07:02,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:07:02,339 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1048#true} {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} #65#return; {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-08 11:07:02,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:07:02,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 11:07:02,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 11:07:02,339 INFO L272 TraceCheckUtils]: 19: Hoare triple {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1048#true} is VALID [2022-04-08 11:07:02,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-08 11:07:02,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-08 11:07:02,341 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-08 11:07:02,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:07:02,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 11:07:02,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 11:07:02,341 INFO L272 TraceCheckUtils]: 12: Hoare triple {1048#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {1048#true} is VALID [2022-04-08 11:07:02,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1048#true} is VALID [2022-04-08 11:07:02,342 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-08 11:07:02,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:07:02,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-08 11:07:02,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-08 11:07:02,343 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {1048#true} is VALID [2022-04-08 11:07:02,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1048#true} is VALID [2022-04-08 11:07:02,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-08 11:07:02,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-08 11:07:02,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-08 11:07:02,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#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(15, 2);call #Ultimate.allocInit(12, 3); {1048#true} is VALID [2022-04-08 11:07:02,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-08 11:07:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 11:07:02,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:07:02,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472904731] [2022-04-08 11:07:02,345 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:07:02,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078227007] [2022-04-08 11:07:02,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078227007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:07:02,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:07:02,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-08 11:07:02,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:07:02,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695880559] [2022-04-08 11:07:02,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695880559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:07:02,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:07:02,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 11:07:02,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539100384] [2022-04-08 11:07:02,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:07:02,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-08 11:07:02,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:07:02,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:07:02,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:07:02,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 11:07:02,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:07:02,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 11:07:02,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 11:07:02,382 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:07:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:07:02,847 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-08 11:07:02,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 11:07:02,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-08 11:07:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:07:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:07:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-08 11:07:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:07:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-08 11:07:02,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2022-04-08 11:07:02,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:07:02,900 INFO L225 Difference]: With dead ends: 56 [2022-04-08 11:07:02,900 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 11:07:02,901 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-08 11:07:02,902 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:07:02,902 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:07:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 11:07:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-04-08 11:07:02,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:07:02,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 11:07:02,958 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 11:07:02,959 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 11:07:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:07:02,962 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-08 11:07:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-08 11:07:02,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:07:02,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:07:02,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 54 states. [2022-04-08 11:07:02,965 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 54 states. [2022-04-08 11:07:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:07:02,970 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-08 11:07:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-08 11:07:02,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:07:02,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:07:02,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:07:02,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:07:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 11:07:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-08 11:07:02,981 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 32 [2022-04-08 11:07:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:07:02,982 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-08 11:07:02,982 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 11:07:02,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-08 11:07:03,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:07:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-08 11:07:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 11:07:03,057 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:07:03,058 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:07:03,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 11:07:03,269 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 11:07:03,269 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:07:03,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:07:03,269 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 1 times [2022-04-08 11:07:03,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:07:03,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [600431366] [2022-04-08 11:07:03,270 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:07:03,270 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 2 times [2022-04-08 11:07:03,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:07:03,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171709936] [2022-04-08 11:07:03,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:07:03,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:07:03,287 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:07:03,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [191540260] [2022-04-08 11:07:03,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:07:03,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:07:03,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:07:03,289 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 11:07:03,327 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 11:07:03,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:07:03,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:07:03,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 11:07:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:07:03,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:07:16,774 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:07:26,811 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:07:32,833 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:07:41,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-08 11:07:41,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#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(15, 2);call #Ultimate.allocInit(12, 3); {1576#true} is VALID [2022-04-08 11:07:41,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:07:41,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-08 11:07:41,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-08 11:07:41,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1576#true} is VALID [2022-04-08 11:07:41,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {1576#true} is VALID [2022-04-08 11:07:41,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 11:07:41,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 11:07:41,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:07:41,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-08 11:07:41,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1576#true} is VALID [2022-04-08 11:07:41,261 INFO L272 TraceCheckUtils]: 12: Hoare triple {1576#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {1576#true} is VALID [2022-04-08 11:07:41,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 11:07:41,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 11:07:41,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:07:41,262 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-08 11:07:41,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {1576#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1632#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:07:41,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {1632#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1632#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:07:41,267 INFO L272 TraceCheckUtils]: 19: Hoare triple {1632#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-08 11:07:41,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:41,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:41,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:41,268 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} {1632#(and (= main_~x~0 0) (= main_~y~0 0))} #65#return; {1632#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:07:41,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {1632#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1656#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 11:07:41,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {1656#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1660#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 11:07:41,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {1660#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1664#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:07:41,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {1664#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1668#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 11:07:41,270 INFO L272 TraceCheckUtils]: 28: Hoare triple {1668#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-08 11:07:41,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:41,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:41,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:41,272 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} {1668#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {1684#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0))} is VALID [2022-04-08 11:07:41,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {1684#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0))} assume !(~x~0 <= ~X~0); {1688#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-08 11:07:41,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1692#(and (= (+ (- 1) main_~y~0) 0) (<= 0 main_~X~0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (<= (div main_~xy~0 main_~y~0) 1) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 1) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} is VALID [2022-04-08 11:07:41,282 INFO L272 TraceCheckUtils]: 35: Hoare triple {1692#(and (= (+ (- 1) main_~y~0) 0) (<= 0 main_~X~0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (<= (div main_~xy~0 main_~y~0) 1) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 1) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:07:41,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:41,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-08 11:07:41,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-08 11:07:41,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 11:07:41,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:07:54,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-08 11:07:54,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-08 11:07:54,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:07:54,547 INFO L272 TraceCheckUtils]: 35: Hoare triple {1716#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:07:54,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {1720#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1716#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:07:54,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {1724#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {1720#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-08 11:07:54,549 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} {1728#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {1724#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-08 11:07:54,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:54,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {1738#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:07:54,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} ~cond := #in~cond; {1738#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:07:54,553 INFO L272 TraceCheckUtils]: 28: Hoare triple {1728#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-08 11:07:54,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {1745#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1728#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-08 11:07:54,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {1749#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_16 main_~y~0)) (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2))))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1745#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-08 11:07:54,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {1753#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* (* v_main_~x~0_16 (+ main_~y~0 1)) 2) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ (* (* v_main_~x~0_16 main_~Y~0) 2) 2 (* main_~y~0 2) (* main_~Y~0 2)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1749#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_16 main_~y~0)) (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2))))))} is VALID [2022-04-08 11:07:54,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {1576#true} assume !!(~x~0 <= ~X~0); {1753#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* (* v_main_~x~0_16 (+ main_~y~0 1)) 2) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ (* (* v_main_~x~0_16 main_~Y~0) 2) 2 (* main_~y~0 2) (* main_~Y~0 2)))))} is VALID [2022-04-08 11:07:54,563 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1576#true} {1576#true} #65#return; {1576#true} is VALID [2022-04-08 11:07:54,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:07:54,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 11:07:54,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 11:07:54,563 INFO L272 TraceCheckUtils]: 19: Hoare triple {1576#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-08 11:07:54,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1576#true} is VALID [2022-04-08 11:07:54,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {1576#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1576#true} is VALID [2022-04-08 11:07:54,563 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-08 11:07:54,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:07:54,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 11:07:54,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 11:07:54,564 INFO L272 TraceCheckUtils]: 12: Hoare triple {1576#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {1576#true} is VALID [2022-04-08 11:07:54,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1576#true} is VALID [2022-04-08 11:07:54,564 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-08 11:07:54,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:07:54,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-08 11:07:54,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-08 11:07:54,565 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {1576#true} is VALID [2022-04-08 11:07:54,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1576#true} is VALID [2022-04-08 11:07:54,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-08 11:07:54,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-08 11:07:54,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-08 11:07:54,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#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(15, 2);call #Ultimate.allocInit(12, 3); {1576#true} is VALID [2022-04-08 11:07:54,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-08 11:07:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 11:07:54,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:07:54,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171709936] [2022-04-08 11:07:54,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:07:54,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191540260] [2022-04-08 11:07:54,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191540260] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:07:54,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:07:54,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-08 11:07:54,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:07:54,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [600431366] [2022-04-08 11:07:54,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [600431366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:07:54,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:07:54,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 11:07:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342744304] [2022-04-08 11:07:54,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:07:54,568 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-04-08 11:07:54,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:07:54,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:07:54,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:07:54,609 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 11:07:54,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:07:54,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 11:07:54,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-04-08 11:07:54,610 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:07:57,545 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 11:07:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:07:57,855 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-08 11:07:57,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 11:07:57,856 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-04-08 11:07:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:07:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:07:57,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-08 11:07:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:07:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-08 11:07:57,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 53 transitions. [2022-04-08 11:07:57,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:07:57,913 INFO L225 Difference]: With dead ends: 61 [2022-04-08 11:07:57,913 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 11:07:57,914 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-04-08 11:07:57,914 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:07:57,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 219 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 11:07:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 11:07:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-04-08 11:07:57,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:07:57,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:07:57,966 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:07:57,967 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:07:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:07:57,969 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-08 11:07:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-08 11:07:57,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:07:57,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:07:57,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-08 11:07:57,970 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-08 11:07:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:07:57,972 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-08 11:07:57,972 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-08 11:07:57,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:07:57,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:07:57,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:07:57,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:07:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 11:07:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-08 11:07:57,975 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 39 [2022-04-08 11:07:57,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:07:57,975 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-08 11:07:57,975 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:07:57,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-08 11:07:58,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:07:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-08 11:07:58,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 11:07:58,040 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:07:58,040 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:07:58,058 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 11:07:58,243 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 11:07:58,244 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:07:58,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:07:58,245 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 3 times [2022-04-08 11:07:58,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:07:58,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [871262911] [2022-04-08 11:07:58,245 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:07:58,245 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 4 times [2022-04-08 11:07:58,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:07:58,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583408146] [2022-04-08 11:07:58,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:07:58,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:07:58,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:07:58,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242079940] [2022-04-08 11:07:58,271 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:07:58,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:07:58,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:07:58,274 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 11:07:58,275 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 11:07:58,318 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:07:58,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:07:58,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 11:07:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:07:58,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:08:23,240 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:08:27,911 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:08:29,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-08 11:08:29,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#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(15, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-08 11:08:29,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 11:08:29,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-08 11:08:29,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-08 11:08:29,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2155#true} is VALID [2022-04-08 11:08:29,426 INFO L272 TraceCheckUtils]: 6: Hoare triple {2155#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {2155#true} is VALID [2022-04-08 11:08:29,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} ~cond := #in~cond; {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:08:29,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:08:29,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:08:29,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} {2155#true} #61#return; {2192#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:08:29,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {2192#(and (<= 0 main_~X~0) (<= main_~X~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2192#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:08:29,428 INFO L272 TraceCheckUtils]: 12: Hoare triple {2192#(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)); {2155#true} is VALID [2022-04-08 11:08:29,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#true} ~cond := #in~cond; {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:08:29,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:08:29,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:08:29,429 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} {2192#(and (<= 0 main_~X~0) (<= main_~X~0 5))} #63#return; {2211#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:08:29,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {2211#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} is VALID [2022-04-08 11:08:29,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} is VALID [2022-04-08 11:08:29,431 INFO L272 TraceCheckUtils]: 19: Hoare triple {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-08 11:08:29,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-08 11:08:29,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-08 11:08:29,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 11:08:29,436 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2155#true} {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} #65#return; {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} is VALID [2022-04-08 11:08:29,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} assume !!(~x~0 <= ~X~0); {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} is VALID [2022-04-08 11:08:29,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {2215#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2240#(and (= main_~x~0 0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:08:29,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {2240#(and (= main_~x~0 0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2244#(and (<= 1 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:08:29,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {2244#(and (<= 1 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2248#(and (<= 1 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:08:29,440 INFO L272 TraceCheckUtils]: 28: Hoare triple {2248#(and (<= 1 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-08 11:08:29,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#true} ~cond := #in~cond; {2255#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:29,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {2255#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:29,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:29,442 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} {2248#(and (<= 1 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #65#return; {2266#(and (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:08:29,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {2266#(and (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {2266#(and (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:08:29,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {2266#(and (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0) (<= main_~Y~0 5) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2273#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 5) (= main_~y~0 0) (= (+ (* main_~Y~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:08:29,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {2273#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 5) (= main_~y~0 0) (= (+ (* main_~Y~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2277#(and (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= main_~X~0 5) (= main_~y~0 0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:08:29,450 INFO L290 TraceCheckUtils]: 36: Hoare triple {2277#(and (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= main_~X~0 5) (= main_~y~0 0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2281#(and (= main_~xy~0 0) (or (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (* main_~Y~0 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (<= 2 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (not (= main_~Y~0 0)))) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:08:29,453 INFO L272 TraceCheckUtils]: 37: Hoare triple {2281#(and (= main_~xy~0 0) (or (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (* main_~Y~0 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (<= 2 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (not (= main_~Y~0 0)))) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:08:29,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:29,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-08 11:08:29,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-08 11:08:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 11:08:29,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:08:36,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-08 11:08:36,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {2289#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-08 11:08:36,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:36,249 INFO L272 TraceCheckUtils]: 37: Hoare triple {2305#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:08:36,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {2309#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2305#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:08:36,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {2313#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2309#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:08:36,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {2317#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2313#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 11:08:36,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {2317#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {2317#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-08 11:08:36,255 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} {2324#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #65#return; {2317#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-08 11:08:36,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:36,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {2334#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:36,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#true} ~cond := #in~cond; {2334#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:08:36,256 INFO L272 TraceCheckUtils]: 28: Hoare triple {2324#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-08 11:08:36,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {2155#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2324#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-08 11:08:36,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {2155#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2155#true} is VALID [2022-04-08 11:08:36,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {2155#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2155#true} is VALID [2022-04-08 11:08:36,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {2155#true} assume !!(~x~0 <= ~X~0); {2155#true} is VALID [2022-04-08 11:08:36,257 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2155#true} {2155#true} #65#return; {2155#true} is VALID [2022-04-08 11:08:36,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 11:08:36,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-08 11:08:36,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-08 11:08:36,257 INFO L272 TraceCheckUtils]: 19: Hoare triple {2155#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-08 11:08:36,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {2155#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2155#true} is VALID [2022-04-08 11:08:36,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2155#true} is VALID [2022-04-08 11:08:36,258 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2155#true} {2155#true} #63#return; {2155#true} is VALID [2022-04-08 11:08:36,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 11:08:36,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-08 11:08:36,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-08 11:08:36,258 INFO L272 TraceCheckUtils]: 12: Hoare triple {2155#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {2155#true} is VALID [2022-04-08 11:08:36,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {2155#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2155#true} is VALID [2022-04-08 11:08:36,259 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID [2022-04-08 11:08:36,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 11:08:36,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-08 11:08:36,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-08 11:08:36,259 INFO L272 TraceCheckUtils]: 6: Hoare triple {2155#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {2155#true} is VALID [2022-04-08 11:08:36,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2155#true} is VALID [2022-04-08 11:08:36,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-08 11:08:36,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-08 11:08:36,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-08 11:08:36,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#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(15, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-08 11:08:36,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-08 11:08:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 11:08:36,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:08:36,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583408146] [2022-04-08 11:08:36,261 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:08:36,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242079940] [2022-04-08 11:08:36,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242079940] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:08:36,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:08:36,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 24 [2022-04-08 11:08:36,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:08:36,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [871262911] [2022-04-08 11:08:36,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [871262911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:08:36,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:08:36,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 11:08:36,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958041302] [2022-04-08 11:08:36,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:08:36,263 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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 41 [2022-04-08 11:08:36,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:08:36,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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 11:08:36,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:36,311 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 11:08:36,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:36,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 11:08:36,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2022-04-08 11:08:36,312 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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 11:08:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:38,715 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-08 11:08:38,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 11:08:38,716 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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 41 [2022-04-08 11:08:38,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:08:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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 11:08:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-08 11:08:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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 11:08:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-08 11:08:38,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 80 transitions. [2022-04-08 11:08:38,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:38,838 INFO L225 Difference]: With dead ends: 81 [2022-04-08 11:08:38,838 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 11:08:38,838 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2022-04-08 11:08:38,839 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 11:08:38,839 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 147 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 11:08:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 11:08:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-08 11:08:38,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:08:38,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 11:08:38,946 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 11:08:38,946 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 11:08:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:38,949 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-08 11:08:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-08 11:08:38,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:38,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:38,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 61 states. [2022-04-08 11:08:38,950 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 61 states. [2022-04-08 11:08:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:38,952 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-08 11:08:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-08 11:08:38,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:38,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:38,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:08:38,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:08:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 11:08:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-04-08 11:08:38,956 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 41 [2022-04-08 11:08:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:08:38,956 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-04-08 11:08:38,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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 11:08:38,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 66 transitions. [2022-04-08 11:08:39,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-08 11:08:39,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 11:08:39,070 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:08:39,070 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:08:39,088 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 11:08:39,275 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 11:08:39,276 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:08:39,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:08:39,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 1 times [2022-04-08 11:08:39,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:39,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1654045854] [2022-04-08 11:08:39,276 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:08:39,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 2 times [2022-04-08 11:08:39,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:08:39,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522932593] [2022-04-08 11:08:39,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:08:39,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:08:39,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:08:39,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402539392] [2022-04-08 11:08:39,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:08:39,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:08:39,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:08:39,303 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 11:08:39,312 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 11:08:39,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:08:39,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:08:39,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 11:08:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:08:39,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:08:40,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {2842#true} call ULTIMATE.init(); {2842#true} is VALID [2022-04-08 11:08:40,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {2842#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(15, 2);call #Ultimate.allocInit(12, 3); {2842#true} is VALID [2022-04-08 11:08:40,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 11:08:40,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2842#true} {2842#true} #69#return; {2842#true} is VALID [2022-04-08 11:08:40,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {2842#true} call #t~ret8 := main(); {2842#true} is VALID [2022-04-08 11:08:40,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {2842#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2842#true} is VALID [2022-04-08 11:08:40,092 INFO L272 TraceCheckUtils]: 6: Hoare triple {2842#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {2842#true} is VALID [2022-04-08 11:08:40,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {2842#true} ~cond := #in~cond; {2868#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:08:40,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {2868#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2872#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:08:40,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {2872#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2872#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:08:40,093 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2872#(not (= |assume_abort_if_not_#in~cond| 0))} {2842#true} #61#return; {2879#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:08:40,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {2879#(and (<= 0 main_~X~0) (<= main_~X~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2879#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:08:40,094 INFO L272 TraceCheckUtils]: 12: Hoare triple {2879#(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)); {2842#true} is VALID [2022-04-08 11:08:40,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-08 11:08:40,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-08 11:08:40,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 11:08:40,095 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2842#true} {2879#(and (<= 0 main_~X~0) (<= main_~X~0 5))} #63#return; {2879#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:08:40,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {2879#(and (<= 0 main_~X~0) (<= main_~X~0 5))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:08:40,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:08:40,097 INFO L272 TraceCheckUtils]: 19: Hoare triple {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2842#true} is VALID [2022-04-08 11:08:40,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-08 11:08:40,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-08 11:08:40,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 11:08:40,098 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2842#true} {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} #65#return; {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:08:40,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:08:40,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {2901#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2926#(and (= main_~x~0 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:08:40,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {2926#(and (= main_~x~0 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2930#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:08:40,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {2930#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2934#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 11:08:40,102 INFO L272 TraceCheckUtils]: 28: Hoare triple {2934#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2842#true} is VALID [2022-04-08 11:08:40,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {2842#true} ~cond := #in~cond; {2941#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:40,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {2941#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:40,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:40,110 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} {2934#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {2930#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:08:40,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {2930#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2930#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:08:40,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {2930#(and (= (+ (- 1) main_~x~0) 0) (< (* main_~Y~0 2) main_~X~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2958#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5))} is VALID [2022-04-08 11:08:40,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {2958#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2962#(and (= (+ (- 1) main_~x~0) 1) (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5))} is VALID [2022-04-08 11:08:40,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {2962#(and (= (+ (- 1) main_~x~0) 1) (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2966#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= (* main_~Y~0 2) main_~yx~0) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5))} is VALID [2022-04-08 11:08:40,114 INFO L272 TraceCheckUtils]: 37: Hoare triple {2966#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= (* main_~Y~0 2) main_~yx~0) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:08:40,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:40,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {2974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2843#false} is VALID [2022-04-08 11:08:40,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {2843#false} assume !false; {2843#false} is VALID [2022-04-08 11:08:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 11:08:40,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:08:43,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {2843#false} assume !false; {2843#false} is VALID [2022-04-08 11:08:43,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {2974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2843#false} is VALID [2022-04-08 11:08:43,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:43,220 INFO L272 TraceCheckUtils]: 37: Hoare triple {2990#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:08:43,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {2994#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2990#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:08:43,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {2998#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2994#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:08:43,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {3002#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2998#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 11:08:43,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {3002#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {3002#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-08 11:08:43,229 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} {3009#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {3002#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-08 11:08:43,229 INFO L290 TraceCheckUtils]: 31: Hoare triple {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:43,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {3019#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2945#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:43,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {2842#true} ~cond := #in~cond; {3019#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:08:43,230 INFO L272 TraceCheckUtils]: 28: Hoare triple {3009#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2842#true} is VALID [2022-04-08 11:08:43,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {2842#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3009#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-08 11:08:43,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {2842#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2842#true} is VALID [2022-04-08 11:08:43,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {2842#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2842#true} is VALID [2022-04-08 11:08:43,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {2842#true} assume !!(~x~0 <= ~X~0); {2842#true} is VALID [2022-04-08 11:08:43,232 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2842#true} {2842#true} #65#return; {2842#true} is VALID [2022-04-08 11:08:43,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 11:08:43,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-08 11:08:43,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-08 11:08:43,232 INFO L272 TraceCheckUtils]: 19: Hoare triple {2842#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2842#true} is VALID [2022-04-08 11:08:43,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {2842#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2842#true} is VALID [2022-04-08 11:08:43,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {2842#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2842#true} is VALID [2022-04-08 11:08:43,232 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2842#true} {2842#true} #63#return; {2842#true} is VALID [2022-04-08 11:08:43,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 11:08:43,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-08 11:08:43,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-08 11:08:43,233 INFO L272 TraceCheckUtils]: 12: Hoare triple {2842#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {2842#true} is VALID [2022-04-08 11:08:43,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {2842#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2842#true} is VALID [2022-04-08 11:08:43,233 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2842#true} {2842#true} #61#return; {2842#true} is VALID [2022-04-08 11:08:43,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 11:08:43,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {2842#true} assume !(0 == ~cond); {2842#true} is VALID [2022-04-08 11:08:43,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {2842#true} ~cond := #in~cond; {2842#true} is VALID [2022-04-08 11:08:43,234 INFO L272 TraceCheckUtils]: 6: Hoare triple {2842#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {2842#true} is VALID [2022-04-08 11:08:43,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {2842#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2842#true} is VALID [2022-04-08 11:08:43,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {2842#true} call #t~ret8 := main(); {2842#true} is VALID [2022-04-08 11:08:43,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2842#true} {2842#true} #69#return; {2842#true} is VALID [2022-04-08 11:08:43,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {2842#true} assume true; {2842#true} is VALID [2022-04-08 11:08:43,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {2842#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(15, 2);call #Ultimate.allocInit(12, 3); {2842#true} is VALID [2022-04-08 11:08:43,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {2842#true} call ULTIMATE.init(); {2842#true} is VALID [2022-04-08 11:08:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 11:08:43,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:08:43,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522932593] [2022-04-08 11:08:43,235 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:08:43,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402539392] [2022-04-08 11:08:43,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402539392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:08:43,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:08:43,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-08 11:08:43,236 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:08:43,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1654045854] [2022-04-08 11:08:43,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1654045854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:08:43,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:08:43,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 11:08:43,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008577754] [2022-04-08 11:08:43,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:08:43,237 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-08 11:08:43,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:08:43,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 11:08:43,282 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 11:08:43,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 11:08:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:43,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 11:08:43,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-04-08 11:08:43,284 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 11:08:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:44,313 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2022-04-08 11:08:44,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 11:08:44,313 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-08 11:08:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:08:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 11:08:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2022-04-08 11:08:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 11:08:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 70 transitions. [2022-04-08 11:08:44,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 70 transitions. [2022-04-08 11:08:44,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:44,394 INFO L225 Difference]: With dead ends: 83 [2022-04-08 11:08:44,394 INFO L226 Difference]: Without dead ends: 70 [2022-04-08 11:08:44,394 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2022-04-08 11:08:44,395 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:08:44,395 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 140 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 11:08:44,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-08 11:08:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-08 11:08:44,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:08:44,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 11:08:44,507 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 11:08:44,508 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 11:08:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:44,510 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-04-08 11:08:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-04-08 11:08:44,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:44,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:44,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 70 states. [2022-04-08 11:08:44,511 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 70 states. [2022-04-08 11:08:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:44,513 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-04-08 11:08:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-04-08 11:08:44,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:44,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:44,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:08:44,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:08:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 11:08:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-04-08 11:08:44,516 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 41 [2022-04-08 11:08:44,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:08:44,516 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-04-08 11:08:44,517 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 11:08:44,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 75 transitions. [2022-04-08 11:08:44,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-04-08 11:08:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 11:08:44,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:08:44,648 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:08:44,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 11:08:44,848 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 11:08:44,849 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:08:44,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:08:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 3 times [2022-04-08 11:08:44,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:44,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1477768389] [2022-04-08 11:08:44,850 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:08:44,850 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 4 times [2022-04-08 11:08:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:08:44,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689001237] [2022-04-08 11:08:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:08:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:08:44,862 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:08:44,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269470089] [2022-04-08 11:08:44,863 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:08:44,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:08:44,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:08:44,864 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 11:08:44,884 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 11:08:44,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:08:44,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:08:44,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-08 11:08:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:08:44,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:08:45,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {3563#true} call ULTIMATE.init(); {3563#true} is VALID [2022-04-08 11:08:45,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {3563#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(15, 2);call #Ultimate.allocInit(12, 3); {3563#true} is VALID [2022-04-08 11:08:45,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 11:08:45,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3563#true} {3563#true} #69#return; {3563#true} is VALID [2022-04-08 11:08:45,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {3563#true} call #t~ret8 := main(); {3563#true} is VALID [2022-04-08 11:08:45,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {3563#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {3563#true} is VALID [2022-04-08 11:08:45,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {3563#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {3563#true} is VALID [2022-04-08 11:08:45,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-08 11:08:45,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-08 11:08:45,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 11:08:45,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3563#true} {3563#true} #61#return; {3563#true} is VALID [2022-04-08 11:08:45,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {3563#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3563#true} is VALID [2022-04-08 11:08:45,214 INFO L272 TraceCheckUtils]: 12: Hoare triple {3563#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {3563#true} is VALID [2022-04-08 11:08:45,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-08 11:08:45,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-08 11:08:45,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 11:08:45,214 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3563#true} {3563#true} #63#return; {3563#true} is VALID [2022-04-08 11:08:45,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {3563#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:08:45,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:08:45,222 INFO L272 TraceCheckUtils]: 19: Hoare triple {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3563#true} is VALID [2022-04-08 11:08:45,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-08 11:08:45,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-08 11:08:45,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 11:08:45,223 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3563#true} {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:08:45,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:08:45,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {3619#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3644#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:08:45,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {3644#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3648#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:08:45,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {3648#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3652#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 11:08:45,226 INFO L272 TraceCheckUtils]: 28: Hoare triple {3652#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3563#true} is VALID [2022-04-08 11:08:45,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {3563#true} ~cond := #in~cond; {3659#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:45,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {3659#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:45,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:45,228 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} {3652#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {3648#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:08:45,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {3648#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !!(~x~0 <= ~X~0); {3648#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:08:45,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {3648#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3676#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0))} is VALID [2022-04-08 11:08:45,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {3676#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3680#(and (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0))} is VALID [2022-04-08 11:08:45,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {3680#(and (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3684#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= (* main_~Y~0 2) main_~yx~0) (= main_~X~0 main_~xy~0))} is VALID [2022-04-08 11:08:45,234 INFO L272 TraceCheckUtils]: 37: Hoare triple {3684#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= (* main_~Y~0 2) main_~yx~0) (= main_~X~0 main_~xy~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3688#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:08:45,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {3688#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:45,235 INFO L290 TraceCheckUtils]: 39: Hoare triple {3692#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3564#false} is VALID [2022-04-08 11:08:45,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {3564#false} assume !false; {3564#false} is VALID [2022-04-08 11:08:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 11:08:45,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:08:50,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {3564#false} assume !false; {3564#false} is VALID [2022-04-08 11:08:50,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {3692#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3564#false} is VALID [2022-04-08 11:08:50,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {3688#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3692#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:50,067 INFO L272 TraceCheckUtils]: 37: Hoare triple {3708#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3688#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:08:50,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {3712#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3708#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:08:50,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {3716#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3712#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:08:50,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {3712#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3716#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 11:08:50,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {3712#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {3712#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:08:50,073 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} {3726#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {3712#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:08:50,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:50,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {3736#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3663#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:08:50,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {3563#true} ~cond := #in~cond; {3736#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:08:50,074 INFO L272 TraceCheckUtils]: 28: Hoare triple {3726#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3563#true} is VALID [2022-04-08 11:08:50,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {3563#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3726#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-08 11:08:50,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {3563#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3563#true} is VALID [2022-04-08 11:08:50,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {3563#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3563#true} is VALID [2022-04-08 11:08:50,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {3563#true} assume !!(~x~0 <= ~X~0); {3563#true} is VALID [2022-04-08 11:08:50,075 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3563#true} {3563#true} #65#return; {3563#true} is VALID [2022-04-08 11:08:50,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 11:08:50,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-08 11:08:50,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-08 11:08:50,076 INFO L272 TraceCheckUtils]: 19: Hoare triple {3563#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3563#true} is VALID [2022-04-08 11:08:50,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {3563#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3563#true} is VALID [2022-04-08 11:08:50,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {3563#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3563#true} is VALID [2022-04-08 11:08:50,076 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3563#true} {3563#true} #63#return; {3563#true} is VALID [2022-04-08 11:08:50,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 11:08:50,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-08 11:08:50,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-08 11:08:50,076 INFO L272 TraceCheckUtils]: 12: Hoare triple {3563#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {3563#true} is VALID [2022-04-08 11:08:50,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {3563#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3563#true} is VALID [2022-04-08 11:08:50,076 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3563#true} {3563#true} #61#return; {3563#true} is VALID [2022-04-08 11:08:50,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 11:08:50,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {3563#true} assume !(0 == ~cond); {3563#true} is VALID [2022-04-08 11:08:50,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {3563#true} ~cond := #in~cond; {3563#true} is VALID [2022-04-08 11:08:50,077 INFO L272 TraceCheckUtils]: 6: Hoare triple {3563#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {3563#true} is VALID [2022-04-08 11:08:50,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {3563#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {3563#true} is VALID [2022-04-08 11:08:50,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {3563#true} call #t~ret8 := main(); {3563#true} is VALID [2022-04-08 11:08:50,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3563#true} {3563#true} #69#return; {3563#true} is VALID [2022-04-08 11:08:50,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {3563#true} assume true; {3563#true} is VALID [2022-04-08 11:08:50,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {3563#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(15, 2);call #Ultimate.allocInit(12, 3); {3563#true} is VALID [2022-04-08 11:08:50,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {3563#true} call ULTIMATE.init(); {3563#true} is VALID [2022-04-08 11:08:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 11:08:50,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:08:50,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689001237] [2022-04-08 11:08:50,078 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:08:50,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269470089] [2022-04-08 11:08:50,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269470089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:08:50,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:08:50,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-08 11:08:50,079 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:08:50,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1477768389] [2022-04-08 11:08:50,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1477768389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:08:50,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:08:50,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 11:08:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559323217] [2022-04-08 11:08:50,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:08:50,080 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-08 11:08:50,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:08:50,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:08:50,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:50,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 11:08:50,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:50,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 11:08:50,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-04-08 11:08:50,116 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:08:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:51,184 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-04-08 11:08:51,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 11:08:51,184 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-08 11:08:51,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:08:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:08:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-08 11:08:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:08:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-08 11:08:51,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-08 11:08:51,239 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 11:08:51,241 INFO L225 Difference]: With dead ends: 84 [2022-04-08 11:08:51,241 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 11:08:51,241 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-08 11:08:51,242 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:08:51,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 192 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 11:08:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 11:08:51,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-04-08 11:08:51,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:08:51,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:08:51,358 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:08:51,358 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:08:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:51,361 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-04-08 11:08:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-08 11:08:51,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:51,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:51,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 82 states. [2022-04-08 11:08:51,362 INFO L87 Difference]: Start difference. First operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 82 states. [2022-04-08 11:08:51,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:51,364 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-04-08 11:08:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-08 11:08:51,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:51,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:51,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:08:51,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:08:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:08:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-04-08 11:08:51,368 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 41 [2022-04-08 11:08:51,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:08:51,368 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-04-08 11:08:51,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:08:51,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 84 transitions. [2022-04-08 11:08:51,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-04-08 11:08:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 11:08:51,496 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:08:51,496 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:08:51,514 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 11:08:51,699 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 11:08:51,700 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:08:51,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:08:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 3 times [2022-04-08 11:08:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:51,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1908399229] [2022-04-08 11:08:51,700 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:08:51,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 4 times [2022-04-08 11:08:51,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:08:51,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705171856] [2022-04-08 11:08:51,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:08:51,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:08:51,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:08:51,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908637513] [2022-04-08 11:08:51,711 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:08:51,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:08:51,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:08:51,712 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:08:51,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 11:08:51,768 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:08:51,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:08:51,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 11:08:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:08:51,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:08:52,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {4320#true} call ULTIMATE.init(); {4320#true} is VALID [2022-04-08 11:08:52,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {4320#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(15, 2);call #Ultimate.allocInit(12, 3); {4320#true} is VALID [2022-04-08 11:08:52,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 11:08:52,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4320#true} {4320#true} #69#return; {4320#true} is VALID [2022-04-08 11:08:52,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {4320#true} call #t~ret8 := main(); {4320#true} is VALID [2022-04-08 11:08:52,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {4320#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4320#true} is VALID [2022-04-08 11:08:52,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {4320#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {4320#true} is VALID [2022-04-08 11:08:52,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 11:08:52,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 11:08:52,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 11:08:52,156 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4320#true} {4320#true} #61#return; {4320#true} is VALID [2022-04-08 11:08:52,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {4320#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4320#true} is VALID [2022-04-08 11:08:52,157 INFO L272 TraceCheckUtils]: 12: Hoare triple {4320#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {4320#true} is VALID [2022-04-08 11:08:52,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 11:08:52,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 11:08:52,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 11:08:52,157 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4320#true} {4320#true} #63#return; {4320#true} is VALID [2022-04-08 11:08:52,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {4320#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:08:52,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:08:52,158 INFO L272 TraceCheckUtils]: 19: Hoare triple {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4320#true} is VALID [2022-04-08 11:08:52,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 11:08:52,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 11:08:52,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 11:08:52,159 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4320#true} {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:08:52,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:08:52,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {4376#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4401#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:08:52,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {4401#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:08:52,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:08:52,161 INFO L272 TraceCheckUtils]: 28: Hoare triple {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4320#true} is VALID [2022-04-08 11:08:52,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 11:08:52,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 11:08:52,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 11:08:52,162 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4320#true} {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #65#return; {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:08:52,163 INFO L290 TraceCheckUtils]: 33: Hoare triple {4405#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !!(~x~0 <= ~X~0); {4427#(and (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:08:52,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {4427#(and (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4431#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)))} is VALID [2022-04-08 11:08:52,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {4431#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~x~0) 0) (<= main_~x~0 main_~X~0) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4435#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:08:52,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {4435#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4439#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~xy~0 (* main_~X~0 2)) (not (< (* main_~Y~0 2) main_~X~0)) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0))} is VALID [2022-04-08 11:08:52,166 INFO L272 TraceCheckUtils]: 37: Hoare triple {4439#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~xy~0 (* main_~X~0 2)) (not (< (* main_~Y~0 2) main_~X~0)) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:08:52,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {4443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:52,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {4447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4321#false} is VALID [2022-04-08 11:08:52,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {4321#false} assume !false; {4321#false} is VALID [2022-04-08 11:08:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 11:08:52,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:08:52,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {4321#false} assume !false; {4321#false} is VALID [2022-04-08 11:08:52,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {4447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4321#false} is VALID [2022-04-08 11:08:52,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {4443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:08:52,529 INFO L272 TraceCheckUtils]: 37: Hoare triple {4463#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:08:52,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {4467#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4463#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:08:52,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {4471#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4467#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:08:52,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {4467#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4471#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 11:08:52,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {4478#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {4467#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:08:52,536 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4320#true} {4478#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} #65#return; {4478#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-08 11:08:52,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 11:08:52,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 11:08:52,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 11:08:52,536 INFO L272 TraceCheckUtils]: 28: Hoare triple {4478#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4320#true} is VALID [2022-04-08 11:08:52,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {4478#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4478#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-08 11:08:52,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {4500#(or (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4478#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-08 11:08:52,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {4504#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4500#(or (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-08 11:08:52,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {4504#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !!(~x~0 <= ~X~0); {4504#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-08 11:08:52,543 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4320#true} {4504#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} #65#return; {4504#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-08 11:08:52,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 11:08:52,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 11:08:52,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 11:08:52,543 INFO L272 TraceCheckUtils]: 19: Hoare triple {4504#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4320#true} is VALID [2022-04-08 11:08:52,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {4504#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4504#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-08 11:08:52,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {4320#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4504#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-08 11:08:52,549 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4320#true} {4320#true} #63#return; {4320#true} is VALID [2022-04-08 11:08:52,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 11:08:52,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 11:08:52,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 11:08:52,549 INFO L272 TraceCheckUtils]: 12: Hoare triple {4320#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {4320#true} is VALID [2022-04-08 11:08:52,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {4320#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4320#true} is VALID [2022-04-08 11:08:52,549 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4320#true} {4320#true} #61#return; {4320#true} is VALID [2022-04-08 11:08:52,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 11:08:52,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {4320#true} assume !(0 == ~cond); {4320#true} is VALID [2022-04-08 11:08:52,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {4320#true} ~cond := #in~cond; {4320#true} is VALID [2022-04-08 11:08:52,550 INFO L272 TraceCheckUtils]: 6: Hoare triple {4320#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {4320#true} is VALID [2022-04-08 11:08:52,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {4320#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4320#true} is VALID [2022-04-08 11:08:52,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {4320#true} call #t~ret8 := main(); {4320#true} is VALID [2022-04-08 11:08:52,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4320#true} {4320#true} #69#return; {4320#true} is VALID [2022-04-08 11:08:52,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {4320#true} assume true; {4320#true} is VALID [2022-04-08 11:08:52,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {4320#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(15, 2);call #Ultimate.allocInit(12, 3); {4320#true} is VALID [2022-04-08 11:08:52,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {4320#true} call ULTIMATE.init(); {4320#true} is VALID [2022-04-08 11:08:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 11:08:52,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:08:52,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705171856] [2022-04-08 11:08:52,551 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:08:52,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908637513] [2022-04-08 11:08:52,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908637513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:08:52,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:08:52,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2022-04-08 11:08:52,552 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:08:52,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1908399229] [2022-04-08 11:08:52,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1908399229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:08:52,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:08:52,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 11:08:52,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028467392] [2022-04-08 11:08:52,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:08:52,553 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-08 11:08:52,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:08:52,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:08:52,591 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 11:08:52,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 11:08:52,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:52,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 11:08:52,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-08 11:08:52,592 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:08:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:53,416 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-04-08 11:08:53,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 11:08:53,416 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-08 11:08:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:08:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:08:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 11:08:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:08:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-08 11:08:53,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-08 11:08:53,472 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 11:08:53,474 INFO L225 Difference]: With dead ends: 91 [2022-04-08 11:08:53,474 INFO L226 Difference]: Without dead ends: 89 [2022-04-08 11:08:53,474 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-08 11:08:53,475 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 11:08:53,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 184 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 11:08:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-08 11:08:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2022-04-08 11:08:53,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:08:53,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:08:53,597 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:08:53,597 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:08:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:53,600 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-08 11:08:53,600 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-08 11:08:53,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:53,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:53,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-04-08 11:08:53,601 INFO L87 Difference]: Start difference. First operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 89 states. [2022-04-08 11:08:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:53,604 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-04-08 11:08:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-08 11:08:53,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:53,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:53,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:08:53,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:08:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:08:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-04-08 11:08:53,607 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 41 [2022-04-08 11:08:53,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:08:53,607 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-04-08 11:08:53,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 11:08:53,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 84 transitions. [2022-04-08 11:08:53,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-04-08 11:08:53,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 11:08:53,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:08:53,739 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:08:53,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-08 11:08:53,943 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 11:08:53,944 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:08:53,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:08:53,944 INFO L85 PathProgramCache]: Analyzing trace with hash -143142008, now seen corresponding path program 1 times [2022-04-08 11:08:53,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:53,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [466979040] [2022-04-08 11:08:53,944 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:08:53,944 INFO L85 PathProgramCache]: Analyzing trace with hash -143142008, now seen corresponding path program 2 times [2022-04-08 11:08:53,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:08:53,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405487632] [2022-04-08 11:08:53,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:08:53,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:08:53,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:08:53,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [660186054] [2022-04-08 11:08:53,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:08:53,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:08:53,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:08:53,966 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:08:53,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 11:08:54,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:08:54,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:08:54,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:08:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:08:54,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:08:58,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {5102#true} call ULTIMATE.init(); {5102#true} is VALID [2022-04-08 11:08:58,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {5102#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(15, 2);call #Ultimate.allocInit(12, 3); {5102#true} is VALID [2022-04-08 11:08:58,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 11:08:58,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5102#true} {5102#true} #69#return; {5102#true} is VALID [2022-04-08 11:08:58,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {5102#true} call #t~ret8 := main(); {5102#true} is VALID [2022-04-08 11:08:58,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {5102#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {5102#true} is VALID [2022-04-08 11:08:58,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {5102#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {5102#true} is VALID [2022-04-08 11:08:58,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 11:08:58,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 11:08:58,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 11:08:58,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5102#true} {5102#true} #61#return; {5102#true} is VALID [2022-04-08 11:08:58,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {5102#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5102#true} is VALID [2022-04-08 11:08:58,297 INFO L272 TraceCheckUtils]: 12: Hoare triple {5102#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {5102#true} is VALID [2022-04-08 11:08:58,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 11:08:58,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 11:08:58,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 11:08:58,297 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5102#true} {5102#true} #63#return; {5102#true} is VALID [2022-04-08 11:08:58,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {5102#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-08 11:08:58,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-08 11:08:58,298 INFO L272 TraceCheckUtils]: 19: Hoare triple {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5102#true} is VALID [2022-04-08 11:08:58,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 11:08:58,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 11:08:58,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 11:08:58,299 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5102#true} {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} #65#return; {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-08 11:08:58,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !!(~x~0 <= ~X~0); {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-08 11:08:58,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {5158#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5183#(and (<= main_~x~0 0) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-08 11:08:58,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {5183#(and (<= main_~x~0 0) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-08 11:08:58,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-08 11:08:58,304 INFO L272 TraceCheckUtils]: 28: Hoare triple {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5102#true} is VALID [2022-04-08 11:08:58,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 11:08:58,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 11:08:58,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 11:08:58,305 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5102#true} {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} #65#return; {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-08 11:08:58,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} assume !!(~x~0 <= ~X~0); {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-08 11:08:58,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {5187#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {5212#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 1))} is VALID [2022-04-08 11:08:58,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {5212#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} is VALID [2022-04-08 11:08:58,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} is VALID [2022-04-08 11:08:58,308 INFO L272 TraceCheckUtils]: 37: Hoare triple {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5102#true} is VALID [2022-04-08 11:08:58,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 11:08:58,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 11:08:58,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 11:08:58,309 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5102#true} {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} #65#return; {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} is VALID [2022-04-08 11:08:58,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {5216#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} assume !(~x~0 <= ~X~0); {5103#false} is VALID [2022-04-08 11:08:58,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {5103#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {5103#false} is VALID [2022-04-08 11:08:58,311 INFO L272 TraceCheckUtils]: 44: Hoare triple {5103#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {5103#false} is VALID [2022-04-08 11:08:58,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {5103#false} ~cond := #in~cond; {5103#false} is VALID [2022-04-08 11:08:58,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {5103#false} assume 0 == ~cond; {5103#false} is VALID [2022-04-08 11:08:58,311 INFO L290 TraceCheckUtils]: 47: Hoare triple {5103#false} assume !false; {5103#false} is VALID [2022-04-08 11:08:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 11:08:58,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:08:58,669 INFO L290 TraceCheckUtils]: 47: Hoare triple {5103#false} assume !false; {5103#false} is VALID [2022-04-08 11:08:58,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {5103#false} assume 0 == ~cond; {5103#false} is VALID [2022-04-08 11:08:58,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {5103#false} ~cond := #in~cond; {5103#false} is VALID [2022-04-08 11:08:58,670 INFO L272 TraceCheckUtils]: 44: Hoare triple {5103#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {5103#false} is VALID [2022-04-08 11:08:58,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {5103#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {5103#false} is VALID [2022-04-08 11:08:58,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {5268#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {5103#false} is VALID [2022-04-08 11:08:58,671 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5102#true} {5268#(<= main_~x~0 main_~X~0)} #65#return; {5268#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 11:08:58,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 11:08:58,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 11:08:58,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 11:08:58,671 INFO L272 TraceCheckUtils]: 37: Hoare triple {5268#(<= main_~x~0 main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5102#true} is VALID [2022-04-08 11:08:58,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {5268#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5268#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 11:08:58,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {5290#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5268#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 11:08:58,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {5290#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-08 11:08:58,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} assume !!(~x~0 <= ~X~0); {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 11:08:58,683 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5102#true} {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} #65#return; {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 11:08:58,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 11:08:58,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 11:08:58,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 11:08:58,683 INFO L272 TraceCheckUtils]: 28: Hoare triple {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5102#true} is VALID [2022-04-08 11:08:58,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 11:08:58,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {5319#(or (<= (+ main_~x~0 2) main_~X~0) (not (< main_~v~0 0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5294#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 11:08:58,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5319#(or (<= (+ main_~x~0 2) main_~X~0) (not (< main_~v~0 0)))} is VALID [2022-04-08 11:08:58,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} assume !!(~x~0 <= ~X~0); {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-08 11:08:58,687 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5102#true} {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} #65#return; {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-08 11:08:58,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 11:08:58,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 11:08:58,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 11:08:58,687 INFO L272 TraceCheckUtils]: 19: Hoare triple {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5102#true} is VALID [2022-04-08 11:08:58,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-08 11:08:58,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {5102#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5323#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-08 11:08:58,689 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5102#true} {5102#true} #63#return; {5102#true} is VALID [2022-04-08 11:08:58,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 11:08:58,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 11:08:58,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 11:08:58,690 INFO L272 TraceCheckUtils]: 12: Hoare triple {5102#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {5102#true} is VALID [2022-04-08 11:08:58,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {5102#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5102#true} is VALID [2022-04-08 11:08:58,690 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5102#true} {5102#true} #61#return; {5102#true} is VALID [2022-04-08 11:08:58,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 11:08:58,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {5102#true} assume !(0 == ~cond); {5102#true} is VALID [2022-04-08 11:08:58,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {5102#true} ~cond := #in~cond; {5102#true} is VALID [2022-04-08 11:08:58,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {5102#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {5102#true} is VALID [2022-04-08 11:08:58,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {5102#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {5102#true} is VALID [2022-04-08 11:08:58,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {5102#true} call #t~ret8 := main(); {5102#true} is VALID [2022-04-08 11:08:58,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5102#true} {5102#true} #69#return; {5102#true} is VALID [2022-04-08 11:08:58,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {5102#true} assume true; {5102#true} is VALID [2022-04-08 11:08:58,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {5102#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(15, 2);call #Ultimate.allocInit(12, 3); {5102#true} is VALID [2022-04-08 11:08:58,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {5102#true} call ULTIMATE.init(); {5102#true} is VALID [2022-04-08 11:08:58,691 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 11:08:58,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:08:58,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405487632] [2022-04-08 11:08:58,691 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:08:58,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660186054] [2022-04-08 11:08:58,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660186054] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:08:58,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:08:58,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 11:08:58,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:08:58,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [466979040] [2022-04-08 11:08:58,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [466979040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:08:58,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:08:58,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 11:08:58,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470887334] [2022-04-08 11:08:58,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:08:58,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-08 11:08:58,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:08:58,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:08:58,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:58,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 11:08:58,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:58,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 11:08:58,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:08:58,725 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:08:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:59,144 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-04-08 11:08:59,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 11:08:59,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-08 11:08:59,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:08:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:08:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-08 11:08:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:08:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-08 11:08:59,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-08 11:08:59,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:59,203 INFO L225 Difference]: With dead ends: 92 [2022-04-08 11:08:59,203 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 11:08:59,204 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 11:08:59,204 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:08:59,205 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 103 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:08:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 11:08:59,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-04-08 11:08:59,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:08:59,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 82 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:08:59,347 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 82 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:08:59,348 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 82 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:08:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:59,351 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-04-08 11:08:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-04-08 11:08:59,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:59,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:59,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-08 11:08:59,352 INFO L87 Difference]: Start difference. First operand has 82 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 84 states. [2022-04-08 11:08:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:08:59,354 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-04-08 11:08:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-04-08 11:08:59,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:08:59,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:08:59,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:08:59,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:08:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 61 states have internal predecessors, (65), 13 states have call successors, (13), 10 states have call predecessors, (13), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:08:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2022-04-08 11:08:59,357 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 48 [2022-04-08 11:08:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:08:59,357 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2022-04-08 11:08:59,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:08:59,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 89 transitions. [2022-04-08 11:08:59,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:08:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-04-08 11:08:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 11:08:59,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:08:59,516 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:08:59,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 11:08:59,716 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 11:08:59,716 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:08:59,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:08:59,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 3 times [2022-04-08 11:08:59,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:08:59,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1845905312] [2022-04-08 11:08:59,717 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:08:59,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 4 times [2022-04-08 11:08:59,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:08:59,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445217597] [2022-04-08 11:08:59,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:08:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:08:59,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:08:59,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1674976559] [2022-04-08 11:08:59,732 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:08:59,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:08:59,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:08:59,734 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:08:59,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 11:08:59,773 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:08:59,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:08:59,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 11:08:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:08:59,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:09:00,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {5917#true} call ULTIMATE.init(); {5917#true} is VALID [2022-04-08 11:09:00,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {5917#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(15, 2);call #Ultimate.allocInit(12, 3); {5917#true} is VALID [2022-04-08 11:09:00,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 11:09:00,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5917#true} {5917#true} #69#return; {5917#true} is VALID [2022-04-08 11:09:00,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {5917#true} call #t~ret8 := main(); {5917#true} is VALID [2022-04-08 11:09:00,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {5917#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {5917#true} is VALID [2022-04-08 11:09:00,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {5917#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {5917#true} is VALID [2022-04-08 11:09:00,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 11:09:00,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 11:09:00,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 11:09:00,502 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5917#true} {5917#true} #61#return; {5917#true} is VALID [2022-04-08 11:09:00,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {5917#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5917#true} is VALID [2022-04-08 11:09:00,502 INFO L272 TraceCheckUtils]: 12: Hoare triple {5917#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {5917#true} is VALID [2022-04-08 11:09:00,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 11:09:00,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 11:09:00,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 11:09:00,502 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5917#true} {5917#true} #63#return; {5917#true} is VALID [2022-04-08 11:09:00,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {5917#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:09:00,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:09:00,503 INFO L272 TraceCheckUtils]: 19: Hoare triple {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5917#true} is VALID [2022-04-08 11:09:00,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 11:09:00,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 11:09:00,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 11:09:00,504 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5917#true} {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:09:00,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:09:00,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {5973#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5998#(and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:09:00,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {5998#(and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6002#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:09:00,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {6002#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6002#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:09:00,506 INFO L272 TraceCheckUtils]: 28: Hoare triple {6002#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5917#true} is VALID [2022-04-08 11:09:00,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {5917#true} ~cond := #in~cond; {6012#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:09:00,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {6012#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:00,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:00,508 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} {6002#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {6002#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:09:00,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {6002#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {6026#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:09:00,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {6026#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6030#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= main_~x~0 1))} is VALID [2022-04-08 11:09:00,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {6030#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6034#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:09:00,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {6034#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6038#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:09:00,510 INFO L272 TraceCheckUtils]: 37: Hoare triple {6038#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5917#true} is VALID [2022-04-08 11:09:00,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {5917#true} ~cond := #in~cond; {6012#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:09:00,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {6012#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:00,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:00,512 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} {6038#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #65#return; {6034#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:09:00,512 INFO L290 TraceCheckUtils]: 42: Hoare triple {6034#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {6057#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:09:00,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {6057#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {6061#(and (= main_~y~0 2) (= (* main_~y~0 2) main_~xy~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0) (not (<= 2 main_~X~0)))} is VALID [2022-04-08 11:09:00,514 INFO L272 TraceCheckUtils]: 44: Hoare triple {6061#(and (= main_~y~0 2) (= (* main_~y~0 2) main_~xy~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 4) (* main_~Y~0 (- 4)))) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0) (not (<= 2 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {6065#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:09:00,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {6065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:09:00,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {6069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5918#false} is VALID [2022-04-08 11:09:00,515 INFO L290 TraceCheckUtils]: 47: Hoare triple {5918#false} assume !false; {5918#false} is VALID [2022-04-08 11:09:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 11:09:00,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:09:01,322 INFO L290 TraceCheckUtils]: 47: Hoare triple {5918#false} assume !false; {5918#false} is VALID [2022-04-08 11:09:01,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {6069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5918#false} is VALID [2022-04-08 11:09:01,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {6065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:09:01,324 INFO L272 TraceCheckUtils]: 44: Hoare triple {6085#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {6065#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:09:01,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {6089#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {6085#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:09:01,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {6093#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {6089#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-08 11:09:01,326 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} {6097#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {6093#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-08 11:09:01,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:01,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {6107#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6016#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:01,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {5917#true} ~cond := #in~cond; {6107#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:09:01,328 INFO L272 TraceCheckUtils]: 37: Hoare triple {6097#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5917#true} is VALID [2022-04-08 11:09:01,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {6114#(or (<= main_~x~0 main_~X~0) (not (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6097#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-08 11:09:01,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {6118#(or (not (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6114#(or (<= main_~x~0 main_~X~0) (not (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-08 11:09:01,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {6122#(or (= (+ (* main_~Y~0 main_~x~0 2) (* (- 2) main_~X~0) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0) (not (= (+ (* (- 2) main_~X~0) main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* main_~X~0 (- 3)) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6118#(or (not (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 11:09:01,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {5917#true} assume !!(~x~0 <= ~X~0); {6122#(or (= (+ (* main_~Y~0 main_~x~0 2) (* (- 2) main_~X~0) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0) (not (= (+ (* (- 2) main_~X~0) main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* main_~X~0 (- 3)) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))))} is VALID [2022-04-08 11:09:01,594 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5917#true} {5917#true} #65#return; {5917#true} is VALID [2022-04-08 11:09:01,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 11:09:01,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 11:09:01,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 11:09:01,594 INFO L272 TraceCheckUtils]: 28: Hoare triple {5917#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5917#true} is VALID [2022-04-08 11:09:01,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {5917#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5917#true} is VALID [2022-04-08 11:09:01,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {5917#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5917#true} is VALID [2022-04-08 11:09:01,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {5917#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5917#true} is VALID [2022-04-08 11:09:01,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {5917#true} assume !!(~x~0 <= ~X~0); {5917#true} is VALID [2022-04-08 11:09:01,595 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5917#true} {5917#true} #65#return; {5917#true} is VALID [2022-04-08 11:09:01,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 11:09:01,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 11:09:01,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 11:09:01,595 INFO L272 TraceCheckUtils]: 19: Hoare triple {5917#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5917#true} is VALID [2022-04-08 11:09:01,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {5917#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5917#true} is VALID [2022-04-08 11:09:01,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {5917#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5917#true} is VALID [2022-04-08 11:09:01,595 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5917#true} {5917#true} #63#return; {5917#true} is VALID [2022-04-08 11:09:01,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 11:09:01,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 11:09:01,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 11:09:01,596 INFO L272 TraceCheckUtils]: 12: Hoare triple {5917#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {5917#true} is VALID [2022-04-08 11:09:01,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {5917#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5917#true} is VALID [2022-04-08 11:09:01,596 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5917#true} {5917#true} #61#return; {5917#true} is VALID [2022-04-08 11:09:01,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 11:09:01,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {5917#true} assume !(0 == ~cond); {5917#true} is VALID [2022-04-08 11:09:01,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {5917#true} ~cond := #in~cond; {5917#true} is VALID [2022-04-08 11:09:01,596 INFO L272 TraceCheckUtils]: 6: Hoare triple {5917#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {5917#true} is VALID [2022-04-08 11:09:01,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {5917#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {5917#true} is VALID [2022-04-08 11:09:01,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {5917#true} call #t~ret8 := main(); {5917#true} is VALID [2022-04-08 11:09:01,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5917#true} {5917#true} #69#return; {5917#true} is VALID [2022-04-08 11:09:01,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {5917#true} assume true; {5917#true} is VALID [2022-04-08 11:09:01,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {5917#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(15, 2);call #Ultimate.allocInit(12, 3); {5917#true} is VALID [2022-04-08 11:09:01,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {5917#true} call ULTIMATE.init(); {5917#true} is VALID [2022-04-08 11:09:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 11:09:01,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:09:01,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445217597] [2022-04-08 11:09:01,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:09:01,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674976559] [2022-04-08 11:09:01,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674976559] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:09:01,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:09:01,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2022-04-08 11:09:01,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:09:01,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1845905312] [2022-04-08 11:09:01,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1845905312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:09:01,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:09:01,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 11:09:01,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861370320] [2022-04-08 11:09:01,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:09:01,599 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-08 11:09:01,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:09:01,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:09:01,650 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 11:09:01,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 11:09:01,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:09:01,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 11:09:01,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-04-08 11:09:01,651 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:09:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:09:02,808 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-04-08 11:09:02,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:09:02,809 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-08 11:09:02,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:09:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:09:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-08 11:09:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:09:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-08 11:09:02,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2022-04-08 11:09:02,864 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 11:09:02,866 INFO L225 Difference]: With dead ends: 96 [2022-04-08 11:09:02,866 INFO L226 Difference]: Without dead ends: 88 [2022-04-08 11:09:02,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2022-04-08 11:09:02,867 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:09:02,867 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 189 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 11:09:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-08 11:09:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2022-04-08 11:09:02,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:09:02,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:09:02,999 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:09:02,999 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:09:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:09:03,001 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-08 11:09:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-08 11:09:03,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:09:03,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:09:03,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 88 states. [2022-04-08 11:09:03,002 INFO L87 Difference]: Start difference. First operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 88 states. [2022-04-08 11:09:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:09:03,004 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-08 11:09:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-08 11:09:03,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:09:03,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:09:03,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:09:03,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:09:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:09:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-04-08 11:09:03,006 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 48 [2022-04-08 11:09:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:09:03,007 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-04-08 11:09:03,007 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:09:03,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 85 transitions. [2022-04-08 11:09:03,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:09:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-04-08 11:09:03,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:09:03,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:09:03,163 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:09:03,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 11:09:03,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 11:09:03,364 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:09:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:09:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 5 times [2022-04-08 11:09:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:09:03,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1334878686] [2022-04-08 11:09:03,364 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:09:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 6 times [2022-04-08 11:09:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:09:03,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802657748] [2022-04-08 11:09:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:09:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:09:03,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:09:03,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292723539] [2022-04-08 11:09:03,380 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:09:03,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:09:03,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:09:03,382 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:09:03,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 11:09:03,424 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 11:09:03,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:09:03,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 11:09:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:09:03,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:09:13,766 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:09:22,614 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:09:22,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {6761#true} call ULTIMATE.init(); {6761#true} is VALID [2022-04-08 11:09:22,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {6761#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(15, 2);call #Ultimate.allocInit(12, 3); {6761#true} is VALID [2022-04-08 11:09:22,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 11:09:22,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6761#true} {6761#true} #69#return; {6761#true} is VALID [2022-04-08 11:09:22,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {6761#true} call #t~ret8 := main(); {6761#true} is VALID [2022-04-08 11:09:22,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {6761#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {6761#true} is VALID [2022-04-08 11:09:22,947 INFO L272 TraceCheckUtils]: 6: Hoare triple {6761#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {6761#true} is VALID [2022-04-08 11:09:22,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {6761#true} ~cond := #in~cond; {6787#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:09:22,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {6787#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6791#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:09:22,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {6791#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6791#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:09:22,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6791#(not (= |assume_abort_if_not_#in~cond| 0))} {6761#true} #61#return; {6798#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:09:22,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {6798#(and (<= 0 main_~X~0) (<= main_~X~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {6798#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:09:22,949 INFO L272 TraceCheckUtils]: 12: Hoare triple {6798#(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)); {6761#true} is VALID [2022-04-08 11:09:22,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-08 11:09:22,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-08 11:09:22,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 11:09:22,950 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6761#true} {6798#(and (<= 0 main_~X~0) (<= main_~X~0 5))} #63#return; {6798#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:09:22,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {6798#(and (<= 0 main_~X~0) (<= main_~X~0 5))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {6820#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:09:22,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {6820#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6824#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 11:09:22,951 INFO L272 TraceCheckUtils]: 19: Hoare triple {6824#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6761#true} is VALID [2022-04-08 11:09:22,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {6761#true} ~cond := #in~cond; {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:09:22,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:22,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:22,953 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} {6824#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {6820#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:09:22,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {6820#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {6820#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:09:22,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {6820#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6848#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:09:22,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {6848#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6852#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~x~0 1) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:09:24,957 WARN L290 TraceCheckUtils]: 27: Hoare triple {6852#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= main_~x~0 1) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6856#(and (or (= main_~yx~0 0) (and (= (mod main_~yx~0 main_~Y~0) 0) (<= (div main_~yx~0 main_~Y~0) 1) (not (= main_~Y~0 0)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} is UNKNOWN [2022-04-08 11:09:24,957 INFO L272 TraceCheckUtils]: 28: Hoare triple {6856#(and (or (= main_~yx~0 0) (and (= (mod main_~yx~0 main_~Y~0) 0) (<= (div main_~yx~0 main_~Y~0) 1) (not (= main_~Y~0 0)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6761#true} is VALID [2022-04-08 11:09:24,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {6761#true} ~cond := #in~cond; {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:09:24,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:24,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:24,959 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} {6856#(and (or (= main_~yx~0 0) (and (= (mod main_~yx~0 main_~Y~0) 0) (<= (div main_~yx~0 main_~Y~0) 1) (not (= main_~Y~0 0)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} #65#return; {6872#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:09:24,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {6872#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {6872#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:09:24,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {6872#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6879#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:09:24,960 INFO L290 TraceCheckUtils]: 35: Hoare triple {6879#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6879#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:09:24,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {6879#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6886#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 11:09:24,961 INFO L272 TraceCheckUtils]: 37: Hoare triple {6886#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6761#true} is VALID [2022-04-08 11:09:24,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {6761#true} ~cond := #in~cond; {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:09:24,961 INFO L290 TraceCheckUtils]: 39: Hoare triple {6831#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:24,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:24,963 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} {6886#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {6902#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:09:24,964 INFO L290 TraceCheckUtils]: 42: Hoare triple {6902#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {6902#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} is VALID [2022-04-08 11:09:24,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {6902#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~X~0) (<= main_~X~0 5) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6909#(and (= (+ (* main_~X~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= main_~X~0 5))} is VALID [2022-04-08 11:09:24,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {6909#(and (= (+ (* main_~X~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= main_~X~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6913#(and (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~X~0 2)) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= main_~X~0 5))} is VALID [2022-04-08 11:09:24,968 INFO L290 TraceCheckUtils]: 45: Hoare triple {6913#(and (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~X~0 2)) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= main_~X~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6917#(and (<= main_~X~0 (* main_~Y~0 6)) (= (* (* (div main_~yx~0 main_~Y~0) main_~Y~0) 2) (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~X~0 main_~xy~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:09:24,969 INFO L272 TraceCheckUtils]: 46: Hoare triple {6917#(and (<= main_~X~0 (* main_~Y~0 6)) (= (* (* (div main_~yx~0 main_~Y~0) main_~Y~0) 2) (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~X~0 main_~xy~0) (<= main_~X~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6921#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:09:24,970 INFO L290 TraceCheckUtils]: 47: Hoare triple {6921#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6925#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:09:24,970 INFO L290 TraceCheckUtils]: 48: Hoare triple {6925#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6762#false} is VALID [2022-04-08 11:09:24,970 INFO L290 TraceCheckUtils]: 49: Hoare triple {6762#false} assume !false; {6762#false} is VALID [2022-04-08 11:09:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 11:09:24,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:09:28,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {6762#false} assume !false; {6762#false} is VALID [2022-04-08 11:09:28,834 INFO L290 TraceCheckUtils]: 48: Hoare triple {6925#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6762#false} is VALID [2022-04-08 11:09:28,834 INFO L290 TraceCheckUtils]: 47: Hoare triple {6921#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6925#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:09:28,835 INFO L272 TraceCheckUtils]: 46: Hoare triple {6941#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6921#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:09:28,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {6945#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6941#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:09:28,839 INFO L290 TraceCheckUtils]: 44: Hoare triple {6949#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6945#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:09:28,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {6953#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6949#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 11:09:28,842 INFO L290 TraceCheckUtils]: 42: Hoare triple {6953#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {6953#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-08 11:09:28,843 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} {6960#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {6953#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-08 11:09:28,844 INFO L290 TraceCheckUtils]: 40: Hoare triple {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:28,844 INFO L290 TraceCheckUtils]: 39: Hoare triple {6970#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6835#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:09:28,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {6761#true} ~cond := #in~cond; {6970#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:09:28,845 INFO L272 TraceCheckUtils]: 37: Hoare triple {6960#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6761#true} is VALID [2022-04-08 11:09:28,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {6761#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6960#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-08 11:09:28,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {6761#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6761#true} is VALID [2022-04-08 11:09:28,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {6761#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6761#true} is VALID [2022-04-08 11:09:28,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {6761#true} assume !!(~x~0 <= ~X~0); {6761#true} is VALID [2022-04-08 11:09:28,846 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6761#true} {6761#true} #65#return; {6761#true} is VALID [2022-04-08 11:09:28,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 11:09:28,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-08 11:09:28,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-08 11:09:28,847 INFO L272 TraceCheckUtils]: 28: Hoare triple {6761#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6761#true} is VALID [2022-04-08 11:09:28,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {6761#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6761#true} is VALID [2022-04-08 11:09:28,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {6761#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6761#true} is VALID [2022-04-08 11:09:28,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {6761#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6761#true} is VALID [2022-04-08 11:09:28,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {6761#true} assume !!(~x~0 <= ~X~0); {6761#true} is VALID [2022-04-08 11:09:28,847 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6761#true} {6761#true} #65#return; {6761#true} is VALID [2022-04-08 11:09:28,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 11:09:28,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-08 11:09:28,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-08 11:09:28,847 INFO L272 TraceCheckUtils]: 19: Hoare triple {6761#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6761#true} is VALID [2022-04-08 11:09:28,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {6761#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6761#true} is VALID [2022-04-08 11:09:28,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {6761#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {6761#true} is VALID [2022-04-08 11:09:28,848 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6761#true} {6761#true} #63#return; {6761#true} is VALID [2022-04-08 11:09:28,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 11:09:28,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-08 11:09:28,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-08 11:09:28,848 INFO L272 TraceCheckUtils]: 12: Hoare triple {6761#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {6761#true} is VALID [2022-04-08 11:09:28,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {6761#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {6761#true} is VALID [2022-04-08 11:09:28,848 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6761#true} {6761#true} #61#return; {6761#true} is VALID [2022-04-08 11:09:28,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 11:09:28,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {6761#true} assume !(0 == ~cond); {6761#true} is VALID [2022-04-08 11:09:28,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {6761#true} ~cond := #in~cond; {6761#true} is VALID [2022-04-08 11:09:28,849 INFO L272 TraceCheckUtils]: 6: Hoare triple {6761#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {6761#true} is VALID [2022-04-08 11:09:28,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {6761#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {6761#true} is VALID [2022-04-08 11:09:28,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {6761#true} call #t~ret8 := main(); {6761#true} is VALID [2022-04-08 11:09:28,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6761#true} {6761#true} #69#return; {6761#true} is VALID [2022-04-08 11:09:28,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {6761#true} assume true; {6761#true} is VALID [2022-04-08 11:09:28,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {6761#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(15, 2);call #Ultimate.allocInit(12, 3); {6761#true} is VALID [2022-04-08 11:09:28,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {6761#true} call ULTIMATE.init(); {6761#true} is VALID [2022-04-08 11:09:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-08 11:09:28,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:09:28,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802657748] [2022-04-08 11:09:28,850 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:09:28,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292723539] [2022-04-08 11:09:28,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292723539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:09:28,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:09:28,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 27 [2022-04-08 11:09:28,851 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:09:28,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1334878686] [2022-04-08 11:09:28,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1334878686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:09:28,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:09:28,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 11:09:28,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942792987] [2022-04-08 11:09:28,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:09:28,852 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-08 11:09:28,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:09:28,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:09:30,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:09:30,912 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 11:09:30,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:09:30,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 11:09:30,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2022-04-08 11:09:30,913 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:09:34,351 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 11:09:37,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:09:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:09:37,115 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-04-08 11:09:37,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 11:09:37,115 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-08 11:09:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:09:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:09:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-08 11:09:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:09:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-08 11:09:37,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 76 transitions. [2022-04-08 11:09:39,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:09:39,205 INFO L225 Difference]: With dead ends: 101 [2022-04-08 11:09:39,205 INFO L226 Difference]: Without dead ends: 88 [2022-04-08 11:09:39,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 11:09:39,207 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-08 11:09:39,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 163 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 537 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-04-08 11:09:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-08 11:09:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2022-04-08 11:09:39,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:09:39,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:09:39,349 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:09:39,349 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:09:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:09:39,351 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-04-08 11:09:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-04-08 11:09:39,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:09:39,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:09:39,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 88 states. [2022-04-08 11:09:39,352 INFO L87 Difference]: Start difference. First operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 88 states. [2022-04-08 11:09:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:09:39,353 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-04-08 11:09:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-04-08 11:09:39,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:09:39,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:09:39,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:09:39,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:09:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 11:09:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-04-08 11:09:39,356 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 50 [2022-04-08 11:09:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:09:39,356 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-04-08 11:09:39,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:09:39,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 85 transitions. [2022-04-08 11:09:39,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:09:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-04-08 11:09:39,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:09:39,543 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:09:39,543 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:09:39,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 11:09:39,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 11:09:39,747 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:09:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:09:39,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 7 times [2022-04-08 11:09:39,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:09:39,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [66963508] [2022-04-08 11:09:39,748 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:09:39,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 8 times [2022-04-08 11:09:39,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:09:39,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630677878] [2022-04-08 11:09:39,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:09:39,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:09:39,760 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:09:39,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452510972] [2022-04-08 11:09:39,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:09:39,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:09:39,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:09:39,762 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:09:39,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 11:09:39,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:09:39,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:09:39,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 11:09:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:09:39,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:09:54,701 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:10:00,731 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:10:08,075 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:10:23,603 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:10:30,652 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:10:49,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {7637#true} call ULTIMATE.init(); {7637#true} is VALID [2022-04-08 11:10:49,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {7637#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(15, 2);call #Ultimate.allocInit(12, 3); {7637#true} is VALID [2022-04-08 11:10:49,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 11:10:49,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7637#true} {7637#true} #69#return; {7637#true} is VALID [2022-04-08 11:10:49,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {7637#true} call #t~ret8 := main(); {7637#true} is VALID [2022-04-08 11:10:49,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {7637#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {7637#true} is VALID [2022-04-08 11:10:49,607 INFO L272 TraceCheckUtils]: 6: Hoare triple {7637#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {7637#true} is VALID [2022-04-08 11:10:49,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 11:10:49,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 11:10:49,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 11:10:49,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7637#true} {7637#true} #61#return; {7637#true} is VALID [2022-04-08 11:10:49,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {7637#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {7637#true} is VALID [2022-04-08 11:10:49,608 INFO L272 TraceCheckUtils]: 12: Hoare triple {7637#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {7637#true} is VALID [2022-04-08 11:10:49,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 11:10:49,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 11:10:49,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 11:10:49,608 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7637#true} {7637#true} #63#return; {7637#true} is VALID [2022-04-08 11:10:49,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {7637#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:10:49,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:10:49,609 INFO L272 TraceCheckUtils]: 19: Hoare triple {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7637#true} is VALID [2022-04-08 11:10:49,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 11:10:49,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 11:10:49,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 11:10:49,610 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7637#true} {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:10:49,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 11:10:49,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {7693#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7718#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-08 11:10:49,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {7718#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7718#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-08 11:10:49,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {7718#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7725#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-08 11:10:49,612 INFO L272 TraceCheckUtils]: 28: Hoare triple {7725#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7637#true} is VALID [2022-04-08 11:10:49,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {7637#true} ~cond := #in~cond; {7732#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:49,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {7732#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:49,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:49,613 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} {7725#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #65#return; {7743#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} is VALID [2022-04-08 11:10:49,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {7743#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} assume !!(~x~0 <= ~X~0); {7743#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} is VALID [2022-04-08 11:10:49,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {7743#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7750#(= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0)} is VALID [2022-04-08 11:10:49,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {7750#(= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7750#(= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0)} is VALID [2022-04-08 11:10:49,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {7750#(= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7757#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 11:10:49,616 INFO L272 TraceCheckUtils]: 37: Hoare triple {7757#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7637#true} is VALID [2022-04-08 11:10:49,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {7637#true} ~cond := #in~cond; {7732#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:49,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {7732#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:49,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:49,618 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} {7757#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {7773#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:10:49,618 INFO L290 TraceCheckUtils]: 42: Hoare triple {7773#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {7773#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:10:49,619 INFO L290 TraceCheckUtils]: 43: Hoare triple {7773#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7780#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0))))} is VALID [2022-04-08 11:10:49,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {7780#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7784#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 6))))} is VALID [2022-04-08 11:10:51,635 WARN L290 TraceCheckUtils]: 45: Hoare triple {7784#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 6))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7788#(or (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) main_~X~0)) (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0))) (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2)))) (= main_~yx~0 0) (= main_~Y~0 0)))) (and (or (and (= (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 0) (= main_~X~0 (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0))) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0)) (and (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (+ (* main_~Y~0 2 (+ (- 1) (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0))) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 6))) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)))} is UNKNOWN [2022-04-08 11:10:51,645 INFO L272 TraceCheckUtils]: 46: Hoare triple {7788#(or (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) main_~X~0)) (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0))) (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2)))) (= main_~yx~0 0) (= main_~Y~0 0)))) (and (or (and (= (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 0) (= main_~X~0 (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0))) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0)) (and (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (+ (* main_~Y~0 2 (+ (- 1) (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0))) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 6))) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7792#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:10:51,646 INFO L290 TraceCheckUtils]: 47: Hoare triple {7792#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7796#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:51,646 INFO L290 TraceCheckUtils]: 48: Hoare triple {7796#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7638#false} is VALID [2022-04-08 11:10:51,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {7638#false} assume !false; {7638#false} is VALID [2022-04-08 11:10:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 11:10:51,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:10:56,306 INFO L290 TraceCheckUtils]: 49: Hoare triple {7638#false} assume !false; {7638#false} is VALID [2022-04-08 11:10:56,306 INFO L290 TraceCheckUtils]: 48: Hoare triple {7796#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7638#false} is VALID [2022-04-08 11:10:56,307 INFO L290 TraceCheckUtils]: 47: Hoare triple {7792#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7796#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:10:56,308 INFO L272 TraceCheckUtils]: 46: Hoare triple {7812#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7792#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:10:56,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {7816#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7812#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:10:56,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {7820#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7816#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:10:56,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {7816#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7820#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 11:10:56,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {7816#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {7816#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:10:56,313 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} {7830#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {7816#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:10:56,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:56,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {7840#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:10:56,314 INFO L290 TraceCheckUtils]: 38: Hoare triple {7637#true} ~cond := #in~cond; {7840#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:10:56,314 INFO L272 TraceCheckUtils]: 37: Hoare triple {7830#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7637#true} is VALID [2022-04-08 11:10:56,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {7637#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7830#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-08 11:10:56,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {7637#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7637#true} is VALID [2022-04-08 11:10:56,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {7637#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7637#true} is VALID [2022-04-08 11:10:56,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {7637#true} assume !!(~x~0 <= ~X~0); {7637#true} is VALID [2022-04-08 11:10:56,315 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7637#true} {7637#true} #65#return; {7637#true} is VALID [2022-04-08 11:10:56,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 11:10:56,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 11:10:56,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 11:10:56,315 INFO L272 TraceCheckUtils]: 28: Hoare triple {7637#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7637#true} is VALID [2022-04-08 11:10:56,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {7637#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7637#true} is VALID [2022-04-08 11:10:56,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {7637#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7637#true} is VALID [2022-04-08 11:10:56,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {7637#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7637#true} is VALID [2022-04-08 11:10:56,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {7637#true} assume !!(~x~0 <= ~X~0); {7637#true} is VALID [2022-04-08 11:10:56,316 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7637#true} {7637#true} #65#return; {7637#true} is VALID [2022-04-08 11:10:56,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 11:10:56,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 11:10:56,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 11:10:56,322 INFO L272 TraceCheckUtils]: 19: Hoare triple {7637#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7637#true} is VALID [2022-04-08 11:10:56,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {7637#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7637#true} is VALID [2022-04-08 11:10:56,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {7637#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {7637#true} is VALID [2022-04-08 11:10:56,322 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7637#true} {7637#true} #63#return; {7637#true} is VALID [2022-04-08 11:10:56,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 11:10:56,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 11:10:56,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 11:10:56,323 INFO L272 TraceCheckUtils]: 12: Hoare triple {7637#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {7637#true} is VALID [2022-04-08 11:10:56,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {7637#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {7637#true} is VALID [2022-04-08 11:10:56,323 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7637#true} {7637#true} #61#return; {7637#true} is VALID [2022-04-08 11:10:56,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 11:10:56,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {7637#true} assume !(0 == ~cond); {7637#true} is VALID [2022-04-08 11:10:56,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {7637#true} ~cond := #in~cond; {7637#true} is VALID [2022-04-08 11:10:56,323 INFO L272 TraceCheckUtils]: 6: Hoare triple {7637#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {7637#true} is VALID [2022-04-08 11:10:56,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {7637#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {7637#true} is VALID [2022-04-08 11:10:56,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {7637#true} call #t~ret8 := main(); {7637#true} is VALID [2022-04-08 11:10:56,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7637#true} {7637#true} #69#return; {7637#true} is VALID [2022-04-08 11:10:56,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {7637#true} assume true; {7637#true} is VALID [2022-04-08 11:10:56,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {7637#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(15, 2);call #Ultimate.allocInit(12, 3); {7637#true} is VALID [2022-04-08 11:10:56,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {7637#true} call ULTIMATE.init(); {7637#true} is VALID [2022-04-08 11:10:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-08 11:10:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:10:56,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630677878] [2022-04-08 11:10:56,324 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:10:56,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452510972] [2022-04-08 11:10:56,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452510972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:10:56,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:10:56,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 21 [2022-04-08 11:10:56,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:10:56,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [66963508] [2022-04-08 11:10:56,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [66963508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:10:56,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:10:56,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 11:10:56,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533798550] [2022-04-08 11:10:56,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:10:56,325 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-08 11:10:56,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:10:56,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:10:58,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:10:58,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 11:10:58,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:10:58,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 11:10:58,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=364, Unknown=1, NotChecked=0, Total=420 [2022-04-08 11:10:58,396 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:05,634 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-04-08 11:11:05,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:11:05,634 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-08 11:11:05,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:11:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-08 11:11:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-08 11:11:05,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2022-04-08 11:11:07,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:07,720 INFO L225 Difference]: With dead ends: 93 [2022-04-08 11:11:07,720 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 11:11:07,721 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=88, Invalid=560, Unknown=2, NotChecked=0, Total=650 [2022-04-08 11:11:07,721 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 11:11:07,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 210 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 302 Invalid, 0 Unknown, 39 Unchecked, 0.7s Time] [2022-04-08 11:11:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 11:11:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-08 11:11:07,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:11:07,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 68 states have internal predecessors, (72), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 11:11:07,901 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 68 states have internal predecessors, (72), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 11:11:07,902 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 68 states have internal predecessors, (72), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 11:11:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:07,904 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-04-08 11:11:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-04-08 11:11:07,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:07,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:07,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 68 states have internal predecessors, (72), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 91 states. [2022-04-08 11:11:07,905 INFO L87 Difference]: Start difference. First operand has 91 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 68 states have internal predecessors, (72), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 91 states. [2022-04-08 11:11:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:07,907 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-04-08 11:11:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-04-08 11:11:07,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:07,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:07,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:11:07,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:11:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 68 states have internal predecessors, (72), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 11:11:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-04-08 11:11:07,910 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 50 [2022-04-08 11:11:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:11:07,910 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-04-08 11:11:07,910 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:07,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 98 transitions. [2022-04-08 11:11:10,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 97 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-04-08 11:11:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:11:10,156 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:10,156 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:10,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 11:11:10,357 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 11:11:10,357 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:10,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash -322489421, now seen corresponding path program 9 times [2022-04-08 11:11:10,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:10,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [60659668] [2022-04-08 11:11:10,358 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:11:10,358 INFO L85 PathProgramCache]: Analyzing trace with hash -322489421, now seen corresponding path program 10 times [2022-04-08 11:11:10,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:10,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104469696] [2022-04-08 11:11:10,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:10,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:10,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:11:10,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866357827] [2022-04-08 11:11:10,373 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:11:10,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:10,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:11:10,375 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:11:10,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 11:11:10,413 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:11:10,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:11:10,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 11:11:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:10,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:11:10,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {8517#true} call ULTIMATE.init(); {8517#true} is VALID [2022-04-08 11:11:10,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {8517#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(15, 2);call #Ultimate.allocInit(12, 3); {8517#true} is VALID [2022-04-08 11:11:10,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 11:11:10,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8517#true} {8517#true} #69#return; {8517#true} is VALID [2022-04-08 11:11:10,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {8517#true} call #t~ret8 := main(); {8517#true} is VALID [2022-04-08 11:11:10,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {8517#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {8517#true} is VALID [2022-04-08 11:11:10,834 INFO L272 TraceCheckUtils]: 6: Hoare triple {8517#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {8517#true} is VALID [2022-04-08 11:11:10,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 11:11:10,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 11:11:10,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 11:11:10,834 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8517#true} {8517#true} #61#return; {8517#true} is VALID [2022-04-08 11:11:10,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {8517#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {8517#true} is VALID [2022-04-08 11:11:10,835 INFO L272 TraceCheckUtils]: 12: Hoare triple {8517#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {8517#true} is VALID [2022-04-08 11:11:10,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 11:11:10,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 11:11:10,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 11:11:10,835 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8517#true} {8517#true} #63#return; {8517#true} is VALID [2022-04-08 11:11:10,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {8517#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-08 11:11:10,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-08 11:11:10,836 INFO L272 TraceCheckUtils]: 19: Hoare triple {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8517#true} is VALID [2022-04-08 11:11:10,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 11:11:10,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 11:11:10,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 11:11:10,837 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8517#true} {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} #65#return; {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-08 11:11:10,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !!(~x~0 <= ~X~0); {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-08 11:11:10,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {8573#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-08 11:11:10,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-08 11:11:10,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-08 11:11:10,839 INFO L272 TraceCheckUtils]: 28: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8517#true} is VALID [2022-04-08 11:11:10,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 11:11:10,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 11:11:10,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 11:11:10,840 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8517#true} {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} #65#return; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-08 11:11:10,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !!(~x~0 <= ~X~0); {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-08 11:11:10,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-08 11:11:10,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-08 11:11:10,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-08 11:11:10,841 INFO L272 TraceCheckUtils]: 37: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8517#true} is VALID [2022-04-08 11:11:10,841 INFO L290 TraceCheckUtils]: 38: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 11:11:10,841 INFO L290 TraceCheckUtils]: 39: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 11:11:10,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 11:11:10,842 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8517#true} {8626#(<= (div main_~v~0 (- 2)) 0)} #65#return; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-08 11:11:10,842 INFO L290 TraceCheckUtils]: 42: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} assume !!(~x~0 <= ~X~0); {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-08 11:11:10,843 INFO L290 TraceCheckUtils]: 43: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8518#false} is VALID [2022-04-08 11:11:10,843 INFO L290 TraceCheckUtils]: 44: Hoare triple {8518#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8518#false} is VALID [2022-04-08 11:11:10,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {8518#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8518#false} is VALID [2022-04-08 11:11:10,843 INFO L272 TraceCheckUtils]: 46: Hoare triple {8518#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8518#false} is VALID [2022-04-08 11:11:10,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {8518#false} ~cond := #in~cond; {8518#false} is VALID [2022-04-08 11:11:10,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {8518#false} assume 0 == ~cond; {8518#false} is VALID [2022-04-08 11:11:10,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {8518#false} assume !false; {8518#false} is VALID [2022-04-08 11:11:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 11:11:10,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:11:11,383 INFO L290 TraceCheckUtils]: 49: Hoare triple {8518#false} assume !false; {8518#false} is VALID [2022-04-08 11:11:11,384 INFO L290 TraceCheckUtils]: 48: Hoare triple {8518#false} assume 0 == ~cond; {8518#false} is VALID [2022-04-08 11:11:11,384 INFO L290 TraceCheckUtils]: 47: Hoare triple {8518#false} ~cond := #in~cond; {8518#false} is VALID [2022-04-08 11:11:11,384 INFO L272 TraceCheckUtils]: 46: Hoare triple {8518#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8518#false} is VALID [2022-04-08 11:11:11,384 INFO L290 TraceCheckUtils]: 45: Hoare triple {8518#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8518#false} is VALID [2022-04-08 11:11:11,384 INFO L290 TraceCheckUtils]: 44: Hoare triple {8518#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8518#false} is VALID [2022-04-08 11:11:11,385 INFO L290 TraceCheckUtils]: 43: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8518#false} is VALID [2022-04-08 11:11:11,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} assume !!(~x~0 <= ~X~0); {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-08 11:11:11,385 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8517#true} {8626#(<= (div main_~v~0 (- 2)) 0)} #65#return; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-08 11:11:11,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 11:11:11,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 11:11:11,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 11:11:11,386 INFO L272 TraceCheckUtils]: 37: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8517#true} is VALID [2022-04-08 11:11:11,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-08 11:11:11,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {8626#(<= (div main_~v~0 (- 2)) 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-08 11:11:11,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8626#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-08 11:11:11,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !!(~x~0 <= ~X~0); {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-08 11:11:11,388 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8517#true} {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} #65#return; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-08 11:11:11,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 11:11:11,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 11:11:11,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 11:11:11,388 INFO L272 TraceCheckUtils]: 28: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8517#true} is VALID [2022-04-08 11:11:11,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-08 11:11:11,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-08 11:11:11,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8598#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-08 11:11:11,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} assume !!(~x~0 <= ~X~0); {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} is VALID [2022-04-08 11:11:11,391 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8517#true} {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} #65#return; {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} is VALID [2022-04-08 11:11:11,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 11:11:11,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 11:11:11,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 11:11:11,391 INFO L272 TraceCheckUtils]: 19: Hoare triple {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8517#true} is VALID [2022-04-08 11:11:11,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} is VALID [2022-04-08 11:11:11,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {8517#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {8744#(or (< main_~v~0 0) (<= (+ (div (+ (- 2) main_~v~0) (- 2)) main_~X~0) (+ (* main_~Y~0 2) 1)))} is VALID [2022-04-08 11:11:11,392 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8517#true} {8517#true} #63#return; {8517#true} is VALID [2022-04-08 11:11:11,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 11:11:11,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L272 TraceCheckUtils]: 12: Hoare triple {8517#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {8517#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8517#true} {8517#true} #61#return; {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {8517#true} assume !(0 == ~cond); {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {8517#true} ~cond := #in~cond; {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {8517#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {8517#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {8517#true} call #t~ret8 := main(); {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8517#true} {8517#true} #69#return; {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {8517#true} assume true; {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {8517#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(15, 2);call #Ultimate.allocInit(12, 3); {8517#true} is VALID [2022-04-08 11:11:11,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {8517#true} call ULTIMATE.init(); {8517#true} is VALID [2022-04-08 11:11:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 11:11:11,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:11:11,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104469696] [2022-04-08 11:11:11,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:11:11,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866357827] [2022-04-08 11:11:11,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866357827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:11:11,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:11:11,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-04-08 11:11:11,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:11:11,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [60659668] [2022-04-08 11:11:11,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [60659668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:11,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:11,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 11:11:11,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93100341] [2022-04-08 11:11:11,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:11:11,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-08 11:11:11,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:11:11,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:11,428 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 11:11:11,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 11:11:11,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:11,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 11:11:11,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 11:11:11,429 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:11,919 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-04-08 11:11:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 11:11:11,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-08 11:11:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:11:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 11:11:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 11:11:11,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 11:11:11,990 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 11:11:11,992 INFO L225 Difference]: With dead ends: 109 [2022-04-08 11:11:11,992 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 11:11:11,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 11:11:11,993 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:11:11,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:11:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 11:11:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-08 11:11:12,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:11:12,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:11:12,217 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:11:12,217 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:11:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:12,220 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 11:11:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 11:11:12,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:12,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:12,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 96 states. [2022-04-08 11:11:12,221 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 96 states. [2022-04-08 11:11:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:12,224 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-08 11:11:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 11:11:12,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:12,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:12,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:11:12,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:11:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:11:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-04-08 11:11:12,227 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 50 [2022-04-08 11:11:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:11:12,227 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-04-08 11:11:12,227 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:12,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 104 transitions. [2022-04-08 11:11:14,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 103 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 11:11:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:11:14,492 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:14,492 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:14,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 11:11:14,692 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 11:11:14,693 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 11 times [2022-04-08 11:11:14,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:14,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [782204424] [2022-04-08 11:11:14,693 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:11:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 12 times [2022-04-08 11:11:14,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:14,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831273426] [2022-04-08 11:11:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:14,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:14,703 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:11:14,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777797142] [2022-04-08 11:11:14,704 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:11:14,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:14,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:11:14,705 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:11:14,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 11:11:14,761 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 11:11:14,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:11:14,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-08 11:11:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:14,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:11:15,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {9426#true} call ULTIMATE.init(); {9426#true} is VALID [2022-04-08 11:11:15,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {9426#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(15, 2);call #Ultimate.allocInit(12, 3); {9426#true} is VALID [2022-04-08 11:11:15,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 11:11:15,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9426#true} {9426#true} #69#return; {9426#true} is VALID [2022-04-08 11:11:15,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {9426#true} call #t~ret8 := main(); {9426#true} is VALID [2022-04-08 11:11:15,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {9426#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {9426#true} is VALID [2022-04-08 11:11:15,165 INFO L272 TraceCheckUtils]: 6: Hoare triple {9426#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {9426#true} is VALID [2022-04-08 11:11:15,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 11:11:15,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 11:11:15,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 11:11:15,165 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9426#true} {9426#true} #61#return; {9426#true} is VALID [2022-04-08 11:11:15,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {9426#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {9426#true} is VALID [2022-04-08 11:11:15,165 INFO L272 TraceCheckUtils]: 12: Hoare triple {9426#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {9426#true} is VALID [2022-04-08 11:11:15,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 11:11:15,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 11:11:15,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 11:11:15,166 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9426#true} {9426#true} #63#return; {9426#true} is VALID [2022-04-08 11:11:15,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {9426#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:11:15,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:11:15,167 INFO L272 TraceCheckUtils]: 19: Hoare triple {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9426#true} is VALID [2022-04-08 11:11:15,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 11:11:15,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 11:11:15,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 11:11:15,168 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9426#true} {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:11:15,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:11:15,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {9482#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9507#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:11:15,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {9507#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9511#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:11:15,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {9511#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9515#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 11:11:15,170 INFO L272 TraceCheckUtils]: 28: Hoare triple {9515#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9426#true} is VALID [2022-04-08 11:11:15,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {9426#true} ~cond := #in~cond; {9522#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:15,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {9522#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:11:15,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:11:15,172 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} {9515#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {9511#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:11:15,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {9511#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !!(~x~0 <= ~X~0); {9511#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:11:15,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {9511#(and (= main_~y~0 1) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {9539#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-08 11:11:15,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {9539#(and (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} is VALID [2022-04-08 11:11:15,176 INFO L290 TraceCheckUtils]: 36: Hoare triple {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} is VALID [2022-04-08 11:11:15,176 INFO L272 TraceCheckUtils]: 37: Hoare triple {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9426#true} is VALID [2022-04-08 11:11:15,176 INFO L290 TraceCheckUtils]: 38: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 11:11:15,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 11:11:15,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 11:11:15,177 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9426#true} {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} #65#return; {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} is VALID [2022-04-08 11:11:15,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} assume !!(~x~0 <= ~X~0); {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} is VALID [2022-04-08 11:11:15,178 INFO L290 TraceCheckUtils]: 43: Hoare triple {9543#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 1))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9568#(and (= (+ (- 1) main_~x~0) 1) (= (+ (- 1) main_~y~0) 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 5)))))} is VALID [2022-04-08 11:11:15,178 INFO L290 TraceCheckUtils]: 44: Hoare triple {9568#(and (= (+ (- 1) main_~x~0) 1) (= (+ (- 1) main_~y~0) 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 5)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9572#(and (= main_~x~0 3) (= (+ (- 1) main_~y~0) 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 5)))))} is VALID [2022-04-08 11:11:15,179 INFO L290 TraceCheckUtils]: 45: Hoare triple {9572#(and (= main_~x~0 3) (= (+ (- 1) main_~y~0) 1) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 5)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9576#(and (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 3) main_~yx~0) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 5)))))} is VALID [2022-04-08 11:11:15,180 INFO L272 TraceCheckUtils]: 46: Hoare triple {9576#(and (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 3) main_~yx~0) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 5)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9580#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:11:15,180 INFO L290 TraceCheckUtils]: 47: Hoare triple {9580#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9584#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:15,180 INFO L290 TraceCheckUtils]: 48: Hoare triple {9584#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9427#false} is VALID [2022-04-08 11:11:15,180 INFO L290 TraceCheckUtils]: 49: Hoare triple {9427#false} assume !false; {9427#false} is VALID [2022-04-08 11:11:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 11:11:15,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:11:19,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {9427#false} assume !false; {9427#false} is VALID [2022-04-08 11:11:19,635 INFO L290 TraceCheckUtils]: 48: Hoare triple {9584#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9427#false} is VALID [2022-04-08 11:11:19,635 INFO L290 TraceCheckUtils]: 47: Hoare triple {9580#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9584#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:11:19,636 INFO L272 TraceCheckUtils]: 46: Hoare triple {9600#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9580#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:11:19,637 INFO L290 TraceCheckUtils]: 45: Hoare triple {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9600#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:11:19,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {9608#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:11:19,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9608#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 11:11:19,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:11:19,642 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9426#true} {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #65#return; {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:11:19,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 11:11:19,642 INFO L290 TraceCheckUtils]: 39: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 11:11:19,642 INFO L290 TraceCheckUtils]: 38: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 11:11:19,642 INFO L272 TraceCheckUtils]: 37: Hoare triple {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9426#true} is VALID [2022-04-08 11:11:19,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:11:19,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {9608#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:11:19,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {9608#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 11:11:19,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:11:19,646 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} {9645#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {9604#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:11:19,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:11:19,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {9655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9526#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:11:19,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {9426#true} ~cond := #in~cond; {9655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:11:19,648 INFO L272 TraceCheckUtils]: 28: Hoare triple {9645#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9426#true} is VALID [2022-04-08 11:11:19,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {9426#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9645#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-08 11:11:19,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {9426#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9426#true} is VALID [2022-04-08 11:11:19,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {9426#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9426#true} is VALID [2022-04-08 11:11:19,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {9426#true} assume !!(~x~0 <= ~X~0); {9426#true} is VALID [2022-04-08 11:11:19,650 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9426#true} {9426#true} #65#return; {9426#true} is VALID [2022-04-08 11:11:19,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 11:11:19,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 11:11:19,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 11:11:19,650 INFO L272 TraceCheckUtils]: 19: Hoare triple {9426#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9426#true} is VALID [2022-04-08 11:11:19,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {9426#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9426#true} is VALID [2022-04-08 11:11:19,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {9426#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {9426#true} is VALID [2022-04-08 11:11:19,650 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9426#true} {9426#true} #63#return; {9426#true} is VALID [2022-04-08 11:11:19,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 11:11:19,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 11:11:19,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 11:11:19,651 INFO L272 TraceCheckUtils]: 12: Hoare triple {9426#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {9426#true} is VALID [2022-04-08 11:11:19,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {9426#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {9426#true} is VALID [2022-04-08 11:11:19,651 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9426#true} {9426#true} #61#return; {9426#true} is VALID [2022-04-08 11:11:19,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 11:11:19,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {9426#true} assume !(0 == ~cond); {9426#true} is VALID [2022-04-08 11:11:19,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {9426#true} ~cond := #in~cond; {9426#true} is VALID [2022-04-08 11:11:19,652 INFO L272 TraceCheckUtils]: 6: Hoare triple {9426#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {9426#true} is VALID [2022-04-08 11:11:19,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {9426#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {9426#true} is VALID [2022-04-08 11:11:19,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {9426#true} call #t~ret8 := main(); {9426#true} is VALID [2022-04-08 11:11:19,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9426#true} {9426#true} #69#return; {9426#true} is VALID [2022-04-08 11:11:19,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {9426#true} assume true; {9426#true} is VALID [2022-04-08 11:11:19,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {9426#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(15, 2);call #Ultimate.allocInit(12, 3); {9426#true} is VALID [2022-04-08 11:11:19,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {9426#true} call ULTIMATE.init(); {9426#true} is VALID [2022-04-08 11:11:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 11:11:19,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:11:19,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831273426] [2022-04-08 11:11:19,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:11:19,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777797142] [2022-04-08 11:11:19,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777797142] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:11:19,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:11:19,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2022-04-08 11:11:19,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:11:19,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [782204424] [2022-04-08 11:11:19,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [782204424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:11:19,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:11:19,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 11:11:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444018296] [2022-04-08 11:11:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:11:19,655 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-08 11:11:19,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:11:19,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:19,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:19,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 11:11:19,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:19,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 11:11:19,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-04-08 11:11:19,710 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:21,212 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-04-08 11:11:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 11:11:21,212 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-08 11:11:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:11:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-08 11:11:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-08 11:11:21,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 64 transitions. [2022-04-08 11:11:21,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:21,277 INFO L225 Difference]: With dead ends: 109 [2022-04-08 11:11:21,277 INFO L226 Difference]: Without dead ends: 107 [2022-04-08 11:11:21,278 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-04-08 11:11:21,278 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 11:11:21,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 233 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 11:11:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-08 11:11:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2022-04-08 11:11:21,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:11:21,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:11:21,479 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:11:21,479 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:11:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:21,481 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2022-04-08 11:11:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2022-04-08 11:11:21,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:21,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:21,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 107 states. [2022-04-08 11:11:21,482 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 107 states. [2022-04-08 11:11:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:11:21,484 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2022-04-08 11:11:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2022-04-08 11:11:21,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:11:21,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:11:21,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:11:21,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:11:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 72 states have internal predecessors, (76), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:11:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-04-08 11:11:21,488 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 50 [2022-04-08 11:11:21,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:11:21,488 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-04-08 11:11:21,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:11:21,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 104 transitions. [2022-04-08 11:11:23,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 103 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:11:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-08 11:11:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:11:23,767 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:11:23,767 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:11:23,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 11:11:23,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:23,967 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:11:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:11:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 13 times [2022-04-08 11:11:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:11:23,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [169376629] [2022-04-08 11:11:23,968 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:11:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 14 times [2022-04-08 11:11:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:11:23,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76116722] [2022-04-08 11:11:23,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:11:23,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:11:23,979 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:11:23,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899175325] [2022-04-08 11:11:23,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:11:23,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:11:23,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:11:23,980 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:11:23,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 11:11:24,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:11:24,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:11:24,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 11:11:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:11:24,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:11:35,381 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:11:41,399 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:11:54,638 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:12:18,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {10375#true} call ULTIMATE.init(); {10375#true} is VALID [2022-04-08 11:12:18,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {10375#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(15, 2);call #Ultimate.allocInit(12, 3); {10375#true} is VALID [2022-04-08 11:12:18,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 11:12:18,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10375#true} {10375#true} #69#return; {10375#true} is VALID [2022-04-08 11:12:18,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {10375#true} call #t~ret8 := main(); {10375#true} is VALID [2022-04-08 11:12:18,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {10375#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {10375#true} is VALID [2022-04-08 11:12:18,935 INFO L272 TraceCheckUtils]: 6: Hoare triple {10375#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {10375#true} is VALID [2022-04-08 11:12:18,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 11:12:18,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 11:12:18,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 11:12:18,935 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10375#true} {10375#true} #61#return; {10375#true} is VALID [2022-04-08 11:12:18,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {10375#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {10375#true} is VALID [2022-04-08 11:12:18,935 INFO L272 TraceCheckUtils]: 12: Hoare triple {10375#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {10375#true} is VALID [2022-04-08 11:12:18,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 11:12:18,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 11:12:18,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 11:12:18,935 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10375#true} {10375#true} #63#return; {10375#true} is VALID [2022-04-08 11:12:18,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {10375#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-08 11:12:18,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-08 11:12:18,936 INFO L272 TraceCheckUtils]: 19: Hoare triple {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10375#true} is VALID [2022-04-08 11:12:18,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 11:12:18,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 11:12:18,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 11:12:18,937 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10375#true} {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} #65#return; {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-08 11:12:18,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !!(~x~0 <= ~X~0); {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-08 11:12:18,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {10431#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-08 11:12:18,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-08 11:12:18,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-08 11:12:18,939 INFO L272 TraceCheckUtils]: 28: Hoare triple {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10375#true} is VALID [2022-04-08 11:12:18,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {10375#true} ~cond := #in~cond; {10469#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:18,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {10469#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:18,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:18,941 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} #65#return; {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-08 11:12:18,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} assume !!(~x~0 <= ~X~0); {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-08 11:12:18,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {10456#(= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10486#(= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-08 11:12:18,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {10486#(= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10486#(= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} is VALID [2022-04-08 11:12:18,943 INFO L290 TraceCheckUtils]: 36: Hoare triple {10486#(= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10493#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 11:12:18,943 INFO L272 TraceCheckUtils]: 37: Hoare triple {10493#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10375#true} is VALID [2022-04-08 11:12:18,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {10375#true} ~cond := #in~cond; {10469#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:18,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {10469#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:18,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:18,945 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} {10493#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {10509#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:12:18,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {10509#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !!(~x~0 <= ~X~0); {10509#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:12:18,946 INFO L290 TraceCheckUtils]: 43: Hoare triple {10509#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {10516#(and (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-08 11:12:18,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {10516#(and (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10520#(and (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 11:12:20,951 WARN L290 TraceCheckUtils]: 45: Hoare triple {10520#(and (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10524#(and (or (and (or (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= main_~yx~0 0)) (and (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0)))))) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is UNKNOWN [2022-04-08 11:12:20,956 INFO L272 TraceCheckUtils]: 46: Hoare triple {10524#(and (or (and (or (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= main_~yx~0 0)) (and (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0)))))) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:20,956 INFO L290 TraceCheckUtils]: 47: Hoare triple {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10532#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:20,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {10532#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10376#false} is VALID [2022-04-08 11:12:20,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {10376#false} assume !false; {10376#false} is VALID [2022-04-08 11:12:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 11:12:20,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:12:25,287 INFO L290 TraceCheckUtils]: 49: Hoare triple {10376#false} assume !false; {10376#false} is VALID [2022-04-08 11:12:25,287 INFO L290 TraceCheckUtils]: 48: Hoare triple {10532#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10376#false} is VALID [2022-04-08 11:12:25,287 INFO L290 TraceCheckUtils]: 47: Hoare triple {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10532#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:12:25,288 INFO L272 TraceCheckUtils]: 46: Hoare triple {10548#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10528#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:12:25,289 INFO L290 TraceCheckUtils]: 45: Hoare triple {10552#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10548#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:12:25,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {10556#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10552#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:12:25,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {10552#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {10556#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 11:12:25,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {10552#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {10552#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:12:25,299 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} {10566#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {10552#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:12:25,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:25,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {10576#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:12:25,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {10375#true} ~cond := #in~cond; {10576#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:12:25,300 INFO L272 TraceCheckUtils]: 37: Hoare triple {10566#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10375#true} is VALID [2022-04-08 11:12:25,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {10375#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10566#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-08 11:12:25,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {10375#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10375#true} is VALID [2022-04-08 11:12:25,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {10375#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10375#true} is VALID [2022-04-08 11:12:25,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {10375#true} assume !!(~x~0 <= ~X~0); {10375#true} is VALID [2022-04-08 11:12:25,301 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10375#true} {10375#true} #65#return; {10375#true} is VALID [2022-04-08 11:12:25,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 11:12:25,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 11:12:25,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 11:12:25,301 INFO L272 TraceCheckUtils]: 28: Hoare triple {10375#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10375#true} is VALID [2022-04-08 11:12:25,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {10375#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {10375#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {10375#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {10375#true} assume !!(~x~0 <= ~X~0); {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10375#true} {10375#true} #65#return; {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L272 TraceCheckUtils]: 19: Hoare triple {10375#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {10375#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {10375#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10375#true} {10375#true} #63#return; {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 11:12:25,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 11:12:25,303 INFO L272 TraceCheckUtils]: 12: Hoare triple {10375#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {10375#true} is VALID [2022-04-08 11:12:25,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {10375#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {10375#true} is VALID [2022-04-08 11:12:25,303 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10375#true} {10375#true} #61#return; {10375#true} is VALID [2022-04-08 11:12:25,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 11:12:25,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {10375#true} assume !(0 == ~cond); {10375#true} is VALID [2022-04-08 11:12:25,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {10375#true} ~cond := #in~cond; {10375#true} is VALID [2022-04-08 11:12:25,303 INFO L272 TraceCheckUtils]: 6: Hoare triple {10375#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {10375#true} is VALID [2022-04-08 11:12:25,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {10375#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {10375#true} is VALID [2022-04-08 11:12:25,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {10375#true} call #t~ret8 := main(); {10375#true} is VALID [2022-04-08 11:12:25,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10375#true} {10375#true} #69#return; {10375#true} is VALID [2022-04-08 11:12:25,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {10375#true} assume true; {10375#true} is VALID [2022-04-08 11:12:25,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {10375#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(15, 2);call #Ultimate.allocInit(12, 3); {10375#true} is VALID [2022-04-08 11:12:25,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {10375#true} call ULTIMATE.init(); {10375#true} is VALID [2022-04-08 11:12:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-08 11:12:25,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:12:25,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76116722] [2022-04-08 11:12:25,304 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:12:25,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899175325] [2022-04-08 11:12:25,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899175325] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:12:25,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:12:25,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-08 11:12:25,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:12:25,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [169376629] [2022-04-08 11:12:25,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [169376629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:12:25,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:12:25,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 11:12:25,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390389217] [2022-04-08 11:12:25,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:12:25,305 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-08 11:12:25,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:12:25,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:12:27,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:27,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 11:12:27,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:27,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 11:12:27,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-08 11:12:27,355 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:12:39,908 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:12:49,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:12:51,484 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 11:12:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:55,019 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-08 11:12:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 11:12:55,019 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-08 11:12:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:12:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:12:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-04-08 11:12:55,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:12:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-04-08 11:12:55,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 65 transitions. [2022-04-08 11:12:57,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 64 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:57,098 INFO L225 Difference]: With dead ends: 110 [2022-04-08 11:12:57,098 INFO L226 Difference]: Without dead ends: 108 [2022-04-08 11:12:57,099 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-04-08 11:12:57,099 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:12:57,099 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 210 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 389 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2022-04-08 11:12:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-08 11:12:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2022-04-08 11:12:57,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:12:57,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:12:57,299 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:12:57,300 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:12:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:57,302 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2022-04-08 11:12:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-04-08 11:12:57,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:57,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:57,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 108 states. [2022-04-08 11:12:57,303 INFO L87 Difference]: Start difference. First operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 108 states. [2022-04-08 11:12:57,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:12:57,305 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2022-04-08 11:12:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-04-08 11:12:57,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:12:57,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:12:57,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:12:57,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:12:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:12:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-04-08 11:12:57,308 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 50 [2022-04-08 11:12:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:12:57,309 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-04-08 11:12:57,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:12:57,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 106 transitions. [2022-04-08 11:12:59,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 105 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:12:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-04-08 11:12:59,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 11:12:59,598 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:12:59,598 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:12:59,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 11:12:59,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 11:12:59,798 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:12:59,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:12:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 5 times [2022-04-08 11:12:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:12:59,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1445018996] [2022-04-08 11:12:59,799 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:12:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 6 times [2022-04-08 11:12:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:12:59,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709117108] [2022-04-08 11:12:59,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:12:59,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:12:59,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:12:59,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [312025125] [2022-04-08 11:12:59,809 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:12:59,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:12:59,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:12:59,810 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:12:59,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 11:12:59,857 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 11:12:59,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:12:59,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 11:12:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:12:59,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:13:00,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {11331#true} call ULTIMATE.init(); {11331#true} is VALID [2022-04-08 11:13:00,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {11331#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(15, 2);call #Ultimate.allocInit(12, 3); {11331#true} is VALID [2022-04-08 11:13:00,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 11:13:00,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11331#true} {11331#true} #69#return; {11331#true} is VALID [2022-04-08 11:13:00,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {11331#true} call #t~ret8 := main(); {11331#true} is VALID [2022-04-08 11:13:00,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {11331#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {11331#true} is VALID [2022-04-08 11:13:00,259 INFO L272 TraceCheckUtils]: 6: Hoare triple {11331#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {11331#true} is VALID [2022-04-08 11:13:00,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 11:13:00,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 11:13:00,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 11:13:00,260 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11331#true} {11331#true} #61#return; {11331#true} is VALID [2022-04-08 11:13:00,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {11331#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {11331#true} is VALID [2022-04-08 11:13:00,260 INFO L272 TraceCheckUtils]: 12: Hoare triple {11331#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {11331#true} is VALID [2022-04-08 11:13:00,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 11:13:00,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 11:13:00,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 11:13:00,260 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11331#true} {11331#true} #63#return; {11331#true} is VALID [2022-04-08 11:13:00,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {11331#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:13:00,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:13:00,264 INFO L272 TraceCheckUtils]: 19: Hoare triple {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11331#true} is VALID [2022-04-08 11:13:00,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 11:13:00,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 11:13:00,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 11:13:00,264 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11331#true} {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:13:00,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 11:13:00,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {11387#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11412#(and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:13:00,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {11412#(and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11416#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:13:00,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {11416#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11416#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:13:00,267 INFO L272 TraceCheckUtils]: 28: Hoare triple {11416#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11331#true} is VALID [2022-04-08 11:13:00,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 11:13:00,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 11:13:00,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 11:13:00,268 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11331#true} {11416#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {11416#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:13:00,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {11416#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {11416#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-08 11:13:00,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {11416#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11441#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~x~0) 0))} is VALID [2022-04-08 11:13:00,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {11441#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~x~0) 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} is VALID [2022-04-08 11:13:00,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} is VALID [2022-04-08 11:13:00,270 INFO L272 TraceCheckUtils]: 37: Hoare triple {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11331#true} is VALID [2022-04-08 11:13:00,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 11:13:00,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 11:13:00,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 11:13:00,271 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11331#true} {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} #65#return; {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} is VALID [2022-04-08 11:13:00,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {11445#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0))} assume !!(~x~0 <= ~X~0); {11467#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0) (<= main_~x~0 main_~X~0))} is VALID [2022-04-08 11:13:00,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {11467#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~x~0) 0) (<= main_~x~0 main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11471#(and (= (+ (- 2) main_~x~0) 0) (<= main_~x~0 main_~X~0) (not (< (* main_~Y~0 6) (* 5 main_~X~0))) (= main_~y~0 3) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0))} is VALID [2022-04-08 11:13:00,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {11471#(and (= (+ (- 2) main_~x~0) 0) (<= main_~x~0 main_~X~0) (not (< (* main_~Y~0 6) (* 5 main_~X~0))) (= main_~y~0 3) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11475#(and (= (+ main_~x~0 (- 3)) 0) (not (< (* main_~Y~0 6) (* 5 main_~X~0))) (= main_~y~0 3) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:13:00,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {11475#(and (= (+ main_~x~0 (- 3)) 0) (not (< (* main_~Y~0 6) (* 5 main_~X~0))) (= main_~y~0 3) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11479#(and (= (* main_~Y~0 3) main_~yx~0) (not (< (* main_~Y~0 6) (* 5 main_~X~0))) (<= 2 main_~X~0) (= main_~xy~0 (* main_~X~0 3)) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0))} is VALID [2022-04-08 11:13:00,274 INFO L272 TraceCheckUtils]: 46: Hoare triple {11479#(and (= (* main_~Y~0 3) main_~yx~0) (not (< (* main_~Y~0 6) (* 5 main_~X~0))) (<= 2 main_~X~0) (= main_~xy~0 (* main_~X~0 3)) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11483#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:13:00,274 INFO L290 TraceCheckUtils]: 47: Hoare triple {11483#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11487#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:13:00,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {11487#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11332#false} is VALID [2022-04-08 11:13:00,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {11332#false} assume !false; {11332#false} is VALID [2022-04-08 11:13:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 11:13:00,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:13:00,880 INFO L290 TraceCheckUtils]: 49: Hoare triple {11332#false} assume !false; {11332#false} is VALID [2022-04-08 11:13:00,880 INFO L290 TraceCheckUtils]: 48: Hoare triple {11487#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11332#false} is VALID [2022-04-08 11:13:00,881 INFO L290 TraceCheckUtils]: 47: Hoare triple {11483#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11487#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:13:00,881 INFO L272 TraceCheckUtils]: 46: Hoare triple {11503#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11483#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:13:00,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {11507#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11503#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:13:00,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {11511#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11507#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:13:00,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {11515#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11511#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 11:13:00,887 INFO L290 TraceCheckUtils]: 42: Hoare triple {11519#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {11515#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-08 11:13:00,887 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11331#true} {11519#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {11519#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-08 11:13:00,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 11:13:00,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 11:13:00,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 11:13:00,888 INFO L272 TraceCheckUtils]: 37: Hoare triple {11519#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11331#true} is VALID [2022-04-08 11:13:00,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {11519#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11519#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-08 11:13:00,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {11541#(or (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2)) (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11519#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-08 11:13:00,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11541#(or (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2)) (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2))))} is VALID [2022-04-08 11:13:00,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} assume !!(~x~0 <= ~X~0); {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-08 11:13:00,893 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11331#true} {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} #65#return; {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-08 11:13:00,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 11:13:00,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 11:13:00,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 11:13:00,894 INFO L272 TraceCheckUtils]: 28: Hoare triple {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11331#true} is VALID [2022-04-08 11:13:00,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-08 11:13:00,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {11570#(or (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (not (<= (+ main_~x~0 2) main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11545#(or (not (<= (+ main_~x~0 1) main_~X~0)) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-08 11:13:00,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11570#(or (= (+ (* main_~X~0 (- 3)) (* 2 (* (+ main_~y~0 2) main_~X~0)) main_~v~0 (* main_~Y~0 4)) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)) (not (<= (+ main_~x~0 2) main_~X~0)))} is VALID [2022-04-08 11:13:00,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} assume !!(~x~0 <= ~X~0); {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} is VALID [2022-04-08 11:13:00,899 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11331#true} {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} #65#return; {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} is VALID [2022-04-08 11:13:00,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 11:13:00,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 11:13:00,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 11:13:00,900 INFO L272 TraceCheckUtils]: 19: Hoare triple {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11331#true} is VALID [2022-04-08 11:13:00,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} is VALID [2022-04-08 11:13:00,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {11331#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {11574#(or (= (+ main_~v~0 (* 2 (* main_~X~0 (+ main_~y~0 3))) (* main_~Y~0 6) (* main_~X~0 (- 5))) (+ (* main_~Y~0 2) (* (* (+ main_~x~0 3) main_~Y~0) 2))) (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 4)) (not (<= (+ main_~x~0 2) main_~X~0)))} is VALID [2022-04-08 11:13:00,901 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11331#true} {11331#true} #63#return; {11331#true} is VALID [2022-04-08 11:13:00,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 11:13:00,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 11:13:00,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 11:13:00,901 INFO L272 TraceCheckUtils]: 12: Hoare triple {11331#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {11331#true} is VALID [2022-04-08 11:13:00,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {11331#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {11331#true} is VALID [2022-04-08 11:13:00,901 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11331#true} {11331#true} #61#return; {11331#true} is VALID [2022-04-08 11:13:00,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 11:13:00,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {11331#true} assume !(0 == ~cond); {11331#true} is VALID [2022-04-08 11:13:00,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {11331#true} ~cond := #in~cond; {11331#true} is VALID [2022-04-08 11:13:00,902 INFO L272 TraceCheckUtils]: 6: Hoare triple {11331#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {11331#true} is VALID [2022-04-08 11:13:00,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {11331#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {11331#true} is VALID [2022-04-08 11:13:00,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {11331#true} call #t~ret8 := main(); {11331#true} is VALID [2022-04-08 11:13:00,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11331#true} {11331#true} #69#return; {11331#true} is VALID [2022-04-08 11:13:00,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-04-08 11:13:00,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {11331#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(15, 2);call #Ultimate.allocInit(12, 3); {11331#true} is VALID [2022-04-08 11:13:00,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {11331#true} call ULTIMATE.init(); {11331#true} is VALID [2022-04-08 11:13:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 11:13:00,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:13:00,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709117108] [2022-04-08 11:13:00,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:13:00,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312025125] [2022-04-08 11:13:00,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312025125] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:13:00,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:13:00,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2022-04-08 11:13:00,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:13:00,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1445018996] [2022-04-08 11:13:00,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1445018996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:13:00,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:13:00,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 11:13:00,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636197025] [2022-04-08 11:13:00,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:13:00,904 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-08 11:13:00,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:13:00,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:13:00,941 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 11:13:00,942 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 11:13:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:13:00,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 11:13:00,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-04-08 11:13:00,942 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:13:02,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:13:02,291 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-08 11:13:02,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 11:13:02,291 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-08 11:13:02,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:13:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:13:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-04-08 11:13:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:13:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-04-08 11:13:02,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 65 transitions. [2022-04-08 11:13:02,359 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 11:13:02,361 INFO L225 Difference]: With dead ends: 110 [2022-04-08 11:13:02,361 INFO L226 Difference]: Without dead ends: 108 [2022-04-08 11:13:02,361 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2022-04-08 11:13:02,362 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:13:02,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 239 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 11:13:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-08 11:13:02,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2022-04-08 11:13:02,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:13:02,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:13:02,579 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:13:02,579 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:13:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:13:02,581 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2022-04-08 11:13:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-04-08 11:13:02,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:13:02,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:13:02,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 108 states. [2022-04-08 11:13:02,582 INFO L87 Difference]: Start difference. First operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 108 states. [2022-04-08 11:13:02,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:13:02,584 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2022-04-08 11:13:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-04-08 11:13:02,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:13:02,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:13:02,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:13:02,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:13:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 73 states have internal predecessors, (78), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:13:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-04-08 11:13:02,586 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 50 [2022-04-08 11:13:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:13:02,587 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-04-08 11:13:02,587 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:13:02,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 106 transitions. [2022-04-08 11:13:04,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 105 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:13:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-04-08 11:13:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 11:13:04,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:13:04,827 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:13:04,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-08 11:13:05,027 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 11:13:05,028 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:13:05,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:13:05,028 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 3 times [2022-04-08 11:13:05,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:13:05,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1876018127] [2022-04-08 11:13:05,029 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:13:05,029 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 4 times [2022-04-08 11:13:05,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:13:05,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216437580] [2022-04-08 11:13:05,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:13:05,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:13:05,044 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:13:05,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1852582536] [2022-04-08 11:13:05,045 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:13:05,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:13:05,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:13:05,047 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:13:05,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 11:13:05,090 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:13:05,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:13:05,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:13:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:13:05,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:13:06,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {12286#true} call ULTIMATE.init(); {12286#true} is VALID [2022-04-08 11:13:06,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {12286#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(15, 2);call #Ultimate.allocInit(12, 3); {12286#true} is VALID [2022-04-08 11:13:06,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12286#true} {12286#true} #69#return; {12286#true} is VALID [2022-04-08 11:13:06,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {12286#true} call #t~ret8 := main(); {12286#true} is VALID [2022-04-08 11:13:06,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {12286#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {12286#true} is VALID [2022-04-08 11:13:06,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {12286#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {12286#true} is VALID [2022-04-08 11:13:06,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 11:13:06,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 11:13:06,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12286#true} {12286#true} #61#return; {12286#true} is VALID [2022-04-08 11:13:06,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {12286#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {12286#true} is VALID [2022-04-08 11:13:06,061 INFO L272 TraceCheckUtils]: 12: Hoare triple {12286#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {12286#true} is VALID [2022-04-08 11:13:06,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 11:13:06,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 11:13:06,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,062 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12286#true} {12286#true} #63#return; {12286#true} is VALID [2022-04-08 11:13:06,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {12286#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:13:06,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:13:06,063 INFO L272 TraceCheckUtils]: 19: Hoare triple {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12286#true} is VALID [2022-04-08 11:13:06,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 11:13:06,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 11:13:06,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,064 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12286#true} {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #65#return; {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:13:06,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 11:13:06,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {12342#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {12367#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:13:06,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {12367#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:13:06,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:13:06,068 INFO L272 TraceCheckUtils]: 28: Hoare triple {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12286#true} is VALID [2022-04-08 11:13:06,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 11:13:06,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 11:13:06,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,069 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12286#true} {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #65#return; {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:13:06,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 11:13:06,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {12371#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12396#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:13:06,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {12396#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:13:06,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:13:06,073 INFO L272 TraceCheckUtils]: 37: Hoare triple {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12286#true} is VALID [2022-04-08 11:13:06,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 11:13:06,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 11:13:06,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,074 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12286#true} {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:13:06,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !!(~x~0 <= ~X~0); {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:13:06,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:13:06,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {12400#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12428#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:13:06,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {12428#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12428#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:13:06,077 INFO L272 TraceCheckUtils]: 46: Hoare triple {12428#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12286#true} is VALID [2022-04-08 11:13:06,077 INFO L290 TraceCheckUtils]: 47: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 11:13:06,077 INFO L290 TraceCheckUtils]: 48: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 11:13:06,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,078 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12286#true} {12428#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {12428#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 11:13:06,079 INFO L290 TraceCheckUtils]: 51: Hoare triple {12428#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {12287#false} is VALID [2022-04-08 11:13:06,079 INFO L290 TraceCheckUtils]: 52: Hoare triple {12287#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {12287#false} is VALID [2022-04-08 11:13:06,079 INFO L272 TraceCheckUtils]: 53: Hoare triple {12287#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {12287#false} is VALID [2022-04-08 11:13:06,079 INFO L290 TraceCheckUtils]: 54: Hoare triple {12287#false} ~cond := #in~cond; {12287#false} is VALID [2022-04-08 11:13:06,079 INFO L290 TraceCheckUtils]: 55: Hoare triple {12287#false} assume 0 == ~cond; {12287#false} is VALID [2022-04-08 11:13:06,080 INFO L290 TraceCheckUtils]: 56: Hoare triple {12287#false} assume !false; {12287#false} is VALID [2022-04-08 11:13:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 11:13:06,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:13:06,494 INFO L290 TraceCheckUtils]: 56: Hoare triple {12287#false} assume !false; {12287#false} is VALID [2022-04-08 11:13:06,494 INFO L290 TraceCheckUtils]: 55: Hoare triple {12287#false} assume 0 == ~cond; {12287#false} is VALID [2022-04-08 11:13:06,494 INFO L290 TraceCheckUtils]: 54: Hoare triple {12287#false} ~cond := #in~cond; {12287#false} is VALID [2022-04-08 11:13:06,494 INFO L272 TraceCheckUtils]: 53: Hoare triple {12287#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {12287#false} is VALID [2022-04-08 11:13:06,495 INFO L290 TraceCheckUtils]: 52: Hoare triple {12287#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {12287#false} is VALID [2022-04-08 11:13:06,495 INFO L290 TraceCheckUtils]: 51: Hoare triple {12480#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {12287#false} is VALID [2022-04-08 11:13:06,496 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12286#true} {12480#(<= main_~x~0 main_~X~0)} #65#return; {12480#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 11:13:06,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 11:13:06,496 INFO L290 TraceCheckUtils]: 47: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 11:13:06,496 INFO L272 TraceCheckUtils]: 46: Hoare triple {12480#(<= main_~x~0 main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12286#true} is VALID [2022-04-08 11:13:06,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {12480#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12480#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 11:13:06,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {12502#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12480#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 11:13:06,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {12502#(<= (+ main_~x~0 1) main_~X~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {12502#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-08 11:13:06,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {12502#(<= (+ main_~x~0 1) main_~X~0)} assume !!(~x~0 <= ~X~0); {12502#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-08 11:13:06,499 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12286#true} {12502#(<= (+ main_~x~0 1) main_~X~0)} #65#return; {12502#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-08 11:13:06,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 11:13:06,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 11:13:06,500 INFO L272 TraceCheckUtils]: 37: Hoare triple {12502#(<= (+ main_~x~0 1) main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12286#true} is VALID [2022-04-08 11:13:06,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {12502#(<= (+ main_~x~0 1) main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12502#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-08 11:13:06,501 INFO L290 TraceCheckUtils]: 35: Hoare triple {12530#(<= (+ main_~x~0 2) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12502#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-08 11:13:06,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12530#(<= (+ main_~x~0 2) main_~X~0)} is VALID [2022-04-08 11:13:06,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !!(~x~0 <= ~X~0); {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-08 11:13:06,503 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12286#true} {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #65#return; {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-08 11:13:06,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 11:13:06,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 11:13:06,503 INFO L272 TraceCheckUtils]: 28: Hoare triple {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12286#true} is VALID [2022-04-08 11:13:06,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-08 11:13:06,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {12559#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12534#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-08 11:13:06,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {12563#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {12559#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-08 11:13:06,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {12563#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume !!(~x~0 <= ~X~0); {12563#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-08 11:13:06,507 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12286#true} {12563#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} #65#return; {12563#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-08 11:13:06,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 11:13:06,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 11:13:06,507 INFO L272 TraceCheckUtils]: 19: Hoare triple {12563#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12286#true} is VALID [2022-04-08 11:13:06,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {12563#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12563#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-08 11:13:06,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {12286#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {12563#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-08 11:13:06,509 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12286#true} {12286#true} #63#return; {12286#true} is VALID [2022-04-08 11:13:06,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 11:13:06,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 11:13:06,510 INFO L272 TraceCheckUtils]: 12: Hoare triple {12286#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {12286#true} is VALID [2022-04-08 11:13:06,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {12286#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {12286#true} is VALID [2022-04-08 11:13:06,510 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12286#true} {12286#true} #61#return; {12286#true} is VALID [2022-04-08 11:13:06,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {12286#true} assume !(0 == ~cond); {12286#true} is VALID [2022-04-08 11:13:06,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {12286#true} ~cond := #in~cond; {12286#true} is VALID [2022-04-08 11:13:06,510 INFO L272 TraceCheckUtils]: 6: Hoare triple {12286#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {12286#true} is VALID [2022-04-08 11:13:06,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {12286#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {12286#true} is VALID [2022-04-08 11:13:06,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {12286#true} call #t~ret8 := main(); {12286#true} is VALID [2022-04-08 11:13:06,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12286#true} {12286#true} #69#return; {12286#true} is VALID [2022-04-08 11:13:06,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {12286#true} assume true; {12286#true} is VALID [2022-04-08 11:13:06,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {12286#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(15, 2);call #Ultimate.allocInit(12, 3); {12286#true} is VALID [2022-04-08 11:13:06,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {12286#true} call ULTIMATE.init(); {12286#true} is VALID [2022-04-08 11:13:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 11:13:06,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:13:06,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216437580] [2022-04-08 11:13:06,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:13:06,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852582536] [2022-04-08 11:13:06,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852582536] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:13:06,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:13:06,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 11:13:06,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:13:06,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1876018127] [2022-04-08 11:13:06,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1876018127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:13:06,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:13:06,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:13:06,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694043606] [2022-04-08 11:13:06,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:13:06,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2022-04-08 11:13:06,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:13:06,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 11:13:06,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:13:06,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:13:06,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:13:06,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:13:06,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:13:06,560 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 11:13:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:13:07,133 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-04-08 11:13:07,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:13:07,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2022-04-08 11:13:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:13:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 11:13:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-08 11:13:07,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 11:13:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-08 11:13:07,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2022-04-08 11:13:07,213 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 11:13:07,215 INFO L225 Difference]: With dead ends: 111 [2022-04-08 11:13:07,215 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 11:13:07,216 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-08 11:13:07,216 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 11:13:07,216 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 11:13:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 11:13:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-04-08 11:13:07,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:13:07,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 101 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 11:13:07,531 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 101 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 11:13:07,532 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 101 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 11:13:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:13:07,535 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-04-08 11:13:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2022-04-08 11:13:07,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:13:07,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:13:07,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 103 states. [2022-04-08 11:13:07,536 INFO L87 Difference]: Start difference. First operand has 101 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 103 states. [2022-04-08 11:13:07,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:13:07,538 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-04-08 11:13:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2022-04-08 11:13:07,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:13:07,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:13:07,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:13:07,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:13:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 11:13:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-08 11:13:07,541 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 57 [2022-04-08 11:13:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:13:07,541 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-08 11:13:07,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 11:13:07,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-08 11:13:11,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 109 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 11:13:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-08 11:13:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 11:13:11,843 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:13:11,843 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:13:11,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 11:13:12,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 11:13:12,048 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:13:12,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:13:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 5 times [2022-04-08 11:13:12,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:13:12,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2145511441] [2022-04-08 11:13:12,048 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:13:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 6 times [2022-04-08 11:13:12,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:13:12,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979011641] [2022-04-08 11:13:12,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:13:12,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:13:12,058 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:13:12,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133149309] [2022-04-08 11:13:12,059 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:13:12,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:13:12,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:13:12,060 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:13:12,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 11:13:12,114 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 11:13:12,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:13:12,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 11:13:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:13:12,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:13:28,965 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:13:35,713 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:13:41,605 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:14:03,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {13271#true} call ULTIMATE.init(); {13271#true} is VALID [2022-04-08 11:14:03,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {13271#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(15, 2);call #Ultimate.allocInit(12, 3); {13271#true} is VALID [2022-04-08 11:14:03,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 11:14:03,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13271#true} {13271#true} #69#return; {13271#true} is VALID [2022-04-08 11:14:03,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {13271#true} call #t~ret8 := main(); {13271#true} is VALID [2022-04-08 11:14:03,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {13271#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {13271#true} is VALID [2022-04-08 11:14:03,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {13271#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {13271#true} is VALID [2022-04-08 11:14:03,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 11:14:03,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 11:14:03,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 11:14:03,065 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13271#true} {13271#true} #61#return; {13271#true} is VALID [2022-04-08 11:14:03,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {13271#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {13271#true} is VALID [2022-04-08 11:14:03,066 INFO L272 TraceCheckUtils]: 12: Hoare triple {13271#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {13271#true} is VALID [2022-04-08 11:14:03,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 11:14:03,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 11:14:03,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 11:14:03,066 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13271#true} {13271#true} #63#return; {13271#true} is VALID [2022-04-08 11:14:03,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {13271#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {13327#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-08 11:14:03,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {13327#(and (<= 0 main_~x~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13327#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-08 11:14:03,067 INFO L272 TraceCheckUtils]: 19: Hoare triple {13327#(and (<= 0 main_~x~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13271#true} is VALID [2022-04-08 11:14:03,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 11:14:03,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 11:14:03,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 11:14:03,067 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13271#true} {13327#(and (<= 0 main_~x~0) (= main_~y~0 0))} #65#return; {13327#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-08 11:14:03,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {13327#(and (<= 0 main_~x~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {13349#(and (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-08 11:14:03,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {13349#(and (<= 0 main_~X~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:14:03,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:14:03,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:14:03,070 INFO L272 TraceCheckUtils]: 28: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13271#true} is VALID [2022-04-08 11:14:03,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 11:14:03,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 11:14:03,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 11:14:03,071 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13271#true} {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} #65#return; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:14:03,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:14:03,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:14:03,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:14:03,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:14:03,072 INFO L272 TraceCheckUtils]: 37: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13271#true} is VALID [2022-04-08 11:14:03,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 11:14:03,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 11:14:03,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 11:14:03,073 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13271#true} {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} #65#return; {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:14:03,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {13353#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {13405#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-08 11:14:03,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {13405#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (<= 0 main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13409#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} is VALID [2022-04-08 11:14:03,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {13409#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13413#(and (= main_~y~0 2) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:14:03,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {13413#(and (= main_~y~0 2) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13417#(and (= main_~y~0 2) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:14:03,075 INFO L272 TraceCheckUtils]: 46: Hoare triple {13417#(and (= main_~y~0 2) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13271#true} is VALID [2022-04-08 11:14:03,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {13271#true} ~cond := #in~cond; {13424#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:14:03,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {13424#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:03,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:03,077 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} {13417#(and (= main_~y~0 2) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #65#return; {13435#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:14:03,078 INFO L290 TraceCheckUtils]: 51: Hoare triple {13435#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {13439#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 11:14:05,080 WARN L290 TraceCheckUtils]: 52: Hoare triple {13439#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {13443#(and (= main_~y~0 2) (or (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)))) (and (= (mod main_~xy~0 main_~y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0))) (<= 0 main_~X~0))} is UNKNOWN [2022-04-08 11:14:05,082 INFO L272 TraceCheckUtils]: 53: Hoare triple {13443#(and (= main_~y~0 2) (or (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)))) (and (= (mod main_~xy~0 main_~y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0))) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {13447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:14:05,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {13447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:14:05,083 INFO L290 TraceCheckUtils]: 55: Hoare triple {13451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13272#false} is VALID [2022-04-08 11:14:05,083 INFO L290 TraceCheckUtils]: 56: Hoare triple {13272#false} assume !false; {13272#false} is VALID [2022-04-08 11:14:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 11:14:05,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:14:15,241 INFO L290 TraceCheckUtils]: 56: Hoare triple {13272#false} assume !false; {13272#false} is VALID [2022-04-08 11:14:15,241 INFO L290 TraceCheckUtils]: 55: Hoare triple {13451#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13272#false} is VALID [2022-04-08 11:14:15,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {13447#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:14:15,243 INFO L272 TraceCheckUtils]: 53: Hoare triple {13467#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {13447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:14:15,244 INFO L290 TraceCheckUtils]: 52: Hoare triple {13471#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {13467#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:14:15,245 INFO L290 TraceCheckUtils]: 51: Hoare triple {13475#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {13471#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-08 11:14:15,246 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} {13479#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {13475#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-08 11:14:15,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:15,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {13489#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:14:15,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {13271#true} ~cond := #in~cond; {13489#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:14:15,247 INFO L272 TraceCheckUtils]: 46: Hoare triple {13479#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13271#true} is VALID [2022-04-08 11:14:15,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {13496#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13479#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-08 11:14:15,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {13500#(forall ((v_main_~x~0_70 Int)) (or (forall ((main_~Y~0 Int)) (= (+ (* (* v_main_~x~0_70 main_~y~0) 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0)) (* (* main_~X~0 main_~y~0) (- 2))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0))))) (not (<= v_main_~x~0_70 (+ main_~x~0 1))) (<= v_main_~x~0_70 main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13496#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} is VALID [2022-04-08 11:14:15,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {13504#(forall ((main_~Y~0 Int) (v_main_~x~0_70 Int)) (or (= (+ (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0)) (* (* v_main_~x~0_70 (+ main_~y~0 1)) 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0)))) (not (<= v_main_~x~0_70 (+ main_~x~0 1))) (<= v_main_~x~0_70 main_~X~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13500#(forall ((v_main_~x~0_70 Int)) (or (forall ((main_~Y~0 Int)) (= (+ (* (* v_main_~x~0_70 main_~y~0) 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0)) (* (* main_~X~0 main_~y~0) (- 2))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0))))) (not (<= v_main_~x~0_70 (+ main_~x~0 1))) (<= v_main_~x~0_70 main_~X~0)))} is VALID [2022-04-08 11:14:15,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {13271#true} assume !!(~x~0 <= ~X~0); {13504#(forall ((main_~Y~0 Int) (v_main_~x~0_70 Int)) (or (= (+ (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0)) (* (* v_main_~x~0_70 (+ main_~y~0 1)) 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_70 main_~Y~0)))) (not (<= v_main_~x~0_70 (+ main_~x~0 1))) (<= v_main_~x~0_70 main_~X~0)))} is VALID [2022-04-08 11:14:15,255 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13271#true} {13271#true} #65#return; {13271#true} is VALID [2022-04-08 11:14:15,255 INFO L290 TraceCheckUtils]: 40: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 11:14:15,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 11:14:15,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 11:14:15,255 INFO L272 TraceCheckUtils]: 37: Hoare triple {13271#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13271#true} is VALID [2022-04-08 11:14:15,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {13271#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13271#true} is VALID [2022-04-08 11:14:15,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {13271#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13271#true} is VALID [2022-04-08 11:14:15,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {13271#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13271#true} is VALID [2022-04-08 11:14:15,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {13271#true} assume !!(~x~0 <= ~X~0); {13271#true} is VALID [2022-04-08 11:14:15,255 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13271#true} {13271#true} #65#return; {13271#true} is VALID [2022-04-08 11:14:15,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 11:14:15,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 11:14:15,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 11:14:15,256 INFO L272 TraceCheckUtils]: 28: Hoare triple {13271#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13271#true} is VALID [2022-04-08 11:14:15,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {13271#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13271#true} is VALID [2022-04-08 11:14:15,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {13271#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13271#true} is VALID [2022-04-08 11:14:15,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {13271#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13271#true} is VALID [2022-04-08 11:14:15,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {13271#true} assume !!(~x~0 <= ~X~0); {13271#true} is VALID [2022-04-08 11:14:15,256 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13271#true} {13271#true} #65#return; {13271#true} is VALID [2022-04-08 11:14:15,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 11:14:15,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 11:14:15,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 11:14:15,257 INFO L272 TraceCheckUtils]: 19: Hoare triple {13271#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13271#true} is VALID [2022-04-08 11:14:15,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {13271#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13271#true} is VALID [2022-04-08 11:14:15,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {13271#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {13271#true} is VALID [2022-04-08 11:14:15,257 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13271#true} {13271#true} #63#return; {13271#true} is VALID [2022-04-08 11:14:15,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 11:14:15,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 11:14:15,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 11:14:15,257 INFO L272 TraceCheckUtils]: 12: Hoare triple {13271#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {13271#true} is VALID [2022-04-08 11:14:15,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {13271#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {13271#true} is VALID [2022-04-08 11:14:15,257 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13271#true} {13271#true} #61#return; {13271#true} is VALID [2022-04-08 11:14:15,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 11:14:15,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {13271#true} assume !(0 == ~cond); {13271#true} is VALID [2022-04-08 11:14:15,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {13271#true} ~cond := #in~cond; {13271#true} is VALID [2022-04-08 11:14:15,258 INFO L272 TraceCheckUtils]: 6: Hoare triple {13271#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {13271#true} is VALID [2022-04-08 11:14:15,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {13271#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {13271#true} is VALID [2022-04-08 11:14:15,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {13271#true} call #t~ret8 := main(); {13271#true} is VALID [2022-04-08 11:14:15,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13271#true} {13271#true} #69#return; {13271#true} is VALID [2022-04-08 11:14:15,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {13271#true} assume true; {13271#true} is VALID [2022-04-08 11:14:15,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {13271#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(15, 2);call #Ultimate.allocInit(12, 3); {13271#true} is VALID [2022-04-08 11:14:15,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {13271#true} call ULTIMATE.init(); {13271#true} is VALID [2022-04-08 11:14:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 11:14:15,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:14:15,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979011641] [2022-04-08 11:14:15,259 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:14:15,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133149309] [2022-04-08 11:14:15,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133149309] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:14:15,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:14:15,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-04-08 11:14:15,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:14:15,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2145511441] [2022-04-08 11:14:15,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2145511441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:14:15,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:14:15,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 11:14:15,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558531886] [2022-04-08 11:14:15,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:14:15,261 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-08 11:14:15,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:14:15,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:14:17,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:14:17,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 11:14:17,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:14:17,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 11:14:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-08 11:14:17,307 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:14:28,040 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 11:14:32,516 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 11:14:34,519 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 11:14:35,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:14:37,399 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:14:39,855 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 11:14:41,857 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 11:14:43,923 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 11:14:45,925 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 11:14:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:46,260 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-04-08 11:14:46,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 11:14:46,260 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-08 11:14:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:14:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:14:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions. [2022-04-08 11:14:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:14:46,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions. [2022-04-08 11:14:46,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 68 transitions. [2022-04-08 11:14:49,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:14:49,869 INFO L225 Difference]: With dead ends: 126 [2022-04-08 11:14:49,869 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 11:14:49,869 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2022-04-08 11:14:49,870 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 8 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2022-04-08 11:14:49,870 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 282 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 540 Invalid, 7 Unknown, 0 Unchecked, 18.4s Time] [2022-04-08 11:14:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 11:14:50,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2022-04-08 11:14:50,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:14:50,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 114 states, 84 states have (on average 1.119047619047619) internal successors, (94), 87 states have internal predecessors, (94), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 11:14:50,156 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 114 states, 84 states have (on average 1.119047619047619) internal successors, (94), 87 states have internal predecessors, (94), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 11:14:50,156 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 114 states, 84 states have (on average 1.119047619047619) internal successors, (94), 87 states have internal predecessors, (94), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 11:14:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:50,159 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2022-04-08 11:14:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2022-04-08 11:14:50,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:14:50,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:14:50,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 84 states have (on average 1.119047619047619) internal successors, (94), 87 states have internal predecessors, (94), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 118 states. [2022-04-08 11:14:50,160 INFO L87 Difference]: Start difference. First operand has 114 states, 84 states have (on average 1.119047619047619) internal successors, (94), 87 states have internal predecessors, (94), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 118 states. [2022-04-08 11:14:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:14:50,162 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2022-04-08 11:14:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2022-04-08 11:14:50,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:14:50,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:14:50,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:14:50,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:14:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.119047619047619) internal successors, (94), 87 states have internal predecessors, (94), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 11:14:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2022-04-08 11:14:50,165 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 57 [2022-04-08 11:14:50,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:14:50,166 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2022-04-08 11:14:50,166 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 11:14:50,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 130 transitions. [2022-04-08 11:14:52,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 129 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 11:14:52,552 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2022-04-08 11:14:52,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 11:14:52,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:14:52,553 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:14:52,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 11:14:52,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:14:52,767 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:14:52,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:14:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 5 times [2022-04-08 11:14:52,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:14:52,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1985588814] [2022-04-08 11:14:52,768 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:14:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 6 times [2022-04-08 11:14:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:14:52,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426256700] [2022-04-08 11:14:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:14:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:14:52,778 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:14:52,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597811265] [2022-04-08 11:14:52,778 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:14:52,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:14:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:14:52,779 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:14:52,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 11:14:52,896 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 11:14:52,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:14:52,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 11:14:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:14:52,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:15:11,748 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:15:22,592 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:15:28,626 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:15:52,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {14368#true} call ULTIMATE.init(); {14368#true} is VALID [2022-04-08 11:15:52,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {14368#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(15, 2);call #Ultimate.allocInit(12, 3); {14368#true} is VALID [2022-04-08 11:15:52,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 11:15:52,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14368#true} {14368#true} #69#return; {14368#true} is VALID [2022-04-08 11:15:52,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {14368#true} call #t~ret8 := main(); {14368#true} is VALID [2022-04-08 11:15:52,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {14368#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {14368#true} is VALID [2022-04-08 11:15:52,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {14368#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {14368#true} is VALID [2022-04-08 11:15:52,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {14368#true} ~cond := #in~cond; {14394#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:15:52,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {14394#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {14398#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:15:52,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {14398#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {14398#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:15:52,070 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14398#(not (= |assume_abort_if_not_#in~cond| 0))} {14368#true} #61#return; {14405#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:15:52,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {14405#(and (<= 0 main_~X~0) (<= main_~X~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {14405#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:15:52,071 INFO L272 TraceCheckUtils]: 12: Hoare triple {14405#(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)); {14368#true} is VALID [2022-04-08 11:15:52,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {14368#true} ~cond := #in~cond; {14394#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:15:52,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {14394#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {14398#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:15:52,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {14398#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {14398#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:15:52,072 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14398#(not (= |assume_abort_if_not_#in~cond| 0))} {14405#(and (<= 0 main_~X~0) (<= main_~X~0 5))} #63#return; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,073 INFO L272 TraceCheckUtils]: 19: Hoare triple {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-08 11:15:52,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 11:15:52,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 11:15:52,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 11:15:52,074 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14368#true} {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} #65#return; {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {14428#(and (<= 0 main_~x~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !!(~x~0 <= ~X~0); {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,076 INFO L272 TraceCheckUtils]: 28: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-08 11:15:52,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 11:15:52,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 11:15:52,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 11:15:52,077 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14368#true} {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} #65#return; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !!(~x~0 <= ~X~0); {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,078 INFO L272 TraceCheckUtils]: 37: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-08 11:15:52,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 11:15:52,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 11:15:52,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 11:15:52,079 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14368#true} {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} #65#return; {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {14424#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !!(~x~0 <= ~X~0); {14504#(and (<= main_~x~0 main_~X~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {14504#(and (<= main_~x~0 main_~X~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 5) (<= main_~Y~0 5))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14508#(and (<= main_~x~0 main_~X~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {14508#(and (<= main_~x~0 main_~X~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (<= main_~Y~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14512#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,083 INFO L290 TraceCheckUtils]: 45: Hoare triple {14512#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14516#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,083 INFO L272 TraceCheckUtils]: 46: Hoare triple {14516#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-08 11:15:52,083 INFO L290 TraceCheckUtils]: 47: Hoare triple {14368#true} ~cond := #in~cond; {14523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:15:52,083 INFO L290 TraceCheckUtils]: 48: Hoare triple {14523#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:15:52,084 INFO L290 TraceCheckUtils]: 49: Hoare triple {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:15:52,086 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} {14516#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} #65#return; {14534#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,086 INFO L290 TraceCheckUtils]: 51: Hoare triple {14534#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} assume !(~x~0 <= ~X~0); {14538#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,111 INFO L290 TraceCheckUtils]: 52: Hoare triple {14538#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)) (<= main_~Y~0 5))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {14542#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (or (and (or (and (= (mod main_~xy~0 main_~y~0) 0) (not (= main_~y~0 0)) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0))) (and (= main_~xy~0 0) (= main_~y~0 0))) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))) (<= main_~Y~0 5))} is VALID [2022-04-08 11:15:52,129 INFO L272 TraceCheckUtils]: 53: Hoare triple {14542#(and (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (<= main_~X~0 5) (or (and (or (and (= (mod main_~xy~0 main_~y~0) 0) (not (= main_~y~0 0)) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0))) (and (= main_~xy~0 0) (= main_~y~0 0))) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))) (<= main_~Y~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {14546#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:15:52,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {14546#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14550#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:15:52,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {14550#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14369#false} is VALID [2022-04-08 11:15:52,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {14369#false} assume !false; {14369#false} is VALID [2022-04-08 11:15:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 11:15:52,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:15:57,188 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:16:03,350 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:16:55,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {14369#false} assume !false; {14369#false} is VALID [2022-04-08 11:16:55,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {14550#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14369#false} is VALID [2022-04-08 11:16:55,608 INFO L290 TraceCheckUtils]: 54: Hoare triple {14546#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14550#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:16:55,609 INFO L272 TraceCheckUtils]: 53: Hoare triple {14566#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {14546#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:16:55,610 INFO L290 TraceCheckUtils]: 52: Hoare triple {14570#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {14566#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:16:55,610 INFO L290 TraceCheckUtils]: 51: Hoare triple {14574#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {14570#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-08 11:16:55,611 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} {14578#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {14574#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-08 11:16:55,612 INFO L290 TraceCheckUtils]: 49: Hoare triple {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:16:55,612 INFO L290 TraceCheckUtils]: 48: Hoare triple {14588#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14527#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:16:55,612 INFO L290 TraceCheckUtils]: 47: Hoare triple {14368#true} ~cond := #in~cond; {14588#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:16:55,612 INFO L272 TraceCheckUtils]: 46: Hoare triple {14578#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-08 11:16:57,619 WARN L290 TraceCheckUtils]: 45: Hoare triple {14595#(or (<= main_~x~0 main_~X~0) (and (or (= (+ main_~X~0 main_~v~0 (* (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) main_~x~0) 2)) (+ (* main_~Y~0 2) (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 2) (* 2 (* main_~Y~0 main_~x~0)))) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 0)) (= main_~X~0 0) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0))) (or (forall ((main_~y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))) (not (= main_~X~0 0)) (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14578#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is UNKNOWN [2022-04-08 11:16:57,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {14599#(forall ((v_main_~x~0_72 Int)) (or (<= v_main_~x~0_72 main_~X~0) (and (or (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_72 (- 2) main_~Y~0)) 2) 0)) (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) 0)) (not (= main_~X~0 0)) (forall ((main_~y~0 Int)) (= (+ main_~X~0 main_~v~0 (* 2 (* v_main_~x~0_72 main_~y~0))) (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2))))) (or (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_72 (- 2) main_~Y~0)) 2) 0)) (= main_~X~0 0) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) 0)) (= (+ (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) 2) (* 2 (* v_main_~x~0_72 main_~Y~0)) (* main_~Y~0 2)) (+ main_~X~0 main_~v~0 (* (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) v_main_~x~0_72) 2))))) (not (<= v_main_~x~0_72 (+ main_~x~0 1)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14595#(or (<= main_~x~0 main_~X~0) (and (or (= (+ main_~X~0 main_~v~0 (* (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) main_~x~0) 2)) (+ (* main_~Y~0 2) (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 2) (* 2 (* main_~Y~0 main_~x~0)))) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 0)) (= main_~X~0 0) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0))) (or (forall ((main_~y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))) (not (= main_~X~0 0)) (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0)))))} is VALID [2022-04-08 11:16:59,639 WARN L290 TraceCheckUtils]: 43: Hoare triple {14603#(forall ((v_main_~x~0_72 Int)) (or (<= v_main_~x~0_72 main_~X~0) (and (or (forall ((aux_div_v_main_~v~0_110_41 Int)) (or (and (or (forall ((aux_div_aux_mod_v_main_~v~0_110_41_79 Int)) (or (<= (+ aux_div_aux_mod_v_main_~v~0_110_41_79 1) aux_div_v_main_~v~0_110_41) (<= (+ 1 aux_div_v_main_~v~0_110_41) aux_div_aux_mod_v_main_~v~0_110_41_79) (<= (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0) (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0)) (* v_main_~x~0_72 (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0))))) (<= 0 (+ (div (+ (- 1) (* (- 1) main_~X~0)) 2) main_~Y~0 aux_div_v_main_~v~0_110_41))) (or (forall ((aux_div_aux_mod_v_main_~v~0_110_41_79 Int)) (or (<= (+ aux_div_aux_mod_v_main_~v~0_110_41_79 1) aux_div_v_main_~v~0_110_41) (<= (* v_main_~x~0_72 (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0)) (+ main_~Y~0 (* v_main_~x~0_72 main_~Y~0) (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) aux_div_v_main_~v~0_110_41)) (<= (+ 1 aux_div_v_main_~v~0_110_41) aux_div_aux_mod_v_main_~v~0_110_41_79))) (<= 0 (+ (div (+ (- 1) (* (- 1) main_~X~0)) 2) main_~Y~0 aux_div_v_main_~v~0_110_41)))) (not (= (mod (+ main_~Y~0 (* v_main_~x~0_72 main_~Y~0) aux_div_v_main_~v~0_110_41) main_~X~0) 0)))) (= main_~X~0 0)) (or (not (= main_~X~0 0)) (forall ((main_~y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* v_main_~x~0_72 main_~y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2)))) (< (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) 0))) (not (<= v_main_~x~0_72 (+ main_~x~0 1)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14599#(forall ((v_main_~x~0_72 Int)) (or (<= v_main_~x~0_72 main_~X~0) (and (or (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_72 (- 2) main_~Y~0)) 2) 0)) (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) 0)) (not (= main_~X~0 0)) (forall ((main_~y~0 Int)) (= (+ main_~X~0 main_~v~0 (* 2 (* v_main_~x~0_72 main_~y~0))) (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2))))) (or (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_72 (- 2) main_~Y~0)) 2) 0)) (= main_~X~0 0) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) 0)) (= (+ (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) 2) (* 2 (* v_main_~x~0_72 main_~Y~0)) (* main_~Y~0 2)) (+ main_~X~0 main_~v~0 (* (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) v_main_~x~0_72) 2))))) (not (<= v_main_~x~0_72 (+ main_~x~0 1)))))} is UNKNOWN [2022-04-08 11:16:59,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {14368#true} assume !!(~x~0 <= ~X~0); {14603#(forall ((v_main_~x~0_72 Int)) (or (<= v_main_~x~0_72 main_~X~0) (and (or (forall ((aux_div_v_main_~v~0_110_41 Int)) (or (and (or (forall ((aux_div_aux_mod_v_main_~v~0_110_41_79 Int)) (or (<= (+ aux_div_aux_mod_v_main_~v~0_110_41_79 1) aux_div_v_main_~v~0_110_41) (<= (+ 1 aux_div_v_main_~v~0_110_41) aux_div_aux_mod_v_main_~v~0_110_41_79) (<= (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0) (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0)) (* v_main_~x~0_72 (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0))))) (<= 0 (+ (div (+ (- 1) (* (- 1) main_~X~0)) 2) main_~Y~0 aux_div_v_main_~v~0_110_41))) (or (forall ((aux_div_aux_mod_v_main_~v~0_110_41_79 Int)) (or (<= (+ aux_div_aux_mod_v_main_~v~0_110_41_79 1) aux_div_v_main_~v~0_110_41) (<= (* v_main_~x~0_72 (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0)) (+ main_~Y~0 (* v_main_~x~0_72 main_~Y~0) (div (+ aux_div_aux_mod_v_main_~v~0_110_41_79 main_~Y~0 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) aux_div_v_main_~v~0_110_41)) (<= (+ 1 aux_div_v_main_~v~0_110_41) aux_div_aux_mod_v_main_~v~0_110_41_79))) (<= 0 (+ (div (+ (- 1) (* (- 1) main_~X~0)) 2) main_~Y~0 aux_div_v_main_~v~0_110_41)))) (not (= (mod (+ main_~Y~0 (* v_main_~x~0_72 main_~Y~0) aux_div_v_main_~v~0_110_41) main_~X~0) 0)))) (= main_~X~0 0)) (or (not (= main_~X~0 0)) (forall ((main_~y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* v_main_~x~0_72 main_~y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2)))) (< (+ (* 2 (* v_main_~x~0_72 main_~Y~0)) main_~X~0) 0))) (not (<= v_main_~x~0_72 (+ main_~x~0 1)))))} is VALID [2022-04-08 11:16:59,904 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14368#true} {14368#true} #65#return; {14368#true} is VALID [2022-04-08 11:16:59,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 11:16:59,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 11:16:59,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 11:16:59,904 INFO L272 TraceCheckUtils]: 37: Hoare triple {14368#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-08 11:16:59,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {14368#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14368#true} is VALID [2022-04-08 11:16:59,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {14368#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14368#true} is VALID [2022-04-08 11:16:59,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {14368#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14368#true} is VALID [2022-04-08 11:16:59,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {14368#true} assume !!(~x~0 <= ~X~0); {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14368#true} {14368#true} #65#return; {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L272 TraceCheckUtils]: 28: Hoare triple {14368#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {14368#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {14368#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {14368#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {14368#true} assume !!(~x~0 <= ~X~0); {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14368#true} {14368#true} #65#return; {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L272 TraceCheckUtils]: 19: Hoare triple {14368#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14368#true} is VALID [2022-04-08 11:16:59,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {14368#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {14368#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14368#true} {14368#true} #63#return; {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L272 TraceCheckUtils]: 12: Hoare triple {14368#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {14368#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14368#true} {14368#true} #61#return; {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {14368#true} assume !(0 == ~cond); {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {14368#true} ~cond := #in~cond; {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {14368#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {14368#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {14368#true} is VALID [2022-04-08 11:16:59,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {14368#true} call #t~ret8 := main(); {14368#true} is VALID [2022-04-08 11:16:59,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14368#true} {14368#true} #69#return; {14368#true} is VALID [2022-04-08 11:16:59,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {14368#true} assume true; {14368#true} is VALID [2022-04-08 11:16:59,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {14368#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(15, 2);call #Ultimate.allocInit(12, 3); {14368#true} is VALID [2022-04-08 11:16:59,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {14368#true} call ULTIMATE.init(); {14368#true} is VALID [2022-04-08 11:16:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 11:16:59,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:16:59,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426256700] [2022-04-08 11:16:59,907 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:16:59,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597811265] [2022-04-08 11:16:59,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597811265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:16:59,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:16:59,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 26 [2022-04-08 11:16:59,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:16:59,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1985588814] [2022-04-08 11:16:59,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1985588814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:16:59,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:16:59,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 11:16:59,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139524516] [2022-04-08 11:16:59,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:16:59,909 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2022-04-08 11:16:59,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:16:59,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:16:59,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:16:59,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 11:16:59,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:16:59,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 11:16:59,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=543, Unknown=5, NotChecked=0, Total=650 [2022-04-08 11:16:59,988 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:17:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:17:08,138 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2022-04-08 11:17:08,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 11:17:08,138 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2022-04-08 11:17:08,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:17:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:17:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 40 transitions. [2022-04-08 11:17:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:17:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 40 transitions. [2022-04-08 11:17:08,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 40 transitions. [2022-04-08 11:17:08,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:17:08,226 INFO L225 Difference]: With dead ends: 123 [2022-04-08 11:17:08,226 INFO L226 Difference]: Without dead ends: 115 [2022-04-08 11:17:08,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=249, Invalid=1152, Unknown=5, NotChecked=0, Total=1406 [2022-04-08 11:17:08,227 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 11:17:08,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 101 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 11:17:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-08 11:17:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2022-04-08 11:17:08,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:17:08,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 95 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:17:08,478 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 95 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:17:08,478 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 95 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:17:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:17:08,481 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2022-04-08 11:17:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-04-08 11:17:08,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:17:08,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:17:08,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 115 states. [2022-04-08 11:17:08,482 INFO L87 Difference]: Start difference. First operand has 95 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 115 states. [2022-04-08 11:17:08,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:17:08,485 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2022-04-08 11:17:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-04-08 11:17:08,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:17:08,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:17:08,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:17:08,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:17:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 11:17:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-04-08 11:17:08,488 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 57 [2022-04-08 11:17:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:17:08,488 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-04-08 11:17:08,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 11:17:08,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 103 transitions. [2022-04-08 11:17:09,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:17:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-04-08 11:17:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 11:17:09,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:17:09,062 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:17:09,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 11:17:09,262 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:17:09,263 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:17:09,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:17:09,263 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 15 times [2022-04-08 11:17:09,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:17:09,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [221852925] [2022-04-08 11:17:09,264 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:17:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 16 times [2022-04-08 11:17:09,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:17:09,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239843031] [2022-04-08 11:17:09,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:17:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:17:09,273 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:17:09,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [408748399] [2022-04-08 11:17:09,273 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 11:17:09,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:17:09,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:17:09,274 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:17:09,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 11:17:09,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 11:17:09,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:17:09,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 11:17:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:17:09,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:17:30,313 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:17:36,343 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:17:47,918 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:17:53,941 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:19:13,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {15425#true} call ULTIMATE.init(); {15425#true} is VALID [2022-04-08 11:19:13,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {15425#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(15, 2);call #Ultimate.allocInit(12, 3); {15425#true} is VALID [2022-04-08 11:19:13,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 11:19:13,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15425#true} {15425#true} #69#return; {15425#true} is VALID [2022-04-08 11:19:13,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {15425#true} call #t~ret8 := main(); {15425#true} is VALID [2022-04-08 11:19:13,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {15425#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {15425#true} is VALID [2022-04-08 11:19:13,647 INFO L272 TraceCheckUtils]: 6: Hoare triple {15425#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {15425#true} is VALID [2022-04-08 11:19:13,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {15425#true} ~cond := #in~cond; {15451#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 11:19:13,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {15451#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15455#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:19:13,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {15455#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15455#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 11:19:13,648 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15455#(not (= |assume_abort_if_not_#in~cond| 0))} {15425#true} #61#return; {15462#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {15462#(and (<= 0 main_~X~0) (<= main_~X~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {15462#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,649 INFO L272 TraceCheckUtils]: 12: Hoare triple {15462#(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)); {15425#true} is VALID [2022-04-08 11:19:13,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 11:19:13,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 11:19:13,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 11:19:13,650 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15425#true} {15462#(and (<= 0 main_~X~0) (<= main_~X~0 5))} #63#return; {15462#(and (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {15462#(and (<= 0 main_~X~0) (<= main_~X~0 5))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,651 INFO L272 TraceCheckUtils]: 19: Hoare triple {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-08 11:19:13,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 11:19:13,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 11:19:13,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 11:19:13,651 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15425#true} {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} #65#return; {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} assume !!(~x~0 <= ~X~0); {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {15484#(and (<= 0 main_~x~0) (<= 0 main_~X~0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (<= main_~X~0 5))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {15509#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 0 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {15509#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 0 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,655 INFO L272 TraceCheckUtils]: 28: Hoare triple {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-08 11:19:13,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 11:19:13,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 11:19:13,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 11:19:13,656 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15425#true} {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} #65#return; {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} assume !!(~x~0 <= ~X~0); {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {15513#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {15538#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {15538#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (<= main_~X~0 5))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,661 INFO L272 TraceCheckUtils]: 37: Hoare triple {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-08 11:19:13,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 11:19:13,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 11:19:13,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 11:19:13,662 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15425#true} {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} #65#return; {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} assume !!(~x~0 <= ~X~0); {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} is VALID [2022-04-08 11:19:13,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {15542#(and (< main_~v~0 (* main_~Y~0 4)) (< (* main_~Y~0 4) main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= 2 main_~x~0) (<= 0 main_~X~0) (<= main_~X~0 5))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15567#(and (< (* main_~Y~0 4) main_~X~0) (<= 2 main_~x~0) (<= main_~X~0 5) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-08 11:19:13,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {15567#(and (< (* main_~Y~0 4) main_~X~0) (<= 2 main_~x~0) (<= main_~X~0 5) (< 0 (* main_~Y~0 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15571#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-08 11:19:13,665 INFO L290 TraceCheckUtils]: 45: Hoare triple {15571#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15575#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-08 11:19:13,665 INFO L272 TraceCheckUtils]: 46: Hoare triple {15575#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (< 0 (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-08 11:19:13,666 INFO L290 TraceCheckUtils]: 47: Hoare triple {15425#true} ~cond := #in~cond; {15582#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:19:13,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {15582#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:19:13,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:19:13,668 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} {15575#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (= (* main_~X~0 main_~y~0) main_~xy~0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (< 0 (* main_~Y~0 2)))} #65#return; {15593#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-08 11:19:13,669 INFO L290 TraceCheckUtils]: 51: Hoare triple {15593#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {15593#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-08 11:19:13,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {15593#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {15600#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-08 11:19:13,672 INFO L290 TraceCheckUtils]: 53: Hoare triple {15600#(and (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 3 main_~x~0) (< 0 (* main_~Y~0 2)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15604#(and (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))) (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 4 main_~x~0) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-08 11:19:14,059 INFO L290 TraceCheckUtils]: 54: Hoare triple {15604#(and (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))) (< (* main_~Y~0 4) main_~X~0) (<= main_~X~0 5) (<= 4 main_~x~0) (< 0 (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15608#(and (<= 4 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (<= main_~X~0 5) (= (mod main_~xy~0 main_~X~0) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0) (< 0 (* main_~Y~0 2)))} is VALID [2022-04-08 11:19:14,062 INFO L272 TraceCheckUtils]: 55: Hoare triple {15608#(and (<= 4 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (< (* main_~Y~0 4) main_~X~0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (<= main_~X~0 5) (= (mod main_~xy~0 main_~X~0) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0) (< 0 (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15612#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:19:14,062 INFO L290 TraceCheckUtils]: 56: Hoare triple {15612#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15616#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:19:14,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {15616#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15426#false} is VALID [2022-04-08 11:19:14,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {15426#false} assume !false; {15426#false} is VALID [2022-04-08 11:19:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 40 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 11:19:14,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:19:19,940 INFO L290 TraceCheckUtils]: 58: Hoare triple {15426#false} assume !false; {15426#false} is VALID [2022-04-08 11:19:19,941 INFO L290 TraceCheckUtils]: 57: Hoare triple {15616#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15426#false} is VALID [2022-04-08 11:19:19,941 INFO L290 TraceCheckUtils]: 56: Hoare triple {15612#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15616#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:19:19,942 INFO L272 TraceCheckUtils]: 55: Hoare triple {15632#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15612#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 11:19:19,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {15636#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15632#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 11:19:19,946 INFO L290 TraceCheckUtils]: 53: Hoare triple {15640#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15636#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:19:19,946 INFO L290 TraceCheckUtils]: 52: Hoare triple {15636#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {15640#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 11:19:19,947 INFO L290 TraceCheckUtils]: 51: Hoare triple {15636#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {15636#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:19:19,948 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} {15650#(= (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} #65#return; {15636#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 11:19:19,948 INFO L290 TraceCheckUtils]: 49: Hoare triple {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:19:19,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {15660#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 11:19:19,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {15425#true} ~cond := #in~cond; {15660#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 11:19:19,949 INFO L272 TraceCheckUtils]: 46: Hoare triple {15650#(= (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-08 11:19:19,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {15425#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15650#(= (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-08 11:19:19,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {15425#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15425#true} is VALID [2022-04-08 11:19:19,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {15425#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15425#true} is VALID [2022-04-08 11:19:19,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {15425#true} assume !!(~x~0 <= ~X~0); {15425#true} is VALID [2022-04-08 11:19:19,950 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15425#true} {15425#true} #65#return; {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L272 TraceCheckUtils]: 37: Hoare triple {15425#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {15425#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {15425#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {15425#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {15425#true} assume !!(~x~0 <= ~X~0); {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15425#true} {15425#true} #65#return; {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L272 TraceCheckUtils]: 28: Hoare triple {15425#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {15425#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15425#true} is VALID [2022-04-08 11:19:19,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {15425#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {15425#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {15425#true} assume !!(~x~0 <= ~X~0); {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15425#true} {15425#true} #65#return; {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L272 TraceCheckUtils]: 19: Hoare triple {15425#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {15425#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {15425#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15425#true} {15425#true} #63#return; {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 11:19:19,952 INFO L272 TraceCheckUtils]: 12: Hoare triple {15425#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 5 then 1 else 0)); {15425#true} is VALID [2022-04-08 11:19:19,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {15425#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {15425#true} is VALID [2022-04-08 11:19:19,953 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15425#true} {15425#true} #61#return; {15425#true} is VALID [2022-04-08 11:19:19,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 11:19:19,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {15425#true} assume !(0 == ~cond); {15425#true} is VALID [2022-04-08 11:19:19,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {15425#true} ~cond := #in~cond; {15425#true} is VALID [2022-04-08 11:19:19,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {15425#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 5 then 1 else 0)); {15425#true} is VALID [2022-04-08 11:19:19,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {15425#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {15425#true} is VALID [2022-04-08 11:19:19,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {15425#true} call #t~ret8 := main(); {15425#true} is VALID [2022-04-08 11:19:19,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15425#true} {15425#true} #69#return; {15425#true} is VALID [2022-04-08 11:19:19,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {15425#true} assume true; {15425#true} is VALID [2022-04-08 11:19:19,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {15425#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(15, 2);call #Ultimate.allocInit(12, 3); {15425#true} is VALID [2022-04-08 11:19:19,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {15425#true} call ULTIMATE.init(); {15425#true} is VALID [2022-04-08 11:19:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 11:19:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:19:19,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239843031] [2022-04-08 11:19:19,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:19:19,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408748399] [2022-04-08 11:19:19,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408748399] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:19:19,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:19:19,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 26 [2022-04-08 11:19:19,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:19:19,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [221852925] [2022-04-08 11:19:19,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [221852925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:19:19,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:19:19,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 11:19:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772993635] [2022-04-08 11:19:19,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:19:19,955 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 11:19:19,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:19:19,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:19:20,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 11:19:20,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 11:19:20,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:20,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 11:19:20,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=567, Unknown=1, NotChecked=0, Total=650 [2022-04-08 11:19:20,345 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:19:22,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 11:19:25,442 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 11:19:28,342 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 11:19:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:49,912 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-04-08 11:19:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 11:19:49,912 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 11:19:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:19:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:19:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2022-04-08 11:19:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:19:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2022-04-08 11:19:49,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 65 transitions. [2022-04-08 11:19:51,071 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 11:19:51,072 INFO L225 Difference]: With dead ends: 107 [2022-04-08 11:19:51,072 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 11:19:51,073 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=196, Invalid=1135, Unknown=1, NotChecked=0, Total=1332 [2022-04-08 11:19:51,073 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-08 11:19:51,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 103 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 446 Invalid, 2 Unknown, 0 Unchecked, 13.0s Time] [2022-04-08 11:19:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 11:19:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-08 11:19:51,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:19:51,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:19:51,279 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:19:51,279 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:19:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:51,281 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-04-08 11:19:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-04-08 11:19:51,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:51,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:51,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 81 states. [2022-04-08 11:19:51,281 INFO L87 Difference]: Start difference. First operand has 81 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 81 states. [2022-04-08 11:19:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:19:51,283 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-04-08 11:19:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-04-08 11:19:51,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:19:51,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:19:51,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:19:51,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:19:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 11:19:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-04-08 11:19:51,285 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 59 [2022-04-08 11:19:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:19:51,285 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-04-08 11:19:51,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 11:19:51,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 87 transitions. [2022-04-08 11:19:51,663 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 11:19:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-04-08 11:19:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 11:19:51,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:19:51,664 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 11:19:51,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 11:19:51,864 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-08 11:19:51,864 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:19:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:19:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 17 times [2022-04-08 11:19:51,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:19:51,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [826250210] [2022-04-08 11:19:51,865 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 11:19:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 18 times [2022-04-08 11:19:51,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:19:51,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488324816] [2022-04-08 11:19:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:19:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:19:51,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:19:51,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172385113] [2022-04-08 11:19:51,876 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:19:51,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:19:51,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:19:51,877 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 11:19:51,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 11:19:51,924 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 11:19:51,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:19:51,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 11:19:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:19:51,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:20:23,785 WARN L232 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 11:20:42,180 WARN L232 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 11:20:55,012 WARN L232 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 11:21:08,359 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 11:21:14,162 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful