/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/prod4br-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 16:24:17,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 16:24:17,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 16:24:17,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 16:24:17,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 16:24:17,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 16:24:17,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 16:24:17,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 16:24:17,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 16:24:17,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 16:24:17,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 16:24:17,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 16:24:17,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 16:24:17,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 16:24:17,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 16:24:17,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 16:24:17,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 16:24:17,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 16:24:17,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 16:24:17,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 16:24:17,238 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 16:24:17,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 16:24:17,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 16:24:17,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 16:24:17,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 16:24:17,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 16:24:17,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 16:24:17,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 16:24:17,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 16:24:17,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 16:24:17,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 16:24:17,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 16:24:17,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 16:24:17,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 16:24:17,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 16:24:17,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 16:24:17,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 16:24:17,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 16:24:17,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 16:24:17,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 16:24:17,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 16:24:17,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 16:24:17,258 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 16:24:17,266 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 16:24:17,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 16:24:17,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 16:24:17,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 16:24:17,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 16:24:17,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 16:24:17,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 16:24:17,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 16:24:17,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 16:24:17,269 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 16:24:17,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 16:24:17,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 16:24:17,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 16:24:17,270 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 16:24:17,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 16:24:17,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 16:24:17,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 16:24:17,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 16:24:17,271 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 16:24:17,271 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 16:24:17,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 16:24:17,272 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 16:24:17,272 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 16:24:17,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 16:24:17,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 16:24:17,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 16:24:17,520 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 16:24:17,521 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 16:24:17,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound50.c [2022-04-15 16:24:17,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9a92057/1e877232c2a1488ab616f16e666e22c3/FLAGc26f6cc79 [2022-04-15 16:24:17,906 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 16:24:17,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound50.c [2022-04-15 16:24:17,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9a92057/1e877232c2a1488ab616f16e666e22c3/FLAGc26f6cc79 [2022-04-15 16:24:18,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9a92057/1e877232c2a1488ab616f16e666e22c3 [2022-04-15 16:24:18,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 16:24:18,343 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 16:24:18,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 16:24:18,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 16:24:18,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 16:24:18,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:24:18" (1/1) ... [2022-04-15 16:24:18,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d06a623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:24:18, skipping insertion in model container [2022-04-15 16:24:18,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:24:18" (1/1) ... [2022-04-15 16:24:18,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 16:24:18,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 16:24:18,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound50.c[524,537] [2022-04-15 16:24:18,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 16:24:18,540 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 16:24:18,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound50.c[524,537] [2022-04-15 16:24:18,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 16:24:18,569 INFO L208 MainTranslator]: Completed translation [2022-04-15 16:24:18,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:24:18 WrapperNode [2022-04-15 16:24:18,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 16:24:18,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 16:24:18,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 16:24:18,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 16:24:18,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:24:18" (1/1) ... [2022-04-15 16:24:18,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:24:18" (1/1) ... [2022-04-15 16:24:18,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:24:18" (1/1) ... [2022-04-15 16:24:18,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:24:18" (1/1) ... [2022-04-15 16:24:18,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:24:18" (1/1) ... [2022-04-15 16:24:18,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:24:18" (1/1) ... [2022-04-15 16:24:18,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:24:18" (1/1) ... [2022-04-15 16:24:18,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 16:24:18,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 16:24:18,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 16:24:18,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 16:24:18,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:24:18" (1/1) ... [2022-04-15 16:24:18,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 16:24:18,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:24:18,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 16:24:18,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 16:24:18,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 16:24:18,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 16:24:18,669 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 16:24:18,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 16:24:18,669 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 16:24:18,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 16:24:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 16:24:18,669 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 16:24:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 16:24:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 16:24:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 16:24:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 16:24:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 16:24:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 16:24:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 16:24:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 16:24:18,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 16:24:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 16:24:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 16:24:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 16:24:18,718 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 16:24:18,719 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 16:24:18,923 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 16:24:18,935 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 16:24:18,935 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 16:24:18,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:24:18 BoogieIcfgContainer [2022-04-15 16:24:18,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 16:24:18,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 16:24:18,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 16:24:18,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 16:24:18,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 04:24:18" (1/3) ... [2022-04-15 16:24:18,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275189dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:24:18, skipping insertion in model container [2022-04-15 16:24:18,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:24:18" (2/3) ... [2022-04-15 16:24:18,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275189dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:24:18, skipping insertion in model container [2022-04-15 16:24:18,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:24:18" (3/3) ... [2022-04-15 16:24:18,950 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound50.c [2022-04-15 16:24:18,955 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 16:24:18,955 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 16:24:18,984 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 16:24:18,989 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 16:24:18,989 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 16:24:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:24:19,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 16:24:19,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:24:19,024 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:24:19,025 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:24:19,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:24:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 1 times [2022-04-15 16:24:19,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:24:19,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1079023286] [2022-04-15 16:24:19,042 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:24:19,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 2 times [2022-04-15 16:24:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:24:19,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615833923] [2022-04-15 16:24:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:24:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:24:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:24:19,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 16:24:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:24:19,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-15 16:24:19,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-15 16:24:19,197 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-15 16:24:19,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 16:24:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:24:19,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 16:24:19,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 16:24:19,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 16:24:19,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-15 16:24:19,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 16:24:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:24:19,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 16:24:19,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 16:24:19,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 16:24:19,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-15 16:24:19,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 16:24:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:24:19,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 16:24:19,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 16:24:19,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 16:24:19,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-15 16:24:19,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 16:24:19,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-15 16:24:19,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-15 16:24:19,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-15 16:24:19,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-15 16:24:19,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {37#true} is VALID [2022-04-15 16:24:19,224 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {37#true} is VALID [2022-04-15 16:24:19,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 16:24:19,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 16:24:19,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 16:24:19,226 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-15 16:24:19,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38#false} is VALID [2022-04-15 16:24:19,226 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {37#true} is VALID [2022-04-15 16:24:19,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 16:24:19,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 16:24:19,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 16:24:19,227 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-15 16:24:19,227 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-15 16:24:19,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 16:24:19,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 16:24:19,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 16:24:19,228 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-15 16:24:19,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {38#false} is VALID [2022-04-15 16:24:19,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-15 16:24:19,229 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {38#false} is VALID [2022-04-15 16:24:19,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-15 16:24:19,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-15 16:24:19,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-15 16:24:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 16:24:19,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:24:19,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615833923] [2022-04-15 16:24:19,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615833923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:24:19,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:24:19,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 16:24:19,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:24:19,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1079023286] [2022-04-15 16:24:19,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1079023286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:24:19,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:24:19,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 16:24:19,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601305814] [2022-04-15 16:24:19,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:24:19,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 16:24:19,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:24:19,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 16:24:19,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:24:19,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 16:24:19,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:24:19,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 16:24:19,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 16:24:19,287 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 16:24:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:24:19,398 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-15 16:24:19,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 16:24:19,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 16:24:19,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:24:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 16:24:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-15 16:24:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 16:24:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-15 16:24:19,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-04-15 16:24:19,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:24:19,546 INFO L225 Difference]: With dead ends: 61 [2022-04-15 16:24:19,547 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 16:24:19,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 16:24:19,559 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 16:24:19,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 16:24:19,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 16:24:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 16:24:19,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:24:19,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:24:19,600 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:24:19,600 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:24:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:24:19,604 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-15 16:24:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 16:24:19,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:24:19,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:24:19,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-15 16:24:19,606 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-15 16:24:19,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:24:19,609 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-15 16:24:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 16:24:19,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:24:19,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:24:19,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:24:19,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:24:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:24:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-15 16:24:19,613 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-15 16:24:19,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:24:19,614 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-15 16:24:19,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 16:24:19,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 36 transitions. [2022-04-15 16:24:19,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:24:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 16:24:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 16:24:19,665 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:24:19,665 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:24:19,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 16:24:19,666 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:24:19,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:24:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 1 times [2022-04-15 16:24:19,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:24:19,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [543917866] [2022-04-15 16:24:19,673 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:24:19,674 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 2 times [2022-04-15 16:24:19,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:24:19,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560426221] [2022-04-15 16:24:19,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:24:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:24:19,715 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:24:19,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413205118] [2022-04-15 16:24:19,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:24:19,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:24:19,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:24:19,727 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 16:24:19,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 16:24:19,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 16:24:19,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:24:19,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 16:24:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:24:19,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:24:20,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} call ULTIMATE.init(); {295#true} is VALID [2022-04-15 16:24:20,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {295#true} is VALID [2022-04-15 16:24:20,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-15 16:24:20,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} #83#return; {295#true} is VALID [2022-04-15 16:24:20,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} call #t~ret6 := main(); {295#true} is VALID [2022-04-15 16:24:20,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {295#true} is VALID [2022-04-15 16:24:20,016 INFO L272 TraceCheckUtils]: 6: Hoare triple {295#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {295#true} is VALID [2022-04-15 16:24:20,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-15 16:24:20,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-15 16:24:20,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-15 16:24:20,017 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {295#true} {295#true} #71#return; {295#true} is VALID [2022-04-15 16:24:20,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {295#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {295#true} is VALID [2022-04-15 16:24:20,019 INFO L272 TraceCheckUtils]: 12: Hoare triple {295#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {295#true} is VALID [2022-04-15 16:24:20,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-15 16:24:20,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-15 16:24:20,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-15 16:24:20,020 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {295#true} {295#true} #73#return; {295#true} is VALID [2022-04-15 16:24:20,020 INFO L272 TraceCheckUtils]: 17: Hoare triple {295#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {295#true} is VALID [2022-04-15 16:24:20,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-15 16:24:20,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-15 16:24:20,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-15 16:24:20,021 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {295#true} {295#true} #75#return; {295#true} is VALID [2022-04-15 16:24:20,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {295#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 16:24:20,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 16:24:20,023 INFO L272 TraceCheckUtils]: 24: Hoare triple {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {373#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:24:20,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {373#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {377#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:24:20,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {377#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {296#false} is VALID [2022-04-15 16:24:20,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-04-15 16:24:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 16:24:20,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 16:24:20,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:24:20,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560426221] [2022-04-15 16:24:20,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:24:20,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413205118] [2022-04-15 16:24:20,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413205118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:24:20,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:24:20,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 16:24:20,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:24:20,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [543917866] [2022-04-15 16:24:20,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [543917866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:24:20,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:24:20,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 16:24:20,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096036163] [2022-04-15 16:24:20,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:24:20,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-15 16:24:20,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:24:20,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 16:24:20,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:24:20,048 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 16:24:20,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:24:20,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 16:24:20,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 16:24:20,049 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 16:24:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:24:20,257 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-15 16:24:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 16:24:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-15 16:24:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:24:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 16:24:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-15 16:24:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 16:24:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-15 16:24:20,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-15 16:24:20,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:24:20,333 INFO L225 Difference]: With dead ends: 43 [2022-04-15 16:24:20,333 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 16:24:20,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 16:24:20,334 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 16:24:20,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 92 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 16:24:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 16:24:20,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2022-04-15 16:24:20,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:24:20,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:24:20,346 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:24:20,346 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:24:20,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:24:20,350 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-15 16:24:20,350 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-15 16:24:20,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:24:20,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:24:20,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-15 16:24:20,351 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-15 16:24:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:24:20,354 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-15 16:24:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-15 16:24:20,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:24:20,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:24:20,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:24:20,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:24:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:24:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-04-15 16:24:20,358 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 28 [2022-04-15 16:24:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:24:20,358 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-04-15 16:24:20,358 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 16:24:20,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 42 transitions. [2022-04-15 16:24:20,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:24:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-15 16:24:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 16:24:20,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:24:20,404 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:24:20,427 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-15 16:24:20,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:24:20,620 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:24:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:24:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 1 times [2022-04-15 16:24:20,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:24:20,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1171556904] [2022-04-15 16:24:20,621 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:24:20,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 2 times [2022-04-15 16:24:20,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:24:20,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042278949] [2022-04-15 16:24:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:24:20,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:24:20,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:24:20,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350676362] [2022-04-15 16:24:20,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:24:20,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:24:20,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:24:20,652 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 16:24:20,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 16:24:20,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:24:20,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:24:20,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 16:24:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:24:20,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:24:30,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-15 16:24:30,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-15 16:24:30,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 16:24:30,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-15 16:24:30,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-15 16:24:30,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {623#true} is VALID [2022-04-15 16:24:30,021 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {623#true} is VALID [2022-04-15 16:24:30,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:24:30,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:24:30,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:24:30,023 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {653#(not (= |assume_abort_if_not_#in~cond| 0))} {623#true} #71#return; {660#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:24:30,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {660#(and (<= 0 main_~x~0) (<= main_~x~0 50))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {660#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:24:30,024 INFO L272 TraceCheckUtils]: 12: Hoare triple {660#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {623#true} is VALID [2022-04-15 16:24:30,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-15 16:24:30,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-15 16:24:30,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 16:24:30,025 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {623#true} {660#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #73#return; {660#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:24:30,026 INFO L272 TraceCheckUtils]: 17: Hoare triple {660#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-15 16:24:30,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#true} ~cond := #in~cond; {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:24:30,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:24:30,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:24:30,028 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#(not (= |assume_abort_if_not_#in~cond| 0))} {660#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #75#return; {694#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 16:24:30,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {694#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {698#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:24:30,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {698#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !false; {698#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:24:30,029 INFO L272 TraceCheckUtils]: 24: Hoare triple {698#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {623#true} is VALID [2022-04-15 16:24:30,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#true} ~cond := #in~cond; {708#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:24:30,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {708#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:24:30,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:24:32,033 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} {698#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} #77#return; {719#(and (<= 0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-15 16:24:32,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {719#(and (<= 0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {723#(and (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 16:24:32,038 INFO L272 TraceCheckUtils]: 30: Hoare triple {723#(and (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:24:32,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:24:32,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-15 16:24:32,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-15 16:24:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 16:24:32,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:25:30,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-15 16:25:30,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-15 16:25:30,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:25:30,445 INFO L272 TraceCheckUtils]: 30: Hoare triple {747#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:25:30,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {751#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {747#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:25:30,448 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} {623#true} #77#return; {751#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 16:25:30,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:25:30,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:25:30,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#true} ~cond := #in~cond; {764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:25:30,450 INFO L272 TraceCheckUtils]: 24: Hoare triple {623#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {623#true} is VALID [2022-04-15 16:25:30,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {623#true} assume !false; {623#true} is VALID [2022-04-15 16:25:30,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {623#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {623#true} is VALID [2022-04-15 16:25:30,452 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {623#true} {623#true} #75#return; {623#true} is VALID [2022-04-15 16:25:30,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 16:25:30,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-15 16:25:30,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-15 16:25:30,464 INFO L272 TraceCheckUtils]: 17: Hoare triple {623#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-15 16:25:30,464 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {623#true} {623#true} #73#return; {623#true} is VALID [2022-04-15 16:25:30,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 16:25:30,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-15 16:25:30,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-15 16:25:30,466 INFO L272 TraceCheckUtils]: 12: Hoare triple {623#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {623#true} is VALID [2022-04-15 16:25:30,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {623#true} is VALID [2022-04-15 16:25:30,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {623#true} {623#true} #71#return; {623#true} is VALID [2022-04-15 16:25:30,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 16:25:30,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-15 16:25:30,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-15 16:25:30,467 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {623#true} is VALID [2022-04-15 16:25:30,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {623#true} is VALID [2022-04-15 16:25:30,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-15 16:25:30,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-15 16:25:30,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 16:25:30,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-15 16:25:30,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-15 16:25:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 16:25:30,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:25:30,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042278949] [2022-04-15 16:25:30,469 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:25:30,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350676362] [2022-04-15 16:25:30,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350676362] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:25:30,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:25:30,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-15 16:25:30,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:25:30,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1171556904] [2022-04-15 16:25:30,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1171556904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:25:30,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:25:30,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 16:25:30,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117886720] [2022-04-15 16:25:30,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:25:30,474 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2022-04-15 16:25:30,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:25:30,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 16:25:32,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:25:32,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 16:25:32,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:25:32,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 16:25:32,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-04-15 16:25:32,507 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 16:25:35,137 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-15 16:25:40,607 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-15 16:25:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:25:40,823 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-15 16:25:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 16:25:40,823 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2022-04-15 16:25:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:25:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 16:25:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-15 16:25:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 16:25:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-15 16:25:40,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2022-04-15 16:25:40,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:25:40,879 INFO L225 Difference]: With dead ends: 47 [2022-04-15 16:25:40,879 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 16:25:40,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-15 16:25:40,880 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-15 16:25:40,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 137 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2022-04-15 16:25:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 16:25:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-04-15 16:25:40,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:25:40,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:25:40,930 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:25:40,930 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:25:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:25:40,934 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 16:25:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-15 16:25:40,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:25:40,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:25:40,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-15 16:25:40,935 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-15 16:25:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:25:40,938 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 16:25:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-15 16:25:40,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:25:40,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:25:40,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:25:40,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:25:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:25:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-15 16:25:40,941 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 34 [2022-04-15 16:25:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:25:40,942 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-15 16:25:40,942 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 16:25:40,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 49 transitions. [2022-04-15 16:25:41,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:25:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-15 16:25:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 16:25:41,009 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:25:41,009 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:25:41,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 16:25:41,209 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 16:25:41,209 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:25:41,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:25:41,210 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 1 times [2022-04-15 16:25:41,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:25:41,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1945989761] [2022-04-15 16:25:41,211 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:25:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 2 times [2022-04-15 16:25:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:25:41,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667583749] [2022-04-15 16:25:41,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:25:41,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:25:41,227 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:25:41,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [947252591] [2022-04-15 16:25:41,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:25:41,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:25:41,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:25:41,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 16:25:41,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 16:25:41,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:25:41,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:25:41,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 16:25:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:25:41,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:25:44,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-15 16:25:44,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1116#true} is VALID [2022-04-15 16:25:44,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 16:25:44,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #83#return; {1116#true} is VALID [2022-04-15 16:25:44,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-15 16:25:44,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-15 16:25:44,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {1116#true} is VALID [2022-04-15 16:25:44,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:25:44,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:25:44,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:25:44,605 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1116#true} #71#return; {1153#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:25:44,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {1153#(and (<= 0 main_~x~0) (<= main_~x~0 50))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1153#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:25:44,606 INFO L272 TraceCheckUtils]: 12: Hoare triple {1153#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {1116#true} is VALID [2022-04-15 16:25:44,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 16:25:44,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 16:25:44,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 16:25:44,607 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1116#true} {1153#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #73#return; {1153#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:25:44,607 INFO L272 TraceCheckUtils]: 17: Hoare triple {1153#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1116#true} is VALID [2022-04-15 16:25:44,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {1116#true} ~cond := #in~cond; {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:25:44,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:25:44,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:25:44,609 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1153#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #75#return; {1187#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 16:25:44,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {1187#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1191#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 16:25:44,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {1191#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1191#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 16:25:44,611 INFO L272 TraceCheckUtils]: 24: Hoare triple {1191#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-15 16:25:44,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 16:25:44,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 16:25:44,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 16:25:44,612 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1116#true} {1191#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {1191#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 16:25:44,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {1191#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1191#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 16:25:44,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {1191#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1216#(and (= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 16:25:44,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {1216#(and (= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} assume !false; {1216#(and (= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 16:25:44,617 INFO L272 TraceCheckUtils]: 32: Hoare triple {1216#(and (= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:25:44,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:25:44,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {1227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-15 16:25:44,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-15 16:25:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 16:25:44,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:26:43,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-15 16:26:43,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {1227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-15 16:26:43,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:26:43,398 INFO L272 TraceCheckUtils]: 32: Hoare triple {1243#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:26:43,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {1243#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {1243#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:26:43,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1243#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:26:43,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume !!(0 != ~a~0 && 0 != ~b~0); {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-15 16:26:43,403 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1116#true} {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} #77#return; {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-15 16:26:43,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 16:26:43,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 16:26:43,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 16:26:43,403 INFO L272 TraceCheckUtils]: 24: Hoare triple {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-15 16:26:43,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume !false; {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-15 16:26:43,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {1275#(or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-15 16:26:43,411 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1116#true} #75#return; {1275#(or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 16:26:43,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:43,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {1288#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:43,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {1116#true} ~cond := #in~cond; {1288#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 16:26:43,416 INFO L272 TraceCheckUtils]: 17: Hoare triple {1116#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1116#true} is VALID [2022-04-15 16:26:43,416 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1116#true} {1116#true} #73#return; {1116#true} is VALID [2022-04-15 16:26:43,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 16:26:43,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 16:26:43,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 16:26:43,416 INFO L272 TraceCheckUtils]: 12: Hoare triple {1116#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {1116#true} is VALID [2022-04-15 16:26:43,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1116#true} is VALID [2022-04-15 16:26:43,417 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #71#return; {1116#true} is VALID [2022-04-15 16:26:43,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 16:26:43,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 16:26:43,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 16:26:43,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {1116#true} is VALID [2022-04-15 16:26:43,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-15 16:26:43,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-15 16:26:43,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #83#return; {1116#true} is VALID [2022-04-15 16:26:43,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 16:26:43,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1116#true} is VALID [2022-04-15 16:26:43,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-15 16:26:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 16:26:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:26:43,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667583749] [2022-04-15 16:26:43,419 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:26:43,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947252591] [2022-04-15 16:26:43,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947252591] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:26:43,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:26:43,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-15 16:26:43,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:26:43,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1945989761] [2022-04-15 16:26:43,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1945989761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:26:43,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:26:43,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 16:26:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100377559] [2022-04-15 16:26:43,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:26:43,420 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-15 16:26:43,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:26:43,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 16:26:43,451 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-15 16:26:43,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 16:26:43,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:26:43,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 16:26:43,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-04-15 16:26:43,452 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 16:26:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:26:44,332 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-15 16:26:44,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 16:26:44,333 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-15 16:26:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:26:44,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 16:26:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-15 16:26:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 16:26:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-15 16:26:44,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2022-04-15 16:26:44,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:26:44,406 INFO L225 Difference]: With dead ends: 59 [2022-04-15 16:26:44,406 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 16:26:44,406 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-15 16:26:44,407 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 16:26:44,407 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 125 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 16:26:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 16:26:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2022-04-15 16:26:44,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:26:44,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 16:26:44,474 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 16:26:44,474 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 16:26:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:26:44,477 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-15 16:26:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2022-04-15 16:26:44,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:26:44,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:26:44,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 57 states. [2022-04-15 16:26:44,478 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 57 states. [2022-04-15 16:26:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:26:44,481 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-15 16:26:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2022-04-15 16:26:44,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:26:44,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:26:44,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:26:44,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:26:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 16:26:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-15 16:26:44,484 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 36 [2022-04-15 16:26:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:26:44,484 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-15 16:26:44,484 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 16:26:44,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-15 16:26:44,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:26:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-15 16:26:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 16:26:44,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:26:44,567 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:26:44,587 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-15 16:26:44,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:26:44,779 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:26:44,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:26:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2032180221, now seen corresponding path program 1 times [2022-04-15 16:26:44,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:26:44,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1716755960] [2022-04-15 16:26:44,780 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:26:44,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2032180221, now seen corresponding path program 2 times [2022-04-15 16:26:44,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:26:44,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24637168] [2022-04-15 16:26:44,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:26:44,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:26:44,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:26:44,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323770536] [2022-04-15 16:26:44,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:26:44,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:26:44,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:26:44,802 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 16:26:44,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 16:26:44,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:26:44,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:26:44,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 16:26:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:26:44,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:26:45,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {1677#true} call ULTIMATE.init(); {1677#true} is VALID [2022-04-15 16:26:45,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {1677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1677#true} is VALID [2022-04-15 16:26:45,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 16:26:45,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1677#true} {1677#true} #83#return; {1677#true} is VALID [2022-04-15 16:26:45,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {1677#true} call #t~ret6 := main(); {1677#true} is VALID [2022-04-15 16:26:45,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {1677#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1677#true} is VALID [2022-04-15 16:26:45,252 INFO L272 TraceCheckUtils]: 6: Hoare triple {1677#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {1677#true} is VALID [2022-04-15 16:26:45,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-15 16:26:45,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-15 16:26:45,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 16:26:45,253 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1677#true} {1677#true} #71#return; {1677#true} is VALID [2022-04-15 16:26:45,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {1677#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1677#true} is VALID [2022-04-15 16:26:45,253 INFO L272 TraceCheckUtils]: 12: Hoare triple {1677#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {1677#true} is VALID [2022-04-15 16:26:45,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-15 16:26:45,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-15 16:26:45,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 16:26:45,253 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1677#true} {1677#true} #73#return; {1677#true} is VALID [2022-04-15 16:26:45,254 INFO L272 TraceCheckUtils]: 17: Hoare triple {1677#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1677#true} is VALID [2022-04-15 16:26:45,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {1677#true} ~cond := #in~cond; {1736#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:26:45,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {1736#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1740#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:45,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {1740#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1740#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:45,258 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1740#(not (= |assume_abort_if_not_#in~cond| 0))} {1677#true} #75#return; {1747#(<= 1 main_~y~0)} is VALID [2022-04-15 16:26:45,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {1747#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1751#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 16:26:45,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {1751#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1751#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 16:26:45,259 INFO L272 TraceCheckUtils]: 24: Hoare triple {1751#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1677#true} is VALID [2022-04-15 16:26:45,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-15 16:26:45,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-15 16:26:45,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 16:26:45,260 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1677#true} {1751#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {1751#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 16:26:45,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {1751#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1751#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 16:26:45,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {1751#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1751#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 16:26:45,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {1751#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1779#(and (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-15 16:26:45,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {1779#(and (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (<= 1 main_~y~0) (= main_~p~0 1))} assume !false; {1779#(and (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-15 16:26:45,270 INFO L272 TraceCheckUtils]: 33: Hoare triple {1779#(and (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1786#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:26:45,271 INFO L290 TraceCheckUtils]: 34: Hoare triple {1786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:26:45,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {1790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1678#false} is VALID [2022-04-15 16:26:45,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {1678#false} assume !false; {1678#false} is VALID [2022-04-15 16:26:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 16:26:45,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:26:45,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {1678#false} assume !false; {1678#false} is VALID [2022-04-15 16:26:45,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {1790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1678#false} is VALID [2022-04-15 16:26:45,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {1786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:26:45,750 INFO L272 TraceCheckUtils]: 33: Hoare triple {1806#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1786#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:26:45,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {1806#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {1806#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:26:45,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {1813#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1806#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:26:45,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {1813#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1813#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 16:26:45,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {1820#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)) (= main_~b~0 0))} assume !!(0 != ~a~0 && 0 != ~b~0); {1813#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 16:26:45,767 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1677#true} {1820#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)) (= main_~b~0 0))} #77#return; {1820#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)) (= main_~b~0 0))} is VALID [2022-04-15 16:26:45,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 16:26:45,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-15 16:26:45,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-15 16:26:45,767 INFO L272 TraceCheckUtils]: 24: Hoare triple {1820#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)) (= main_~b~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1677#true} is VALID [2022-04-15 16:26:45,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {1820#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)) (= main_~b~0 0))} assume !false; {1820#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)) (= main_~b~0 0))} is VALID [2022-04-15 16:26:45,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {1677#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1820#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)) (= main_~b~0 0))} is VALID [2022-04-15 16:26:45,769 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1677#true} {1677#true} #75#return; {1677#true} is VALID [2022-04-15 16:26:45,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 16:26:45,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-15 16:26:45,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-15 16:26:45,769 INFO L272 TraceCheckUtils]: 17: Hoare triple {1677#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1677#true} is VALID [2022-04-15 16:26:45,769 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1677#true} {1677#true} #73#return; {1677#true} is VALID [2022-04-15 16:26:45,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 16:26:45,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-15 16:26:45,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-15 16:26:45,769 INFO L272 TraceCheckUtils]: 12: Hoare triple {1677#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {1677#true} is VALID [2022-04-15 16:26:45,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {1677#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1677#true} is VALID [2022-04-15 16:26:45,770 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1677#true} {1677#true} #71#return; {1677#true} is VALID [2022-04-15 16:26:45,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 16:26:45,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-15 16:26:45,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-15 16:26:45,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {1677#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {1677#true} is VALID [2022-04-15 16:26:45,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {1677#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1677#true} is VALID [2022-04-15 16:26:45,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {1677#true} call #t~ret6 := main(); {1677#true} is VALID [2022-04-15 16:26:45,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1677#true} {1677#true} #83#return; {1677#true} is VALID [2022-04-15 16:26:45,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 16:26:45,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {1677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1677#true} is VALID [2022-04-15 16:26:45,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {1677#true} call ULTIMATE.init(); {1677#true} is VALID [2022-04-15 16:26:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 16:26:45,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:26:45,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24637168] [2022-04-15 16:26:45,771 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:26:45,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323770536] [2022-04-15 16:26:45,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323770536] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 16:26:45,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 16:26:45,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2022-04-15 16:26:45,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:26:45,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1716755960] [2022-04-15 16:26:45,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1716755960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:26:45,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:26:45,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 16:26:45,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752235772] [2022-04-15 16:26:45,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:26:45,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-15 16:26:45,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:26:45,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:26:45,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:26:45,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 16:26:45,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:26:45,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 16:26:45,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-15 16:26:45,807 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:26:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:26:46,327 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-15 16:26:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 16:26:46,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-15 16:26:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:26:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:26:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 16:26:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:26:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 16:26:46,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-15 16:26:46,427 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-15 16:26:46,428 INFO L225 Difference]: With dead ends: 54 [2022-04-15 16:26:46,428 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 16:26:46,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-15 16:26:46,429 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 16:26:46,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 83 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 16:26:46,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 16:26:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2022-04-15 16:26:46,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:26:46,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:26:46,488 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:26:46,488 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:26:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:26:46,490 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-15 16:26:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-15 16:26:46,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:26:46,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:26:46,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-15 16:26:46,491 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-15 16:26:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:26:46,493 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-15 16:26:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-15 16:26:46,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:26:46,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:26:46,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:26:46,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:26:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:26:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-04-15 16:26:46,496 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 37 [2022-04-15 16:26:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:26:46,496 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-04-15 16:26:46,496 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:26:46,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 52 transitions. [2022-04-15 16:26:47,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:26:47,921 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-04-15 16:26:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 16:26:47,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:26:47,921 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:26:47,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 16:26:48,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:26:48,122 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:26:48,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:26:48,122 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 1 times [2022-04-15 16:26:48,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:26:48,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1795674261] [2022-04-15 16:26:48,123 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:26:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 2 times [2022-04-15 16:26:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:26:48,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103520770] [2022-04-15 16:26:48,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:26:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:26:48,136 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:26:48,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [566735205] [2022-04-15 16:26:48,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:26:48,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:26:48,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:26:48,138 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 16:26:48,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 16:26:48,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:26:48,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:26:48,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 16:26:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:26:48,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:26:48,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {2214#true} call ULTIMATE.init(); {2214#true} is VALID [2022-04-15 16:26:48,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {2214#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2214#true} is VALID [2022-04-15 16:26:48,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 16:26:48,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2214#true} {2214#true} #83#return; {2214#true} is VALID [2022-04-15 16:26:48,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {2214#true} call #t~ret6 := main(); {2214#true} is VALID [2022-04-15 16:26:48,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {2214#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2214#true} is VALID [2022-04-15 16:26:48,419 INFO L272 TraceCheckUtils]: 6: Hoare triple {2214#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {2214#true} is VALID [2022-04-15 16:26:48,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {2214#true} ~cond := #in~cond; {2240#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:26:48,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {2240#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2244#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:48,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {2244#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2244#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:48,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2244#(not (= |assume_abort_if_not_#in~cond| 0))} {2214#true} #71#return; {2251#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:26:48,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {2251#(and (<= 0 main_~x~0) (<= main_~x~0 50))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2251#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:26:48,421 INFO L272 TraceCheckUtils]: 12: Hoare triple {2251#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {2214#true} is VALID [2022-04-15 16:26:48,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-15 16:26:48,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-15 16:26:48,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 16:26:48,422 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2214#true} {2251#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #73#return; {2251#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:26:48,422 INFO L272 TraceCheckUtils]: 17: Hoare triple {2251#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2214#true} is VALID [2022-04-15 16:26:48,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {2214#true} ~cond := #in~cond; {2240#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:26:48,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {2240#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2244#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:48,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {2244#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2244#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:48,424 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2244#(not (= |assume_abort_if_not_#in~cond| 0))} {2251#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #75#return; {2285#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 16:26:48,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {2285#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2289#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 16:26:48,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {2289#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !false; {2289#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 16:26:48,425 INFO L272 TraceCheckUtils]: 24: Hoare triple {2289#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2214#true} is VALID [2022-04-15 16:26:48,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-15 16:26:48,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-15 16:26:48,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 16:26:48,426 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2214#true} {2289#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} #77#return; {2289#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 16:26:48,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {2289#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {2311#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 16:26:48,426 INFO L272 TraceCheckUtils]: 30: Hoare triple {2311#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2214#true} is VALID [2022-04-15 16:26:48,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-15 16:26:48,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-15 16:26:48,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 16:26:48,427 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2214#true} {2311#(and (= main_~a~0 0) (<= 1 main_~b~0))} #79#return; {2311#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 16:26:48,427 INFO L272 TraceCheckUtils]: 35: Hoare triple {2311#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:26:48,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {2330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:26:48,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {2334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2215#false} is VALID [2022-04-15 16:26:48,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {2215#false} assume !false; {2215#false} is VALID [2022-04-15 16:26:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 16:26:48,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:26:48,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {2215#false} assume !false; {2215#false} is VALID [2022-04-15 16:26:48,668 INFO L290 TraceCheckUtils]: 37: Hoare triple {2334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2215#false} is VALID [2022-04-15 16:26:48,668 INFO L290 TraceCheckUtils]: 36: Hoare triple {2330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:26:48,669 INFO L272 TraceCheckUtils]: 35: Hoare triple {2350#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:26:48,670 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2214#true} {2350#(= (* main_~b~0 main_~a~0) 0)} #79#return; {2350#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-15 16:26:48,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 16:26:48,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-15 16:26:48,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-15 16:26:48,670 INFO L272 TraceCheckUtils]: 30: Hoare triple {2350#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2214#true} is VALID [2022-04-15 16:26:48,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {2214#true} assume !(0 != ~a~0 && 0 != ~b~0); {2350#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-15 16:26:48,672 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2214#true} {2214#true} #77#return; {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L272 TraceCheckUtils]: 24: Hoare triple {2214#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {2214#true} assume !false; {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {2214#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2214#true} {2214#true} #75#return; {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L272 TraceCheckUtils]: 17: Hoare triple {2214#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2214#true} {2214#true} #73#return; {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 16:26:48,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-15 16:26:48,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-15 16:26:48,673 INFO L272 TraceCheckUtils]: 12: Hoare triple {2214#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {2214#true} is VALID [2022-04-15 16:26:48,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {2214#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2214#true} is VALID [2022-04-15 16:26:48,673 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2214#true} {2214#true} #71#return; {2214#true} is VALID [2022-04-15 16:26:48,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 16:26:48,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-15 16:26:48,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-15 16:26:48,673 INFO L272 TraceCheckUtils]: 6: Hoare triple {2214#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {2214#true} is VALID [2022-04-15 16:26:48,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {2214#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2214#true} is VALID [2022-04-15 16:26:48,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {2214#true} call #t~ret6 := main(); {2214#true} is VALID [2022-04-15 16:26:48,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2214#true} {2214#true} #83#return; {2214#true} is VALID [2022-04-15 16:26:48,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 16:26:48,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {2214#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2214#true} is VALID [2022-04-15 16:26:48,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {2214#true} call ULTIMATE.init(); {2214#true} is VALID [2022-04-15 16:26:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 16:26:48,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:26:48,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103520770] [2022-04-15 16:26:48,674 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:26:48,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566735205] [2022-04-15 16:26:48,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566735205] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 16:26:48,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 16:26:48,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-15 16:26:48,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:26:48,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1795674261] [2022-04-15 16:26:48,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1795674261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:26:48,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:26:48,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 16:26:48,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431610804] [2022-04-15 16:26:48,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:26:48,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-15 16:26:48,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:26:48,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:26:48,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:26:48,713 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 16:26:48,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:26:48,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 16:26:48,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-15 16:26:48,716 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:26:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:26:49,102 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-04-15 16:26:49,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 16:26:49,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-15 16:26:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:26:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:26:49,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 16:26:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:26:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 16:26:49,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-15 16:26:49,140 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-15 16:26:49,141 INFO L225 Difference]: With dead ends: 51 [2022-04-15 16:26:49,142 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 16:26:49,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-15 16:26:49,143 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 16:26:49,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 125 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 16:26:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 16:26:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 16:26:49,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:26:49,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:26:49,191 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:26:49,192 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:26:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:26:49,193 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 16:26:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-15 16:26:49,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:26:49,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:26:49,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-15 16:26:49,194 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-15 16:26:49,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:26:49,195 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 16:26:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-15 16:26:49,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:26:49,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:26:49,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:26:49,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:26:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:26:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-04-15 16:26:49,197 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 39 [2022-04-15 16:26:49,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:26:49,197 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-04-15 16:26:49,197 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:26:49,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 42 transitions. [2022-04-15 16:26:50,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:26:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-15 16:26:50,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 16:26:50,382 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:26:50,382 INFO L499 BasicCegarLoop]: trace histogram [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, 1] [2022-04-15 16:26:50,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 16:26:50,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:26:50,587 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:26:50,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:26:50,588 INFO L85 PathProgramCache]: Analyzing trace with hash -982526417, now seen corresponding path program 1 times [2022-04-15 16:26:50,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:26:50,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1472258021] [2022-04-15 16:26:50,588 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:26:50,588 INFO L85 PathProgramCache]: Analyzing trace with hash -982526417, now seen corresponding path program 2 times [2022-04-15 16:26:50,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:26:50,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917743300] [2022-04-15 16:26:50,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:26:50,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:26:50,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:26:50,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059814612] [2022-04-15 16:26:50,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:26:50,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:26:50,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:26:50,604 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 16:26:50,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 16:26:50,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:26:50,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:26:50,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 16:26:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:26:50,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:26:51,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {2710#true} call ULTIMATE.init(); {2710#true} is VALID [2022-04-15 16:26:51,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {2710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2710#true} is VALID [2022-04-15 16:26:51,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-15 16:26:51,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2710#true} {2710#true} #83#return; {2710#true} is VALID [2022-04-15 16:26:51,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {2710#true} call #t~ret6 := main(); {2710#true} is VALID [2022-04-15 16:26:51,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {2710#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2710#true} is VALID [2022-04-15 16:26:51,247 INFO L272 TraceCheckUtils]: 6: Hoare triple {2710#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {2710#true} is VALID [2022-04-15 16:26:51,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {2710#true} ~cond := #in~cond; {2736#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:26:51,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {2736#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2740#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:51,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {2740#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2740#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:51,249 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2740#(not (= |assume_abort_if_not_#in~cond| 0))} {2710#true} #71#return; {2747#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:26:51,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {2747#(and (<= 0 main_~x~0) (<= main_~x~0 50))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2747#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:26:51,250 INFO L272 TraceCheckUtils]: 12: Hoare triple {2747#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {2710#true} is VALID [2022-04-15 16:26:51,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-15 16:26:51,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-15 16:26:51,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-15 16:26:51,250 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2710#true} {2747#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #73#return; {2747#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:26:51,251 INFO L272 TraceCheckUtils]: 17: Hoare triple {2747#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2710#true} is VALID [2022-04-15 16:26:51,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {2710#true} ~cond := #in~cond; {2736#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:26:51,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {2736#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2740#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:51,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {2740#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2740#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:51,252 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2740#(not (= |assume_abort_if_not_#in~cond| 0))} {2747#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #75#return; {2781#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 16:26:51,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {2781#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2785#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 16:26:51,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {2785#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !false; {2785#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 16:26:51,254 INFO L272 TraceCheckUtils]: 24: Hoare triple {2785#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2710#true} is VALID [2022-04-15 16:26:51,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-15 16:26:51,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-15 16:26:51,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-15 16:26:51,255 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2710#true} {2785#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} #77#return; {2785#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 16:26:51,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {2785#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {2807#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:26:51,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {2807#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {2807#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:26:51,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {2807#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !false; {2807#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:26:51,257 INFO L272 TraceCheckUtils]: 32: Hoare triple {2807#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2710#true} is VALID [2022-04-15 16:26:51,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-15 16:26:51,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-15 16:26:51,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-15 16:26:51,258 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2710#true} {2807#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} #77#return; {2807#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:26:51,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {2807#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {2711#false} is VALID [2022-04-15 16:26:51,259 INFO L272 TraceCheckUtils]: 38: Hoare triple {2711#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2711#false} is VALID [2022-04-15 16:26:51,259 INFO L290 TraceCheckUtils]: 39: Hoare triple {2711#false} ~cond := #in~cond; {2711#false} is VALID [2022-04-15 16:26:51,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {2711#false} assume 0 == ~cond; {2711#false} is VALID [2022-04-15 16:26:51,259 INFO L290 TraceCheckUtils]: 41: Hoare triple {2711#false} assume !false; {2711#false} is VALID [2022-04-15 16:26:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 16:26:51,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:26:52,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {2711#false} assume !false; {2711#false} is VALID [2022-04-15 16:26:52,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {2711#false} assume 0 == ~cond; {2711#false} is VALID [2022-04-15 16:26:52,357 INFO L290 TraceCheckUtils]: 39: Hoare triple {2711#false} ~cond := #in~cond; {2711#false} is VALID [2022-04-15 16:26:52,357 INFO L272 TraceCheckUtils]: 38: Hoare triple {2711#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2711#false} is VALID [2022-04-15 16:26:52,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {2856#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {2711#false} is VALID [2022-04-15 16:26:52,358 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2710#true} {2856#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} #77#return; {2856#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-15 16:26:52,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-15 16:26:52,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-15 16:26:52,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-15 16:26:52,358 INFO L272 TraceCheckUtils]: 32: Hoare triple {2856#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2710#true} is VALID [2022-04-15 16:26:52,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {2856#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !false; {2856#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-15 16:26:52,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {2878#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {2856#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-15 16:26:52,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {2882#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {2878#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} is VALID [2022-04-15 16:26:52,361 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2710#true} {2882#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} #77#return; {2882#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-15 16:26:52,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-15 16:26:52,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-15 16:26:52,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-15 16:26:52,361 INFO L272 TraceCheckUtils]: 24: Hoare triple {2882#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2710#true} is VALID [2022-04-15 16:26:52,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {2882#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} assume !false; {2882#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-15 16:26:52,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {2904#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2882#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-15 16:26:52,363 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2710#true} {2904#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} #75#return; {2904#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-15 16:26:52,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-15 16:26:52,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-15 16:26:52,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-15 16:26:52,363 INFO L272 TraceCheckUtils]: 17: Hoare triple {2904#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2710#true} is VALID [2022-04-15 16:26:52,363 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2710#true} {2904#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} #73#return; {2904#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-15 16:26:52,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-15 16:26:52,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-15 16:26:52,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-15 16:26:52,364 INFO L272 TraceCheckUtils]: 12: Hoare triple {2904#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {2710#true} is VALID [2022-04-15 16:26:52,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {2904#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2904#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-15 16:26:52,365 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2740#(not (= |assume_abort_if_not_#in~cond| 0))} {2710#true} #71#return; {2904#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-15 16:26:52,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {2740#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2740#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:52,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2740#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:26:52,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {2710#true} ~cond := #in~cond; {2950#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 16:26:52,366 INFO L272 TraceCheckUtils]: 6: Hoare triple {2710#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {2710#true} is VALID [2022-04-15 16:26:52,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {2710#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2710#true} is VALID [2022-04-15 16:26:52,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {2710#true} call #t~ret6 := main(); {2710#true} is VALID [2022-04-15 16:26:52,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2710#true} {2710#true} #83#return; {2710#true} is VALID [2022-04-15 16:26:52,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-15 16:26:52,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {2710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2710#true} is VALID [2022-04-15 16:26:52,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {2710#true} call ULTIMATE.init(); {2710#true} is VALID [2022-04-15 16:26:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 16:26:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:26:52,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917743300] [2022-04-15 16:26:52,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:26:52,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059814612] [2022-04-15 16:26:52,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059814612] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:26:52,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:26:52,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-04-15 16:26:52,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:26:52,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1472258021] [2022-04-15 16:26:52,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1472258021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:26:52,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:26:52,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 16:26:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680417102] [2022-04-15 16:26:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:26:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2022-04-15 16:26:52,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:26:52,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:26:52,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:26:52,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 16:26:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:26:52,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 16:26:52,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-15 16:26:52,400 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:26:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:26:52,776 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-15 16:26:52,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 16:26:52,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2022-04-15 16:26:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:26:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:26:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-15 16:26:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:26:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-15 16:26:52,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-15 16:26:52,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:26:52,831 INFO L225 Difference]: With dead ends: 52 [2022-04-15 16:26:52,831 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 16:26:52,831 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-15 16:26:52,832 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 36 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 16:26:52,832 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 109 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 16:26:52,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 16:26:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2022-04-15 16:26:52,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:26:52,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:26:52,897 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:26:52,897 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:26:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:26:52,899 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-15 16:26:52,899 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-15 16:26:52,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:26:52,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:26:52,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-15 16:26:52,900 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-15 16:26:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:26:52,902 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-15 16:26:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-15 16:26:52,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:26:52,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:26:52,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:26:52,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:26:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:26:52,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2022-04-15 16:26:52,904 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 42 [2022-04-15 16:26:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:26:52,904 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2022-04-15 16:26:52,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:26:52,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 54 transitions. [2022-04-15 16:26:53,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:26:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-04-15 16:26:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 16:26:53,569 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:26:53,569 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1] [2022-04-15 16:26:53,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 16:26:53,769 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:26:53,769 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:26:53,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:26:53,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1669465851, now seen corresponding path program 1 times [2022-04-15 16:26:53,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:26:53,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1008165276] [2022-04-15 16:26:53,770 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:26:53,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1669465851, now seen corresponding path program 2 times [2022-04-15 16:26:53,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:26:53,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827731191] [2022-04-15 16:26:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:26:53,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:26:53,791 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:26:53,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370075222] [2022-04-15 16:26:53,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:26:53,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:26:53,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:26:53,797 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 16:26:53,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 16:26:53,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:26:53,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:26:53,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 16:26:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:26:53,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:27:04,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {3266#true} call ULTIMATE.init(); {3266#true} is VALID [2022-04-15 16:27:04,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {3266#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3266#true} is VALID [2022-04-15 16:27:04,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-15 16:27:04,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3266#true} {3266#true} #83#return; {3266#true} is VALID [2022-04-15 16:27:04,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {3266#true} call #t~ret6 := main(); {3266#true} is VALID [2022-04-15 16:27:04,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {3266#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3266#true} is VALID [2022-04-15 16:27:04,141 INFO L272 TraceCheckUtils]: 6: Hoare triple {3266#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {3266#true} is VALID [2022-04-15 16:27:04,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-15 16:27:04,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-15 16:27:04,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-15 16:27:04,142 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3266#true} {3266#true} #71#return; {3266#true} is VALID [2022-04-15 16:27:04,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {3266#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3266#true} is VALID [2022-04-15 16:27:04,142 INFO L272 TraceCheckUtils]: 12: Hoare triple {3266#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {3266#true} is VALID [2022-04-15 16:27:04,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-15 16:27:04,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-15 16:27:04,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-15 16:27:04,142 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3266#true} {3266#true} #73#return; {3266#true} is VALID [2022-04-15 16:27:04,142 INFO L272 TraceCheckUtils]: 17: Hoare triple {3266#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3266#true} is VALID [2022-04-15 16:27:04,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-15 16:27:04,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-15 16:27:04,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-15 16:27:04,143 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3266#true} {3266#true} #75#return; {3266#true} is VALID [2022-04-15 16:27:04,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {3266#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3266#true} is VALID [2022-04-15 16:27:04,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {3266#true} assume !false; {3266#true} is VALID [2022-04-15 16:27:04,143 INFO L272 TraceCheckUtils]: 24: Hoare triple {3266#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3266#true} is VALID [2022-04-15 16:27:04,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-15 16:27:04,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-15 16:27:04,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-15 16:27:04,144 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3266#true} {3266#true} #77#return; {3266#true} is VALID [2022-04-15 16:27:04,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {3266#true} assume !!(0 != ~a~0 && 0 != ~b~0); {3358#(not (= main_~b~0 0))} is VALID [2022-04-15 16:27:04,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {3358#(not (= main_~b~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3358#(not (= main_~b~0 0))} is VALID [2022-04-15 16:27:04,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {3358#(not (= main_~b~0 0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {3358#(not (= main_~b~0 0))} is VALID [2022-04-15 16:27:04,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {3358#(not (= main_~b~0 0))} assume !false; {3358#(not (= main_~b~0 0))} is VALID [2022-04-15 16:27:04,146 INFO L272 TraceCheckUtils]: 33: Hoare triple {3358#(not (= main_~b~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3266#true} is VALID [2022-04-15 16:27:04,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {3266#true} ~cond := #in~cond; {3374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:27:04,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {3374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:27:04,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {3378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:27:06,150 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {3378#(not (= |__VERIFIER_assert_#in~cond| 0))} {3358#(not (= main_~b~0 0))} #77#return; {3385#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~b~0 0)))} is UNKNOWN [2022-04-15 16:27:06,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {3385#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~b~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {3389#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:27:06,151 INFO L272 TraceCheckUtils]: 39: Hoare triple {3389#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {3393#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:27:06,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {3393#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3397#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:27:06,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {3397#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3267#false} is VALID [2022-04-15 16:27:06,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {3267#false} assume !false; {3267#false} is VALID [2022-04-15 16:27:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 16:27:06,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:27:39,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {3267#false} assume !false; {3267#false} is VALID [2022-04-15 16:27:39,647 INFO L290 TraceCheckUtils]: 41: Hoare triple {3397#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3267#false} is VALID [2022-04-15 16:27:39,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {3393#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3397#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:27:39,648 INFO L272 TraceCheckUtils]: 39: Hoare triple {3389#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {3393#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:27:39,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {3416#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {3389#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:27:39,650 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3378#(not (= |__VERIFIER_assert_#in~cond| 0))} {3266#true} #77#return; {3416#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 16:27:39,651 INFO L290 TraceCheckUtils]: 36: Hoare triple {3378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:27:39,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {3429#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:27:39,651 INFO L290 TraceCheckUtils]: 34: Hoare triple {3266#true} ~cond := #in~cond; {3429#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:27:39,651 INFO L272 TraceCheckUtils]: 33: Hoare triple {3266#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3266#true} is VALID [2022-04-15 16:27:39,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {3266#true} assume !false; {3266#true} is VALID [2022-04-15 16:27:39,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {3266#true} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {3266#true} is VALID [2022-04-15 16:27:39,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {3266#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3266#true} is VALID [2022-04-15 16:27:39,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {3266#true} assume !!(0 != ~a~0 && 0 != ~b~0); {3266#true} is VALID [2022-04-15 16:27:39,652 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3266#true} {3266#true} #77#return; {3266#true} is VALID [2022-04-15 16:27:39,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-15 16:27:39,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-15 16:27:39,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-15 16:27:39,652 INFO L272 TraceCheckUtils]: 24: Hoare triple {3266#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3266#true} is VALID [2022-04-15 16:27:39,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {3266#true} assume !false; {3266#true} is VALID [2022-04-15 16:27:39,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {3266#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3266#true} is VALID [2022-04-15 16:27:39,653 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3266#true} {3266#true} #75#return; {3266#true} is VALID [2022-04-15 16:27:39,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-15 16:27:39,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-15 16:27:39,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-15 16:27:39,653 INFO L272 TraceCheckUtils]: 17: Hoare triple {3266#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3266#true} is VALID [2022-04-15 16:27:39,653 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3266#true} {3266#true} #73#return; {3266#true} is VALID [2022-04-15 16:27:39,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-15 16:27:39,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-15 16:27:39,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-15 16:27:39,654 INFO L272 TraceCheckUtils]: 12: Hoare triple {3266#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {3266#true} is VALID [2022-04-15 16:27:39,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {3266#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3266#true} is VALID [2022-04-15 16:27:39,654 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3266#true} {3266#true} #71#return; {3266#true} is VALID [2022-04-15 16:27:39,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-15 16:27:39,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-15 16:27:39,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-15 16:27:39,654 INFO L272 TraceCheckUtils]: 6: Hoare triple {3266#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {3266#true} is VALID [2022-04-15 16:27:39,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {3266#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3266#true} is VALID [2022-04-15 16:27:39,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {3266#true} call #t~ret6 := main(); {3266#true} is VALID [2022-04-15 16:27:39,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3266#true} {3266#true} #83#return; {3266#true} is VALID [2022-04-15 16:27:39,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-15 16:27:39,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {3266#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3266#true} is VALID [2022-04-15 16:27:39,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {3266#true} call ULTIMATE.init(); {3266#true} is VALID [2022-04-15 16:27:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 16:27:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:27:39,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827731191] [2022-04-15 16:27:39,655 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:27:39,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370075222] [2022-04-15 16:27:39,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370075222] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:27:39,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:27:39,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-15 16:27:39,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:27:39,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1008165276] [2022-04-15 16:27:39,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1008165276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:27:39,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:27:39,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 16:27:39,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531724004] [2022-04-15 16:27:39,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:27:39,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-15 16:27:39,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:27:39,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:27:41,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:27:41,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 16:27:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:27:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 16:27:41,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 16:27:41,691 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:27:45,343 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-15 16:27:48,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:48,405 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-15 16:27:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 16:27:48,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-15 16:27:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:27:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:27:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-15 16:27:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:27:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-15 16:27:48,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2022-04-15 16:27:50,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:27:50,450 INFO L225 Difference]: With dead ends: 58 [2022-04-15 16:27:50,450 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 16:27:50,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-15 16:27:50,451 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 16:27:50,451 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 165 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 16:27:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 16:27:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-04-15 16:27:50,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:27:50,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:27:50,503 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:27:50,504 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:27:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:50,505 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-04-15 16:27:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-04-15 16:27:50,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:27:50,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:27:50,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 53 states. [2022-04-15 16:27:50,506 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 53 states. [2022-04-15 16:27:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:50,508 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-04-15 16:27:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-04-15 16:27:50,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:27:50,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:27:50,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:27:50,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:27:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:27:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-15 16:27:50,510 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 43 [2022-04-15 16:27:50,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:27:50,510 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-15 16:27:50,511 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:27:50,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-15 16:27:53,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:27:53,231 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-15 16:27:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 16:27:53,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:27:53,231 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2022-04-15 16:27:53,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 16:27:53,432 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:27:53,432 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:27:53,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:27:53,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1372706166, now seen corresponding path program 1 times [2022-04-15 16:27:53,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:27:53,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [835732114] [2022-04-15 16:27:53,433 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:27:53,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1372706166, now seen corresponding path program 2 times [2022-04-15 16:27:53,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:27:53,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516173591] [2022-04-15 16:27:53,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:27:53,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:27:53,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:27:53,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2052877089] [2022-04-15 16:27:53,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:27:53,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:27:53,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:27:53,447 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 16:27:53,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 16:27:53,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:27:53,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:27:53,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 16:27:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:27:53,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:28:03,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {3840#true} call ULTIMATE.init(); {3840#true} is VALID [2022-04-15 16:28:03,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {3840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3840#true} is VALID [2022-04-15 16:28:03,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-15 16:28:03,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3840#true} {3840#true} #83#return; {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {3840#true} call #t~ret6 := main(); {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {3840#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L272 TraceCheckUtils]: 6: Hoare triple {3840#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3840#true} {3840#true} #71#return; {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {3840#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L272 TraceCheckUtils]: 12: Hoare triple {3840#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {3840#true} #73#return; {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L272 TraceCheckUtils]: 17: Hoare triple {3840#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-15 16:28:03,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-15 16:28:03,849 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3840#true} {3840#true} #75#return; {3840#true} is VALID [2022-04-15 16:28:03,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {3840#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3840#true} is VALID [2022-04-15 16:28:03,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {3840#true} assume !false; {3840#true} is VALID [2022-04-15 16:28:03,849 INFO L272 TraceCheckUtils]: 24: Hoare triple {3840#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3840#true} is VALID [2022-04-15 16:28:03,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-15 16:28:03,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-15 16:28:03,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-15 16:28:03,849 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3840#true} {3840#true} #77#return; {3840#true} is VALID [2022-04-15 16:28:03,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {3840#true} assume !!(0 != ~a~0 && 0 != ~b~0); {3932#(not (= main_~a~0 0))} is VALID [2022-04-15 16:28:03,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {3932#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3932#(not (= main_~a~0 0))} is VALID [2022-04-15 16:28:03,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {3932#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3932#(not (= main_~a~0 0))} is VALID [2022-04-15 16:28:03,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {3932#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3932#(not (= main_~a~0 0))} is VALID [2022-04-15 16:28:03,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {3932#(not (= main_~a~0 0))} assume !false; {3932#(not (= main_~a~0 0))} is VALID [2022-04-15 16:28:03,850 INFO L272 TraceCheckUtils]: 34: Hoare triple {3932#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3840#true} is VALID [2022-04-15 16:28:03,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {3840#true} ~cond := #in~cond; {3951#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:28:03,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {3951#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3955#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:28:03,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {3955#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3955#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:28:05,853 WARN L284 TraceCheckUtils]: 38: Hoare quadruple {3955#(not (= |__VERIFIER_assert_#in~cond| 0))} {3932#(not (= main_~a~0 0))} #77#return; {3962#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} is UNKNOWN [2022-04-15 16:28:05,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {3962#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {3966#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:28:05,855 INFO L272 TraceCheckUtils]: 40: Hoare triple {3966#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {3970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:28:05,855 INFO L290 TraceCheckUtils]: 41: Hoare triple {3970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:28:05,855 INFO L290 TraceCheckUtils]: 42: Hoare triple {3974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3841#false} is VALID [2022-04-15 16:28:05,855 INFO L290 TraceCheckUtils]: 43: Hoare triple {3841#false} assume !false; {3841#false} is VALID [2022-04-15 16:28:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 16:28:05,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:28:46,493 INFO L290 TraceCheckUtils]: 43: Hoare triple {3841#false} assume !false; {3841#false} is VALID [2022-04-15 16:28:46,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {3974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3841#false} is VALID [2022-04-15 16:28:46,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {3970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:28:46,494 INFO L272 TraceCheckUtils]: 40: Hoare triple {3966#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {3970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:28:46,495 INFO L290 TraceCheckUtils]: 39: Hoare triple {3993#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {3966#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:28:46,496 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3955#(not (= |__VERIFIER_assert_#in~cond| 0))} {3840#true} #77#return; {3993#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 16:28:46,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {3955#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3955#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:28:46,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {4006#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3955#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:28:46,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {3840#true} ~cond := #in~cond; {4006#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:28:46,497 INFO L272 TraceCheckUtils]: 34: Hoare triple {3840#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {3840#true} assume !false; {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {3840#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {3840#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {3840#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {3840#true} assume !!(0 != ~a~0 && 0 != ~b~0); {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3840#true} {3840#true} #77#return; {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L272 TraceCheckUtils]: 24: Hoare triple {3840#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {3840#true} assume !false; {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {3840#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3840#true} {3840#true} #75#return; {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-15 16:28:46,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L272 TraceCheckUtils]: 17: Hoare triple {3840#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {3840#true} #73#return; {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L272 TraceCheckUtils]: 12: Hoare triple {3840#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {3840#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3840#true} {3840#true} #71#return; {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L272 TraceCheckUtils]: 6: Hoare triple {3840#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {3840#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {3840#true} call #t~ret6 := main(); {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3840#true} {3840#true} #83#return; {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-15 16:28:46,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {3840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3840#true} is VALID [2022-04-15 16:28:46,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {3840#true} call ULTIMATE.init(); {3840#true} is VALID [2022-04-15 16:28:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 16:28:46,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:28:46,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516173591] [2022-04-15 16:28:46,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:28:46,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052877089] [2022-04-15 16:28:46,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052877089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:28:46,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:28:46,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-15 16:28:46,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:28:46,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [835732114] [2022-04-15 16:28:46,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [835732114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:28:46,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:28:46,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 16:28:46,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982720284] [2022-04-15 16:28:46,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:28:46,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-15 16:28:46,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:28:46,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:28:48,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:28:48,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 16:28:48,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:28:48,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 16:28:48,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 16:28:48,530 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:28:51,415 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-15 16:28:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:28:52,879 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-15 16:28:52,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 16:28:52,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-15 16:28:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:28:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:28:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-15 16:28:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:28:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-15 16:28:52,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2022-04-15 16:28:54,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:28:54,928 INFO L225 Difference]: With dead ends: 53 [2022-04-15 16:28:54,928 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 16:28:54,928 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-15 16:28:54,928 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 16:28:54,929 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 136 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 16:28:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 16:28:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2022-04-15 16:28:54,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:28:54,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:28:54,975 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:28:54,975 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:28:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:28:54,977 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-15 16:28:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-15 16:28:54,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:28:54,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:28:54,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-15 16:28:54,978 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-15 16:28:54,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:28:54,979 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-15 16:28:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-15 16:28:54,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:28:54,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:28:54,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:28:54,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:28:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:28:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-15 16:28:54,981 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 44 [2022-04-15 16:28:54,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:28:54,981 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-15 16:28:54,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:28:54,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-15 16:28:57,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:28:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-15 16:28:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 16:28:57,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:28:57,515 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2022-04-15 16:28:57,531 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-15 16:28:57,719 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 16:28:57,719 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:28:57,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:28:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1114540728, now seen corresponding path program 1 times [2022-04-15 16:28:57,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:28:57,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1969507397] [2022-04-15 16:28:57,720 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:28:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1114540728, now seen corresponding path program 2 times [2022-04-15 16:28:57,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:28:57,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335642001] [2022-04-15 16:28:57,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:28:57,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:28:57,733 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:28:57,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796446374] [2022-04-15 16:28:57,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:28:57,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:28:57,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:28:57,734 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-15 16:28:57,737 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-15 16:28:57,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:28:57,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:28:57,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 16:28:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:28:57,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:29:08,352 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 16:29:08,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {4400#true} call ULTIMATE.init(); {4400#true} is VALID [2022-04-15 16:29:08,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {4400#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4400#true} is VALID [2022-04-15 16:29:08,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-15 16:29:08,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4400#true} {4400#true} #83#return; {4400#true} is VALID [2022-04-15 16:29:08,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {4400#true} call #t~ret6 := main(); {4400#true} is VALID [2022-04-15 16:29:08,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {4400#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4400#true} is VALID [2022-04-15 16:29:08,938 INFO L272 TraceCheckUtils]: 6: Hoare triple {4400#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {4400#true} is VALID [2022-04-15 16:29:08,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {4400#true} ~cond := #in~cond; {4426#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:29:08,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {4426#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4430#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:29:08,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {4430#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4430#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:29:08,939 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4430#(not (= |assume_abort_if_not_#in~cond| 0))} {4400#true} #71#return; {4437#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:29:08,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {4437#(and (<= 0 main_~x~0) (<= main_~x~0 50))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4437#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:29:08,940 INFO L272 TraceCheckUtils]: 12: Hoare triple {4437#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {4400#true} is VALID [2022-04-15 16:29:08,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {4400#true} ~cond := #in~cond; {4400#true} is VALID [2022-04-15 16:29:08,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {4400#true} assume !(0 == ~cond); {4400#true} is VALID [2022-04-15 16:29:08,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-15 16:29:08,941 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4400#true} {4437#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #73#return; {4437#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:29:08,941 INFO L272 TraceCheckUtils]: 17: Hoare triple {4437#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4400#true} is VALID [2022-04-15 16:29:08,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {4400#true} ~cond := #in~cond; {4426#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:29:08,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {4426#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4430#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:29:08,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {4430#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4430#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:29:08,943 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4430#(not (= |assume_abort_if_not_#in~cond| 0))} {4437#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #75#return; {4471#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 16:29:08,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {4471#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4475#(and (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:29:08,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {4475#(and (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !false; {4475#(and (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:29:08,944 INFO L272 TraceCheckUtils]: 24: Hoare triple {4475#(and (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4400#true} is VALID [2022-04-15 16:29:08,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {4400#true} ~cond := #in~cond; {4485#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:29:08,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {4485#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4489#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:29:08,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {4489#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4489#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:29:08,945 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4489#(not (= |__VERIFIER_assert_#in~cond| 0))} {4475#(and (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} #77#return; {4475#(and (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:29:08,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {4475#(and (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {4499#(and (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-15 16:29:08,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {4499#(and (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4499#(and (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-15 16:29:08,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {4499#(and (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4499#(and (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-15 16:29:08,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {4499#(and (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {4509#(and (< 0 (+ main_~a~0 1)) (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} is VALID [2022-04-15 16:29:08,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {4509#(and (< 0 (+ main_~a~0 1)) (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} assume !false; {4509#(and (< 0 (+ main_~a~0 1)) (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} is VALID [2022-04-15 16:29:08,948 INFO L272 TraceCheckUtils]: 34: Hoare triple {4509#(and (< 0 (+ main_~a~0 1)) (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4400#true} is VALID [2022-04-15 16:29:08,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {4400#true} ~cond := #in~cond; {4485#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:29:08,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {4485#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4489#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:29:08,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {4489#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4489#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:29:10,952 WARN L284 TraceCheckUtils]: 38: Hoare quadruple {4489#(not (= |__VERIFIER_assert_#in~cond| 0))} {4509#(and (< 0 (+ main_~a~0 1)) (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} #77#return; {4528#(and (< 0 (+ main_~a~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (or (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (and (= main_~b~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~b~0 0)) (not (= main_~a~0 0)))) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} is UNKNOWN [2022-04-15 16:29:10,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {4528#(and (< 0 (+ main_~a~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (or (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (and (= main_~b~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~b~0 0)) (not (= main_~a~0 0)))) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} assume !(0 != ~a~0 && 0 != ~b~0); {4532#(and (or (and (<= main_~x~0 1) (= main_~q~0 (* main_~y~0 main_~x~0))) (and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 1))) (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 16:29:10,954 INFO L272 TraceCheckUtils]: 40: Hoare triple {4532#(and (or (and (<= main_~x~0 1) (= main_~q~0 (* main_~y~0 main_~x~0))) (and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 1))) (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4536#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:29:10,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {4536#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4540#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:29:10,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {4540#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4401#false} is VALID [2022-04-15 16:29:10,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {4401#false} assume !false; {4401#false} is VALID [2022-04-15 16:29:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 16:29:10,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:29:43,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {4401#false} assume !false; {4401#false} is VALID [2022-04-15 16:29:43,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {4540#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4401#false} is VALID [2022-04-15 16:29:43,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {4536#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4540#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:29:43,368 INFO L272 TraceCheckUtils]: 40: Hoare triple {4556#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4536#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:29:43,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {4560#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {4556#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:29:43,370 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4489#(not (= |__VERIFIER_assert_#in~cond| 0))} {4400#true} #77#return; {4560#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 16:29:43,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {4489#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4489#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:29:43,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {4573#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4489#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:29:43,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {4400#true} ~cond := #in~cond; {4573#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:29:43,371 INFO L272 TraceCheckUtils]: 34: Hoare triple {4400#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4400#true} is VALID [2022-04-15 16:29:43,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {4400#true} assume !false; {4400#true} is VALID [2022-04-15 16:29:43,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {4400#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {4400#true} is VALID [2022-04-15 16:29:43,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {4400#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4400#true} is VALID [2022-04-15 16:29:43,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {4400#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4400#true} is VALID [2022-04-15 16:29:43,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {4400#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4400#true} is VALID [2022-04-15 16:29:43,371 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4400#true} {4400#true} #77#return; {4400#true} is VALID [2022-04-15 16:29:43,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-15 16:29:43,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {4400#true} assume !(0 == ~cond); {4400#true} is VALID [2022-04-15 16:29:43,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {4400#true} ~cond := #in~cond; {4400#true} is VALID [2022-04-15 16:29:43,371 INFO L272 TraceCheckUtils]: 24: Hoare triple {4400#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {4400#true} assume !false; {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {4400#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4400#true} {4400#true} #75#return; {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {4400#true} assume !(0 == ~cond); {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {4400#true} ~cond := #in~cond; {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L272 TraceCheckUtils]: 17: Hoare triple {4400#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4400#true} {4400#true} #73#return; {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {4400#true} assume !(0 == ~cond); {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {4400#true} ~cond := #in~cond; {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L272 TraceCheckUtils]: 12: Hoare triple {4400#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {4400#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4400#true} {4400#true} #71#return; {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {4400#true} assume !(0 == ~cond); {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {4400#true} ~cond := #in~cond; {4400#true} is VALID [2022-04-15 16:29:43,372 INFO L272 TraceCheckUtils]: 6: Hoare triple {4400#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {4400#true} is VALID [2022-04-15 16:29:43,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {4400#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4400#true} is VALID [2022-04-15 16:29:43,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {4400#true} call #t~ret6 := main(); {4400#true} is VALID [2022-04-15 16:29:43,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4400#true} {4400#true} #83#return; {4400#true} is VALID [2022-04-15 16:29:43,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-15 16:29:43,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {4400#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4400#true} is VALID [2022-04-15 16:29:43,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {4400#true} call ULTIMATE.init(); {4400#true} is VALID [2022-04-15 16:29:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 16:29:43,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:29:43,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335642001] [2022-04-15 16:29:43,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:29:43,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796446374] [2022-04-15 16:29:43,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796446374] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:29:43,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:29:43,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 18 [2022-04-15 16:29:43,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:29:43,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1969507397] [2022-04-15 16:29:43,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1969507397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:29:43,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:29:43,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 16:29:43,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281823275] [2022-04-15 16:29:43,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:29:43,374 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-04-15 16:29:43,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:29:43,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:29:45,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:29:45,407 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 16:29:45,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:29:45,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 16:29:45,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-04-15 16:29:45,408 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:29:48,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-15 16:29:52,966 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-15 16:29:55,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 16:29:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:29:55,235 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2022-04-15 16:29:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 16:29:55,236 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-04-15 16:29:55,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:29:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:29:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 59 transitions. [2022-04-15 16:29:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:29:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 59 transitions. [2022-04-15 16:29:55,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 59 transitions. [2022-04-15 16:29:57,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:29:57,297 INFO L225 Difference]: With dead ends: 57 [2022-04-15 16:29:57,297 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 16:29:57,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2022-04-15 16:29:57,298 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 46 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-15 16:29:57,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 117 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 7.5s Time] [2022-04-15 16:29:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 16:29:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-04-15 16:29:57,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:29:57,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:29:57,380 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:29:57,380 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:29:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:29:57,381 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 16:29:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 16:29:57,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:29:57,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:29:57,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-15 16:29:57,382 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-15 16:29:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:29:57,383 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 16:29:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 16:29:57,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:29:57,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:29:57,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:29:57,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:29:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:29:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-04-15 16:29:57,385 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 44 [2022-04-15 16:29:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:29:57,385 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-04-15 16:29:57,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:29:57,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 52 transitions. [2022-04-15 16:29:59,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 51 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:29:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-15 16:29:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 16:29:59,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:29:59,999 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:30:00,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 16:30:00,199 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-15 16:30:00,199 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:30:00,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:30:00,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2079436449, now seen corresponding path program 1 times [2022-04-15 16:30:00,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:30:00,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1561473723] [2022-04-15 16:30:00,200 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:30:00,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2079436449, now seen corresponding path program 2 times [2022-04-15 16:30:00,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:30:00,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753947080] [2022-04-15 16:30:00,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:30:00,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:30:00,217 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:30:00,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254627585] [2022-04-15 16:30:00,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:30:00,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:30:00,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:30:00,218 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-15 16:30:00,221 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-15 16:30:00,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:30:00,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:30:00,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 16:30:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:30:00,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:30:12,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {4999#true} call ULTIMATE.init(); {4999#true} is VALID [2022-04-15 16:30:12,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {4999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4999#true} is VALID [2022-04-15 16:30:12,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-15 16:30:12,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4999#true} {4999#true} #83#return; {4999#true} is VALID [2022-04-15 16:30:12,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {4999#true} call #t~ret6 := main(); {4999#true} is VALID [2022-04-15 16:30:12,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {4999#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4999#true} is VALID [2022-04-15 16:30:12,206 INFO L272 TraceCheckUtils]: 6: Hoare triple {4999#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {4999#true} is VALID [2022-04-15 16:30:12,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {4999#true} ~cond := #in~cond; {5025#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:30:12,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {5025#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5029#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:30:12,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {5029#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5029#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:30:12,207 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5029#(not (= |assume_abort_if_not_#in~cond| 0))} {4999#true} #71#return; {5036#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:30:12,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {5036#(and (<= 0 main_~x~0) (<= main_~x~0 50))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5036#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:30:12,208 INFO L272 TraceCheckUtils]: 12: Hoare triple {5036#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {4999#true} is VALID [2022-04-15 16:30:12,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-15 16:30:12,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-15 16:30:12,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-15 16:30:12,208 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4999#true} {5036#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #73#return; {5036#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:30:12,208 INFO L272 TraceCheckUtils]: 17: Hoare triple {5036#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4999#true} is VALID [2022-04-15 16:30:12,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {4999#true} ~cond := #in~cond; {5025#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:30:12,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {5025#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5029#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:30:12,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {5029#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5029#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:30:12,210 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5029#(not (= |assume_abort_if_not_#in~cond| 0))} {5036#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #75#return; {5070#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} is VALID [2022-04-15 16:30:12,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {5070#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5074#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:30:12,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {5074#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !false; {5074#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:30:12,210 INFO L272 TraceCheckUtils]: 24: Hoare triple {5074#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4999#true} is VALID [2022-04-15 16:30:12,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-15 16:30:12,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-15 16:30:12,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-15 16:30:12,211 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4999#true} {5074#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} #77#return; {5074#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:30:12,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {5074#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {5096#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-15 16:30:12,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {5096#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {5100#(and (<= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 16:30:12,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {5100#(and (<= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !false; {5100#(and (<= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 16:30:12,213 INFO L272 TraceCheckUtils]: 32: Hoare triple {5100#(and (<= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4999#true} is VALID [2022-04-15 16:30:12,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-15 16:30:12,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-15 16:30:12,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-15 16:30:12,214 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4999#true} {5100#(and (<= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} #77#return; {5100#(and (<= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 16:30:12,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {5100#(and (<= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !!(0 != ~a~0 && 0 != ~b~0); {5100#(and (<= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 16:30:12,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {5100#(and (<= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5100#(and (<= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 16:30:12,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {5100#(and (<= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5100#(and (<= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 16:30:12,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {5100#(and (<= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {5131#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (<= (div main_~y~0 2) (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:30:12,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {5131#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (<= (div main_~y~0 2) (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} assume !false; {5131#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (<= (div main_~y~0 2) (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:30:12,217 INFO L272 TraceCheckUtils]: 42: Hoare triple {5131#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (<= (div main_~y~0 2) (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4999#true} is VALID [2022-04-15 16:30:12,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {4999#true} ~cond := #in~cond; {5141#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:30:12,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {5141#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5145#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:30:12,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {5145#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5145#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:30:14,220 WARN L284 TraceCheckUtils]: 46: Hoare quadruple {5145#(not (= |__VERIFIER_assert_#in~cond| 0))} {5131#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (<= (div main_~y~0 2) (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} #77#return; {5152#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (<= (div main_~y~0 2) (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} is UNKNOWN [2022-04-15 16:30:14,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {5152#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (<= (div main_~y~0 2) (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} assume !(0 != ~a~0 && 0 != ~b~0); {5156#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0) (or (and (<= (div main_~y~0 2) 1) (= main_~q~0 (* main_~y~0 main_~x~0))) (and (< (div (* (- 1) main_~x~0) (- 2)) 2) (= main_~q~0 (* main_~y~0 main_~x~0)))))} is VALID [2022-04-15 16:30:14,223 INFO L272 TraceCheckUtils]: 48: Hoare triple {5156#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0) (or (and (<= (div main_~y~0 2) 1) (= main_~q~0 (* main_~y~0 main_~x~0))) (and (< (div (* (- 1) main_~x~0) (- 2)) 2) (= main_~q~0 (* main_~y~0 main_~x~0)))))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5160#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:30:14,223 INFO L290 TraceCheckUtils]: 49: Hoare triple {5160#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5164#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:30:14,223 INFO L290 TraceCheckUtils]: 50: Hoare triple {5164#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5000#false} is VALID [2022-04-15 16:30:14,223 INFO L290 TraceCheckUtils]: 51: Hoare triple {5000#false} assume !false; {5000#false} is VALID [2022-04-15 16:30:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 16:30:14,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:30:51,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {5000#false} assume !false; {5000#false} is VALID [2022-04-15 16:30:51,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {5164#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5000#false} is VALID [2022-04-15 16:30:51,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {5160#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5164#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:30:51,524 INFO L272 TraceCheckUtils]: 48: Hoare triple {5180#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5160#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:30:51,525 INFO L290 TraceCheckUtils]: 47: Hoare triple {5184#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {5180#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:30:51,527 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5145#(not (= |__VERIFIER_assert_#in~cond| 0))} {4999#true} #77#return; {5184#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 16:30:51,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {5145#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5145#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:30:51,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {5197#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5145#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:30:51,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {4999#true} ~cond := #in~cond; {5197#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:30:51,528 INFO L272 TraceCheckUtils]: 42: Hoare triple {4999#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4999#true} is VALID [2022-04-15 16:30:51,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {4999#true} assume !false; {4999#true} is VALID [2022-04-15 16:30:51,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {4999#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {4999#true} is VALID [2022-04-15 16:30:51,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {4999#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4999#true} is VALID [2022-04-15 16:30:51,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {4999#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4999#true} is VALID [2022-04-15 16:30:51,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {4999#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4999#true} is VALID [2022-04-15 16:30:51,529 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4999#true} {4999#true} #77#return; {4999#true} is VALID [2022-04-15 16:30:51,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-15 16:30:51,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-15 16:30:51,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-15 16:30:51,529 INFO L272 TraceCheckUtils]: 32: Hoare triple {4999#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4999#true} is VALID [2022-04-15 16:30:51,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {4999#true} assume !false; {4999#true} is VALID [2022-04-15 16:30:51,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {4999#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {4999#true} is VALID [2022-04-15 16:30:51,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {4999#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4999#true} is VALID [2022-04-15 16:30:51,529 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4999#true} {4999#true} #77#return; {4999#true} is VALID [2022-04-15 16:30:51,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-15 16:30:51,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-15 16:30:51,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-15 16:30:51,530 INFO L272 TraceCheckUtils]: 24: Hoare triple {4999#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4999#true} is VALID [2022-04-15 16:30:51,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {4999#true} assume !false; {4999#true} is VALID [2022-04-15 16:30:51,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {4999#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4999#true} is VALID [2022-04-15 16:30:51,530 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4999#true} {4999#true} #75#return; {4999#true} is VALID [2022-04-15 16:30:51,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-15 16:30:51,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-15 16:30:51,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-15 16:30:51,530 INFO L272 TraceCheckUtils]: 17: Hoare triple {4999#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4999#true} is VALID [2022-04-15 16:30:51,530 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4999#true} {4999#true} #73#return; {4999#true} is VALID [2022-04-15 16:30:51,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-15 16:30:51,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-15 16:30:51,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-15 16:30:51,531 INFO L272 TraceCheckUtils]: 12: Hoare triple {4999#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {4999#true} is VALID [2022-04-15 16:30:51,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {4999#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4999#true} is VALID [2022-04-15 16:30:51,531 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4999#true} {4999#true} #71#return; {4999#true} is VALID [2022-04-15 16:30:51,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-15 16:30:51,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-15 16:30:51,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-15 16:30:51,531 INFO L272 TraceCheckUtils]: 6: Hoare triple {4999#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {4999#true} is VALID [2022-04-15 16:30:51,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {4999#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4999#true} is VALID [2022-04-15 16:30:51,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {4999#true} call #t~ret6 := main(); {4999#true} is VALID [2022-04-15 16:30:51,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4999#true} {4999#true} #83#return; {4999#true} is VALID [2022-04-15 16:30:51,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-15 16:30:51,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {4999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4999#true} is VALID [2022-04-15 16:30:51,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {4999#true} call ULTIMATE.init(); {4999#true} is VALID [2022-04-15 16:30:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 16:30:51,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:30:51,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753947080] [2022-04-15 16:30:51,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:30:51,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254627585] [2022-04-15 16:30:51,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254627585] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:30:51,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:30:51,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 19 [2022-04-15 16:30:51,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:30:51,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1561473723] [2022-04-15 16:30:51,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1561473723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:30:51,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:30:51,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 16:30:51,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584867044] [2022-04-15 16:30:51,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:30:51,534 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 52 [2022-04-15 16:30:51,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:30:51,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 16:30:53,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:30:53,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 16:30:53,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:30:53,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 16:30:53,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-04-15 16:30:53,603 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 16:30:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:30:57,251 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2022-04-15 16:30:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 16:30:57,251 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 52 [2022-04-15 16:30:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:30:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 16:30:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 69 transitions. [2022-04-15 16:30:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 16:30:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 69 transitions. [2022-04-15 16:30:57,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 69 transitions. [2022-04-15 16:31:01,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 67 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 16:31:01,331 INFO L225 Difference]: With dead ends: 63 [2022-04-15 16:31:01,331 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 16:31:01,331 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-04-15 16:31:01,332 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 16:31:01,332 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 120 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 16:31:01,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 16:31:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2022-04-15 16:31:01,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:31:01,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 47 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:31:01,466 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 47 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:31:01,466 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 47 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:31:01,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:31:01,467 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-15 16:31:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-15 16:31:01,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:31:01,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:31:01,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 58 states. [2022-04-15 16:31:01,468 INFO L87 Difference]: Start difference. First operand has 47 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 58 states. [2022-04-15 16:31:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:31:01,470 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-15 16:31:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-15 16:31:01,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:31:01,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:31:01,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:31:01,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:31:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:31:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-15 16:31:01,472 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 52 [2022-04-15 16:31:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:31:01,472 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-15 16:31:01,472 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 16:31:01,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-15 16:31:06,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 56 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 16:31:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-15 16:31:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 16:31:06,175 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:31:06,175 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:31:06,191 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-15 16:31:06,375 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-15 16:31:06,375 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:31:06,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:31:06,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1287237523, now seen corresponding path program 1 times [2022-04-15 16:31:06,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:31:06,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [65979146] [2022-04-15 16:31:06,376 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:31:06,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1287237523, now seen corresponding path program 2 times [2022-04-15 16:31:06,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:31:06,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198451733] [2022-04-15 16:31:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:31:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:31:06,407 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:31:06,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304084100] [2022-04-15 16:31:06,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:31:06,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:31:06,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:31:06,419 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-15 16:31:06,437 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-15 16:31:06,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:31:06,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:31:06,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 16:31:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:31:06,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:31:07,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {5675#true} call ULTIMATE.init(); {5675#true} is VALID [2022-04-15 16:31:07,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {5675#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5675#true} is VALID [2022-04-15 16:31:07,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-15 16:31:07,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5675#true} {5675#true} #83#return; {5675#true} is VALID [2022-04-15 16:31:07,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {5675#true} call #t~ret6 := main(); {5675#true} is VALID [2022-04-15 16:31:07,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {5675#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5675#true} is VALID [2022-04-15 16:31:07,402 INFO L272 TraceCheckUtils]: 6: Hoare triple {5675#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {5675#true} is VALID [2022-04-15 16:31:07,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-15 16:31:07,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-15 16:31:07,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-15 16:31:07,403 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5675#true} {5675#true} #71#return; {5675#true} is VALID [2022-04-15 16:31:07,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {5675#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5675#true} is VALID [2022-04-15 16:31:07,403 INFO L272 TraceCheckUtils]: 12: Hoare triple {5675#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {5675#true} is VALID [2022-04-15 16:31:07,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-15 16:31:07,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-15 16:31:07,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-15 16:31:07,403 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5675#true} {5675#true} #73#return; {5675#true} is VALID [2022-04-15 16:31:07,403 INFO L272 TraceCheckUtils]: 17: Hoare triple {5675#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5675#true} is VALID [2022-04-15 16:31:07,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {5675#true} ~cond := #in~cond; {5734#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:31:07,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {5734#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5738#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:31:07,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {5738#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5738#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:31:07,405 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5738#(not (= |assume_abort_if_not_#in~cond| 0))} {5675#true} #75#return; {5745#(<= 1 main_~y~0)} is VALID [2022-04-15 16:31:07,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {5745#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5749#(<= 1 main_~b~0)} is VALID [2022-04-15 16:31:07,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {5749#(<= 1 main_~b~0)} assume !false; {5749#(<= 1 main_~b~0)} is VALID [2022-04-15 16:31:07,406 INFO L272 TraceCheckUtils]: 24: Hoare triple {5749#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5675#true} is VALID [2022-04-15 16:31:07,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-15 16:31:07,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-15 16:31:07,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-15 16:31:07,407 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5675#true} {5749#(<= 1 main_~b~0)} #77#return; {5749#(<= 1 main_~b~0)} is VALID [2022-04-15 16:31:07,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {5749#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {5771#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:07,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {5771#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5771#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:07,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {5771#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {5778#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:07,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {5778#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} assume !false; {5778#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:07,410 INFO L272 TraceCheckUtils]: 33: Hoare triple {5778#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5675#true} is VALID [2022-04-15 16:31:07,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-15 16:31:07,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-15 16:31:07,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-15 16:31:07,418 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5675#true} {5778#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} #77#return; {5778#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:07,419 INFO L290 TraceCheckUtils]: 38: Hoare triple {5778#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {5778#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:07,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {5778#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5803#(and (<= (mod main_~b~0 2) 0) (not (= (mod main_~a~0 2) 0)) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:07,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {5803#(and (<= (mod main_~b~0 2) 0) (not (= (mod main_~a~0 2) 0)) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5676#false} is VALID [2022-04-15 16:31:07,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {5676#false} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {5676#false} is VALID [2022-04-15 16:31:07,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {5676#false} assume !false; {5676#false} is VALID [2022-04-15 16:31:07,421 INFO L272 TraceCheckUtils]: 43: Hoare triple {5676#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5676#false} is VALID [2022-04-15 16:31:07,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {5676#false} ~cond := #in~cond; {5676#false} is VALID [2022-04-15 16:31:07,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {5676#false} assume !(0 == ~cond); {5676#false} is VALID [2022-04-15 16:31:07,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {5676#false} assume true; {5676#false} is VALID [2022-04-15 16:31:07,421 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5676#false} {5676#false} #77#return; {5676#false} is VALID [2022-04-15 16:31:07,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {5676#false} assume !(0 != ~a~0 && 0 != ~b~0); {5676#false} is VALID [2022-04-15 16:31:07,422 INFO L272 TraceCheckUtils]: 49: Hoare triple {5676#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5676#false} is VALID [2022-04-15 16:31:07,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {5676#false} ~cond := #in~cond; {5676#false} is VALID [2022-04-15 16:31:07,422 INFO L290 TraceCheckUtils]: 51: Hoare triple {5676#false} assume 0 == ~cond; {5676#false} is VALID [2022-04-15 16:31:07,422 INFO L290 TraceCheckUtils]: 52: Hoare triple {5676#false} assume !false; {5676#false} is VALID [2022-04-15 16:31:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 16:31:07,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:31:08,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {5676#false} assume !false; {5676#false} is VALID [2022-04-15 16:31:08,396 INFO L290 TraceCheckUtils]: 51: Hoare triple {5676#false} assume 0 == ~cond; {5676#false} is VALID [2022-04-15 16:31:08,396 INFO L290 TraceCheckUtils]: 50: Hoare triple {5676#false} ~cond := #in~cond; {5676#false} is VALID [2022-04-15 16:31:08,396 INFO L272 TraceCheckUtils]: 49: Hoare triple {5676#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5676#false} is VALID [2022-04-15 16:31:08,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {5676#false} assume !(0 != ~a~0 && 0 != ~b~0); {5676#false} is VALID [2022-04-15 16:31:08,396 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5675#true} {5676#false} #77#return; {5676#false} is VALID [2022-04-15 16:31:08,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-15 16:31:08,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-15 16:31:08,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-15 16:31:08,396 INFO L272 TraceCheckUtils]: 43: Hoare triple {5676#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5675#true} is VALID [2022-04-15 16:31:08,397 INFO L290 TraceCheckUtils]: 42: Hoare triple {5676#false} assume !false; {5676#false} is VALID [2022-04-15 16:31:08,397 INFO L290 TraceCheckUtils]: 41: Hoare triple {5676#false} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {5676#false} is VALID [2022-04-15 16:31:08,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {5879#(and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5676#false} is VALID [2022-04-15 16:31:08,398 INFO L290 TraceCheckUtils]: 39: Hoare triple {5883#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5879#(and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0))} is VALID [2022-04-15 16:31:08,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {5883#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {5883#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-15 16:31:08,399 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5675#true} {5883#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} #77#return; {5883#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-15 16:31:08,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-15 16:31:08,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-15 16:31:08,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-15 16:31:08,400 INFO L272 TraceCheckUtils]: 33: Hoare triple {5883#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5675#true} is VALID [2022-04-15 16:31:08,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {5883#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !false; {5883#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-15 16:31:08,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {5908#(or (= (mod main_~b~0 2) 0) (< main_~a~0 0) (<= 0 main_~b~0) (not (<= 1 (mod main_~a~0 2))))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {5883#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-15 16:31:08,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {5908#(or (= (mod main_~b~0 2) 0) (< main_~a~0 0) (<= 0 main_~b~0) (not (<= 1 (mod main_~a~0 2))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5908#(or (= (mod main_~b~0 2) 0) (< main_~a~0 0) (<= 0 main_~b~0) (not (<= 1 (mod main_~a~0 2))))} is VALID [2022-04-15 16:31:08,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {5915#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {5908#(or (= (mod main_~b~0 2) 0) (< main_~a~0 0) (<= 0 main_~b~0) (not (<= 1 (mod main_~a~0 2))))} is VALID [2022-04-15 16:31:08,403 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5675#true} {5915#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} #77#return; {5915#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-15 16:31:08,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-15 16:31:08,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-15 16:31:08,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-15 16:31:08,403 INFO L272 TraceCheckUtils]: 24: Hoare triple {5915#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5675#true} is VALID [2022-04-15 16:31:08,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {5915#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} assume !false; {5915#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-15 16:31:08,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {5937#(<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5915#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-15 16:31:08,405 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5738#(not (= |assume_abort_if_not_#in~cond| 0))} {5675#true} #75#return; {5937#(<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1))} is VALID [2022-04-15 16:31:08,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {5738#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5738#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:31:08,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {5950#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {5738#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:31:08,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {5675#true} ~cond := #in~cond; {5950#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 16:31:08,406 INFO L272 TraceCheckUtils]: 17: Hoare triple {5675#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5675#true} is VALID [2022-04-15 16:31:08,406 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5675#true} {5675#true} #73#return; {5675#true} is VALID [2022-04-15 16:31:08,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-15 16:31:08,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-15 16:31:08,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-15 16:31:08,407 INFO L272 TraceCheckUtils]: 12: Hoare triple {5675#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {5675#true} is VALID [2022-04-15 16:31:08,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {5675#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5675#true} is VALID [2022-04-15 16:31:08,407 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5675#true} {5675#true} #71#return; {5675#true} is VALID [2022-04-15 16:31:08,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-15 16:31:08,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-15 16:31:08,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-15 16:31:08,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {5675#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {5675#true} is VALID [2022-04-15 16:31:08,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {5675#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5675#true} is VALID [2022-04-15 16:31:08,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {5675#true} call #t~ret6 := main(); {5675#true} is VALID [2022-04-15 16:31:08,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5675#true} {5675#true} #83#return; {5675#true} is VALID [2022-04-15 16:31:08,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-15 16:31:08,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {5675#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5675#true} is VALID [2022-04-15 16:31:08,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {5675#true} call ULTIMATE.init(); {5675#true} is VALID [2022-04-15 16:31:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 16:31:08,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:31:08,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198451733] [2022-04-15 16:31:08,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:31:08,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304084100] [2022-04-15 16:31:08,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304084100] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 16:31:08,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 16:31:08,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2022-04-15 16:31:08,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:31:08,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [65979146] [2022-04-15 16:31:08,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [65979146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:31:08,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:31:08,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 16:31:08,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597618855] [2022-04-15 16:31:08,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:31:08,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 53 [2022-04-15 16:31:08,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:31:08,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 16:31:08,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:31:08,447 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 16:31:08,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:31:08,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 16:31:08,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-15 16:31:08,448 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 16:31:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:31:09,083 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2022-04-15 16:31:09,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 16:31:09,083 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 53 [2022-04-15 16:31:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:31:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 16:31:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-15 16:31:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 16:31:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-15 16:31:09,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-15 16:31:09,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:31:09,145 INFO L225 Difference]: With dead ends: 72 [2022-04-15 16:31:09,146 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 16:31:09,146 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-04-15 16:31:09,146 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 16:31:09,146 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 94 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 16:31:09,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 16:31:09,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-04-15 16:31:09,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:31:09,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 52 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 16:31:09,315 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 52 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 16:31:09,315 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 52 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 16:31:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:31:09,316 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-04-15 16:31:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-15 16:31:09,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:31:09,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:31:09,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 54 states. [2022-04-15 16:31:09,317 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 54 states. [2022-04-15 16:31:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:31:09,318 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-04-15 16:31:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-15 16:31:09,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:31:09,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:31:09,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:31:09,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:31:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 16:31:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2022-04-15 16:31:09,320 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 53 [2022-04-15 16:31:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:31:09,320 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2022-04-15 16:31:09,320 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 16:31:09,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 65 transitions. [2022-04-15 16:31:16,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 62 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 16:31:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-04-15 16:31:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 16:31:16,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:31:16,586 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:31:16,602 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-15 16:31:16,791 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-15 16:31:16,791 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:31:16,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:31:16,792 INFO L85 PathProgramCache]: Analyzing trace with hash 338559610, now seen corresponding path program 3 times [2022-04-15 16:31:16,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:31:16,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [384318094] [2022-04-15 16:31:16,792 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:31:16,792 INFO L85 PathProgramCache]: Analyzing trace with hash 338559610, now seen corresponding path program 4 times [2022-04-15 16:31:16,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:31:16,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927301670] [2022-04-15 16:31:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:31:16,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:31:16,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:31:16,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525666151] [2022-04-15 16:31:16,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 16:31:16,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:31:16,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:31:16,809 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-15 16:31:16,813 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-15 16:31:16,849 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 16:31:16,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:31:16,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 16:31:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:31:16,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:31:17,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {6371#true} call ULTIMATE.init(); {6371#true} is VALID [2022-04-15 16:31:17,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {6371#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6371#true} {6371#true} #83#return; {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {6371#true} call #t~ret6 := main(); {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {6371#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {6371#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6371#true} {6371#true} #71#return; {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {6371#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L272 TraceCheckUtils]: 12: Hoare triple {6371#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6371#true} {6371#true} #73#return; {6371#true} is VALID [2022-04-15 16:31:17,638 INFO L272 TraceCheckUtils]: 17: Hoare triple {6371#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6371#true} is VALID [2022-04-15 16:31:17,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {6371#true} ~cond := #in~cond; {6430#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:31:17,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {6430#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6434#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:31:17,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {6434#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6434#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:31:17,640 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6434#(not (= |assume_abort_if_not_#in~cond| 0))} {6371#true} #75#return; {6441#(<= 1 main_~y~0)} is VALID [2022-04-15 16:31:17,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {6441#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6445#(<= 1 main_~b~0)} is VALID [2022-04-15 16:31:17,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {6445#(<= 1 main_~b~0)} assume !false; {6445#(<= 1 main_~b~0)} is VALID [2022-04-15 16:31:17,640 INFO L272 TraceCheckUtils]: 24: Hoare triple {6445#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6371#true} is VALID [2022-04-15 16:31:17,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-15 16:31:17,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-15 16:31:17,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-15 16:31:17,641 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6371#true} {6445#(<= 1 main_~b~0)} #77#return; {6445#(<= 1 main_~b~0)} is VALID [2022-04-15 16:31:17,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {6445#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {6445#(<= 1 main_~b~0)} is VALID [2022-04-15 16:31:17,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {6445#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6470#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:17,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {6470#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 1 main_~b~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6470#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:17,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {6470#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6477#(and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 16:31:17,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {6477#(and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !false; {6477#(and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 16:31:17,644 INFO L272 TraceCheckUtils]: 34: Hoare triple {6477#(and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6371#true} is VALID [2022-04-15 16:31:17,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-15 16:31:17,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-15 16:31:17,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-15 16:31:17,645 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6371#true} {6477#(and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} #77#return; {6477#(and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 16:31:17,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {6477#(and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {6477#(and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 16:31:17,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {6477#(and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6502#(and (not (= (mod main_~b~0 2) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 16:31:17,646 INFO L290 TraceCheckUtils]: 41: Hoare triple {6502#(and (not (= (mod main_~b~0 2) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6502#(and (not (= (mod main_~b~0 2) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 16:31:17,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {6502#(and (not (= (mod main_~b~0 2) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6372#false} is VALID [2022-04-15 16:31:17,647 INFO L290 TraceCheckUtils]: 43: Hoare triple {6372#false} assume !false; {6372#false} is VALID [2022-04-15 16:31:17,648 INFO L272 TraceCheckUtils]: 44: Hoare triple {6372#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6372#false} is VALID [2022-04-15 16:31:17,648 INFO L290 TraceCheckUtils]: 45: Hoare triple {6372#false} ~cond := #in~cond; {6372#false} is VALID [2022-04-15 16:31:17,648 INFO L290 TraceCheckUtils]: 46: Hoare triple {6372#false} assume !(0 == ~cond); {6372#false} is VALID [2022-04-15 16:31:17,648 INFO L290 TraceCheckUtils]: 47: Hoare triple {6372#false} assume true; {6372#false} is VALID [2022-04-15 16:31:17,648 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6372#false} {6372#false} #77#return; {6372#false} is VALID [2022-04-15 16:31:17,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {6372#false} assume !(0 != ~a~0 && 0 != ~b~0); {6372#false} is VALID [2022-04-15 16:31:17,648 INFO L272 TraceCheckUtils]: 50: Hoare triple {6372#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6372#false} is VALID [2022-04-15 16:31:17,648 INFO L290 TraceCheckUtils]: 51: Hoare triple {6372#false} ~cond := #in~cond; {6372#false} is VALID [2022-04-15 16:31:17,648 INFO L290 TraceCheckUtils]: 52: Hoare triple {6372#false} assume 0 == ~cond; {6372#false} is VALID [2022-04-15 16:31:17,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {6372#false} assume !false; {6372#false} is VALID [2022-04-15 16:31:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 16:31:17,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:31:18,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {6372#false} assume !false; {6372#false} is VALID [2022-04-15 16:31:18,249 INFO L290 TraceCheckUtils]: 52: Hoare triple {6372#false} assume 0 == ~cond; {6372#false} is VALID [2022-04-15 16:31:18,250 INFO L290 TraceCheckUtils]: 51: Hoare triple {6372#false} ~cond := #in~cond; {6372#false} is VALID [2022-04-15 16:31:18,250 INFO L272 TraceCheckUtils]: 50: Hoare triple {6372#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6372#false} is VALID [2022-04-15 16:31:18,250 INFO L290 TraceCheckUtils]: 49: Hoare triple {6372#false} assume !(0 != ~a~0 && 0 != ~b~0); {6372#false} is VALID [2022-04-15 16:31:18,250 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6371#true} {6372#false} #77#return; {6372#false} is VALID [2022-04-15 16:31:18,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-15 16:31:18,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-15 16:31:18,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-15 16:31:18,250 INFO L272 TraceCheckUtils]: 44: Hoare triple {6372#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6371#true} is VALID [2022-04-15 16:31:18,250 INFO L290 TraceCheckUtils]: 43: Hoare triple {6372#false} assume !false; {6372#false} is VALID [2022-04-15 16:31:18,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {6502#(and (not (= (mod main_~b~0 2) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6372#false} is VALID [2022-04-15 16:31:18,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {6502#(and (not (= (mod main_~b~0 2) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6502#(and (not (= (mod main_~b~0 2) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 16:31:18,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {6581#(or (and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6502#(and (not (= (mod main_~b~0 2) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 16:31:18,253 INFO L290 TraceCheckUtils]: 39: Hoare triple {6581#(or (and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {6581#(or (and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)))} is VALID [2022-04-15 16:31:18,253 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6371#true} {6581#(or (and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)))} #77#return; {6581#(or (and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)))} is VALID [2022-04-15 16:31:18,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-15 16:31:18,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-15 16:31:18,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-15 16:31:18,254 INFO L272 TraceCheckUtils]: 34: Hoare triple {6581#(or (and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6371#true} is VALID [2022-04-15 16:31:18,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {6581#(or (and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)))} assume !false; {6581#(or (and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)))} is VALID [2022-04-15 16:31:18,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {6470#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6581#(or (and (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)))} is VALID [2022-04-15 16:31:18,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {6470#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 1 main_~b~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6470#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:18,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {6445#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6470#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:18,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {6615#(or (= main_~b~0 0) (<= 1 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {6445#(<= 1 main_~b~0)} is VALID [2022-04-15 16:31:18,257 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6371#true} {6615#(or (= main_~b~0 0) (<= 1 main_~b~0))} #77#return; {6615#(or (= main_~b~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:18,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-15 16:31:18,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-15 16:31:18,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-15 16:31:18,258 INFO L272 TraceCheckUtils]: 24: Hoare triple {6615#(or (= main_~b~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6371#true} is VALID [2022-04-15 16:31:18,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {6615#(or (= main_~b~0 0) (<= 1 main_~b~0))} assume !false; {6615#(or (= main_~b~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:18,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {6637#(<= 0 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6615#(or (= main_~b~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:18,273 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6434#(not (= |assume_abort_if_not_#in~cond| 0))} {6371#true} #75#return; {6637#(<= 0 main_~y~0)} is VALID [2022-04-15 16:31:18,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {6434#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6434#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:31:18,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {6650#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {6434#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:31:18,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {6371#true} ~cond := #in~cond; {6650#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 16:31:18,274 INFO L272 TraceCheckUtils]: 17: Hoare triple {6371#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6371#true} is VALID [2022-04-15 16:31:18,275 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6371#true} {6371#true} #73#return; {6371#true} is VALID [2022-04-15 16:31:18,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-15 16:31:18,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-15 16:31:18,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-15 16:31:18,275 INFO L272 TraceCheckUtils]: 12: Hoare triple {6371#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {6371#true} is VALID [2022-04-15 16:31:18,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {6371#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6371#true} is VALID [2022-04-15 16:31:18,275 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6371#true} {6371#true} #71#return; {6371#true} is VALID [2022-04-15 16:31:18,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-15 16:31:18,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-15 16:31:18,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-15 16:31:18,275 INFO L272 TraceCheckUtils]: 6: Hoare triple {6371#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {6371#true} is VALID [2022-04-15 16:31:18,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {6371#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6371#true} is VALID [2022-04-15 16:31:18,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {6371#true} call #t~ret6 := main(); {6371#true} is VALID [2022-04-15 16:31:18,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6371#true} {6371#true} #83#return; {6371#true} is VALID [2022-04-15 16:31:18,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-15 16:31:18,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {6371#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6371#true} is VALID [2022-04-15 16:31:18,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {6371#true} call ULTIMATE.init(); {6371#true} is VALID [2022-04-15 16:31:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 16:31:18,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:31:18,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927301670] [2022-04-15 16:31:18,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:31:18,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525666151] [2022-04-15 16:31:18,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525666151] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:31:18,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:31:18,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2022-04-15 16:31:18,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:31:18,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [384318094] [2022-04-15 16:31:18,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [384318094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:31:18,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:31:18,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 16:31:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939171241] [2022-04-15 16:31:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:31:18,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 54 [2022-04-15 16:31:18,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:31:18,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 16:31:18,318 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-15 16:31:18,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 16:31:18,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:31:18,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 16:31:18,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-15 16:31:18,319 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 16:31:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:31:19,074 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2022-04-15 16:31:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 16:31:19,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 54 [2022-04-15 16:31:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:31:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 16:31:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-15 16:31:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 16:31:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-15 16:31:19,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-04-15 16:31:19,128 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-15 16:31:19,129 INFO L225 Difference]: With dead ends: 84 [2022-04-15 16:31:19,130 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 16:31:19,130 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-04-15 16:31:19,131 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 16:31:19,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 124 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 16:31:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 16:31:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-04-15 16:31:19,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:31:19,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 16:31:19,329 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 16:31:19,329 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 16:31:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:31:19,330 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-04-15 16:31:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-04-15 16:31:19,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:31:19,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:31:19,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-15 16:31:19,331 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-15 16:31:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:31:19,333 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-04-15 16:31:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-04-15 16:31:19,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:31:19,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:31:19,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:31:19,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:31:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 16:31:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-04-15 16:31:19,335 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 54 [2022-04-15 16:31:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:31:19,335 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2022-04-15 16:31:19,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 16:31:19,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 71 transitions. [2022-04-15 16:31:27,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 67 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 16:31:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2022-04-15 16:31:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 16:31:27,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:31:27,984 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:31:28,002 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-15 16:31:28,185 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-15 16:31:28,185 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:31:28,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:31:28,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1563197702, now seen corresponding path program 3 times [2022-04-15 16:31:28,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:31:28,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1083128385] [2022-04-15 16:31:28,186 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:31:28,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1563197702, now seen corresponding path program 4 times [2022-04-15 16:31:28,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:31:28,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032157822] [2022-04-15 16:31:28,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:31:28,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:31:28,204 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:31:28,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1793941051] [2022-04-15 16:31:28,205 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 16:31:28,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:31:28,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:31:28,206 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-15 16:31:28,212 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-15 16:31:28,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 16:31:28,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:31:28,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 16:31:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:31:28,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:31:41,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {7121#true} call ULTIMATE.init(); {7121#true} is VALID [2022-04-15 16:31:41,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {7121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7121#true} is VALID [2022-04-15 16:31:41,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-15 16:31:41,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7121#true} {7121#true} #83#return; {7121#true} is VALID [2022-04-15 16:31:41,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {7121#true} call #t~ret6 := main(); {7121#true} is VALID [2022-04-15 16:31:41,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {7121#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7121#true} is VALID [2022-04-15 16:31:41,596 INFO L272 TraceCheckUtils]: 6: Hoare triple {7121#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:31:41,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-15 16:31:41,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-15 16:31:41,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-15 16:31:41,596 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7121#true} {7121#true} #71#return; {7121#true} is VALID [2022-04-15 16:31:41,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {7121#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7121#true} is VALID [2022-04-15 16:31:41,597 INFO L272 TraceCheckUtils]: 12: Hoare triple {7121#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:31:41,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-15 16:31:41,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-15 16:31:41,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-15 16:31:41,597 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7121#true} {7121#true} #73#return; {7121#true} is VALID [2022-04-15 16:31:41,597 INFO L272 TraceCheckUtils]: 17: Hoare triple {7121#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:31:41,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {7121#true} ~cond := #in~cond; {7180#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:31:41,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {7180#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7184#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:31:41,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {7184#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7184#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:31:41,598 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7184#(not (= |assume_abort_if_not_#in~cond| 0))} {7121#true} #75#return; {7191#(<= 1 main_~y~0)} is VALID [2022-04-15 16:31:41,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {7191#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7195#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {7195#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {7195#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,599 INFO L272 TraceCheckUtils]: 24: Hoare triple {7195#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:31:41,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-15 16:31:41,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-15 16:31:41,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-15 16:31:41,600 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7121#true} {7195#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #77#return; {7195#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {7195#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {7195#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {7195#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7220#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {7220#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} assume !false; {7220#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,602 INFO L272 TraceCheckUtils]: 32: Hoare triple {7220#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:31:41,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {7121#true} ~cond := #in~cond; {7230#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:31:41,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {7230#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7234#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:31:41,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {7234#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7234#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:31:41,604 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7234#(not (= |__VERIFIER_assert_#in~cond| 0))} {7220#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} #77#return; {7220#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,605 INFO L290 TraceCheckUtils]: 37: Hoare triple {7220#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {7220#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {7220#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7247#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,607 INFO L290 TraceCheckUtils]: 39: Hoare triple {7247#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !false; {7247#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,607 INFO L272 TraceCheckUtils]: 40: Hoare triple {7247#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:31:41,607 INFO L290 TraceCheckUtils]: 41: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-15 16:31:41,607 INFO L290 TraceCheckUtils]: 42: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-15 16:31:41,607 INFO L290 TraceCheckUtils]: 43: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-15 16:31:41,608 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7121#true} {7247#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} #77#return; {7247#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,608 INFO L290 TraceCheckUtils]: 45: Hoare triple {7247#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {7247#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,608 INFO L290 TraceCheckUtils]: 46: Hoare triple {7247#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7247#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,609 INFO L290 TraceCheckUtils]: 47: Hoare triple {7247#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7247#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:41,610 INFO L290 TraceCheckUtils]: 48: Hoare triple {7247#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {7278#(and (<= 1 main_~y~0) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} is VALID [2022-04-15 16:31:41,610 INFO L290 TraceCheckUtils]: 49: Hoare triple {7278#(and (<= 1 main_~y~0) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} assume !false; {7278#(and (<= 1 main_~y~0) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} is VALID [2022-04-15 16:31:41,610 INFO L272 TraceCheckUtils]: 50: Hoare triple {7278#(and (<= 1 main_~y~0) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:31:41,611 INFO L290 TraceCheckUtils]: 51: Hoare triple {7121#true} ~cond := #in~cond; {7230#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:31:41,611 INFO L290 TraceCheckUtils]: 52: Hoare triple {7230#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7234#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:31:41,611 INFO L290 TraceCheckUtils]: 53: Hoare triple {7234#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7234#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:31:43,613 WARN L284 TraceCheckUtils]: 54: Hoare quadruple {7234#(not (= |__VERIFIER_assert_#in~cond| 0))} {7278#(and (<= 1 main_~y~0) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} #77#return; {7297#(and (<= 1 main_~y~0) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} is UNKNOWN [2022-04-15 16:31:43,615 INFO L290 TraceCheckUtils]: 55: Hoare triple {7297#(and (<= 1 main_~y~0) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} assume !(0 != ~a~0 && 0 != ~b~0); {7301#(and (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-15 16:31:43,616 INFO L272 TraceCheckUtils]: 56: Hoare triple {7301#(and (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:31:43,616 INFO L290 TraceCheckUtils]: 57: Hoare triple {7305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:31:43,616 INFO L290 TraceCheckUtils]: 58: Hoare triple {7309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7122#false} is VALID [2022-04-15 16:31:43,617 INFO L290 TraceCheckUtils]: 59: Hoare triple {7122#false} assume !false; {7122#false} is VALID [2022-04-15 16:31:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 16:31:43,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:32:31,846 INFO L290 TraceCheckUtils]: 59: Hoare triple {7122#false} assume !false; {7122#false} is VALID [2022-04-15 16:32:31,846 INFO L290 TraceCheckUtils]: 58: Hoare triple {7309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7122#false} is VALID [2022-04-15 16:32:31,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {7305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:32:31,848 INFO L272 TraceCheckUtils]: 56: Hoare triple {7325#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:32:31,848 INFO L290 TraceCheckUtils]: 55: Hoare triple {7329#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {7325#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:32:31,850 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7234#(not (= |__VERIFIER_assert_#in~cond| 0))} {7121#true} #77#return; {7329#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 16:32:31,850 INFO L290 TraceCheckUtils]: 53: Hoare triple {7234#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7234#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:32:31,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {7342#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7234#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:32:31,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {7121#true} ~cond := #in~cond; {7342#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:32:31,851 INFO L272 TraceCheckUtils]: 50: Hoare triple {7121#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:32:31,851 INFO L290 TraceCheckUtils]: 49: Hoare triple {7121#true} assume !false; {7121#true} is VALID [2022-04-15 16:32:31,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {7121#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {7121#true} is VALID [2022-04-15 16:32:31,852 INFO L290 TraceCheckUtils]: 47: Hoare triple {7121#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7121#true} is VALID [2022-04-15 16:32:31,852 INFO L290 TraceCheckUtils]: 46: Hoare triple {7121#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7121#true} is VALID [2022-04-15 16:32:31,852 INFO L290 TraceCheckUtils]: 45: Hoare triple {7121#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7121#true} is VALID [2022-04-15 16:32:31,852 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7121#true} {7121#true} #77#return; {7121#true} is VALID [2022-04-15 16:32:31,852 INFO L290 TraceCheckUtils]: 43: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-15 16:32:31,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-15 16:32:31,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-15 16:32:31,852 INFO L272 TraceCheckUtils]: 40: Hoare triple {7121#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:32:31,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {7121#true} assume !false; {7121#true} is VALID [2022-04-15 16:32:31,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {7121#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7121#true} is VALID [2022-04-15 16:32:31,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {7121#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7121#true} is VALID [2022-04-15 16:32:31,853 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7121#true} {7121#true} #77#return; {7121#true} is VALID [2022-04-15 16:32:31,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-15 16:32:31,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-15 16:32:31,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-15 16:32:31,853 INFO L272 TraceCheckUtils]: 32: Hoare triple {7121#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:32:31,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {7121#true} assume !false; {7121#true} is VALID [2022-04-15 16:32:31,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {7121#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7121#true} is VALID [2022-04-15 16:32:31,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {7121#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7121#true} is VALID [2022-04-15 16:32:31,853 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7121#true} {7121#true} #77#return; {7121#true} is VALID [2022-04-15 16:32:31,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-15 16:32:31,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-15 16:32:31,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-15 16:32:31,853 INFO L272 TraceCheckUtils]: 24: Hoare triple {7121#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:32:31,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {7121#true} assume !false; {7121#true} is VALID [2022-04-15 16:32:31,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {7121#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7121#true} is VALID [2022-04-15 16:32:31,854 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7121#true} {7121#true} #75#return; {7121#true} is VALID [2022-04-15 16:32:31,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-15 16:32:31,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-15 16:32:31,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-15 16:32:31,854 INFO L272 TraceCheckUtils]: 17: Hoare triple {7121#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:32:31,854 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7121#true} {7121#true} #73#return; {7121#true} is VALID [2022-04-15 16:32:31,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-15 16:32:31,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-15 16:32:31,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-15 16:32:31,854 INFO L272 TraceCheckUtils]: 12: Hoare triple {7121#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:32:31,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {7121#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7121#true} is VALID [2022-04-15 16:32:31,855 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7121#true} {7121#true} #71#return; {7121#true} is VALID [2022-04-15 16:32:31,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-15 16:32:31,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-15 16:32:31,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-15 16:32:31,855 INFO L272 TraceCheckUtils]: 6: Hoare triple {7121#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {7121#true} is VALID [2022-04-15 16:32:31,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {7121#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7121#true} is VALID [2022-04-15 16:32:31,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {7121#true} call #t~ret6 := main(); {7121#true} is VALID [2022-04-15 16:32:31,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7121#true} {7121#true} #83#return; {7121#true} is VALID [2022-04-15 16:32:31,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-15 16:32:31,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {7121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7121#true} is VALID [2022-04-15 16:32:31,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {7121#true} call ULTIMATE.init(); {7121#true} is VALID [2022-04-15 16:32:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-15 16:32:31,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:32:31,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032157822] [2022-04-15 16:32:31,856 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:32:31,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793941051] [2022-04-15 16:32:31,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793941051] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:32:31,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:32:31,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 18 [2022-04-15 16:32:31,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:32:31,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1083128385] [2022-04-15 16:32:31,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1083128385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:32:31,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:32:31,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 16:32:31,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495671952] [2022-04-15 16:32:31,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:32:31,857 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 60 [2022-04-15 16:32:31,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:32:31,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 16:32:33,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:32:33,902 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 16:32:33,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:32:33,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 16:32:33,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-15 16:32:33,903 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 16:32:37,384 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-15 16:32:43,997 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-15 16:32:47,911 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-15 16:32:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:32:48,447 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2022-04-15 16:32:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 16:32:48,447 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 60 [2022-04-15 16:32:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:32:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 16:32:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-15 16:32:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 16:32:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-15 16:32:48,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 80 transitions. [2022-04-15 16:32:56,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 76 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 16:32:56,550 INFO L225 Difference]: With dead ends: 98 [2022-04-15 16:32:56,550 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 16:32:56,551 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2022-04-15 16:32:56,551 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 37 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-04-15 16:32:56,551 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 134 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 256 Invalid, 3 Unknown, 0 Unchecked, 9.3s Time] [2022-04-15 16:32:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 16:32:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2022-04-15 16:32:56,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:32:56,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 71 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 16:32:56,861 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 71 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 16:32:56,861 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 71 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 16:32:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:32:56,863 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-15 16:32:56,863 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-15 16:32:56,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:32:56,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:32:56,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 93 states. [2022-04-15 16:32:56,864 INFO L87 Difference]: Start difference. First operand has 71 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 93 states. [2022-04-15 16:32:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:32:56,867 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-15 16:32:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-15 16:32:56,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:32:56,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:32:56,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:32:56,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:32:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 16:32:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2022-04-15 16:32:56,869 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 60 [2022-04-15 16:32:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:32:56,870 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2022-04-15 16:32:56,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 16:32:56,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 91 transitions. [2022-04-15 16:33:12,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 84 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-15 16:33:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-04-15 16:33:12,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 16:33:12,186 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:33:12,186 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:33:12,203 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-15 16:33:12,391 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-15 16:33:12,391 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:33:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:33:12,392 INFO L85 PathProgramCache]: Analyzing trace with hash 464884373, now seen corresponding path program 1 times [2022-04-15 16:33:12,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:33:12,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [10398068] [2022-04-15 16:33:12,392 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:33:12,392 INFO L85 PathProgramCache]: Analyzing trace with hash 464884373, now seen corresponding path program 2 times [2022-04-15 16:33:12,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:33:12,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731533207] [2022-04-15 16:33:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:33:12,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:33:12,405 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:33:12,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1532073093] [2022-04-15 16:33:12,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:33:12,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:33:12,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:33:12,406 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-15 16:33:12,407 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-15 16:33:12,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:33:12,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:33:12,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 16:33:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:33:12,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:33:24,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {8036#true} call ULTIMATE.init(); {8036#true} is VALID [2022-04-15 16:33:24,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {8036#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8036#true} is VALID [2022-04-15 16:33:24,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-15 16:33:24,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8036#true} #83#return; {8036#true} is VALID [2022-04-15 16:33:24,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {8036#true} call #t~ret6 := main(); {8036#true} is VALID [2022-04-15 16:33:24,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {8036#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8036#true} is VALID [2022-04-15 16:33:24,649 INFO L272 TraceCheckUtils]: 6: Hoare triple {8036#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:33:24,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {8036#true} ~cond := #in~cond; {8062#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:33:24,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {8062#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8066#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:33:24,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {8066#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8066#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:33:24,651 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8066#(not (= |assume_abort_if_not_#in~cond| 0))} {8036#true} #71#return; {8073#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:33:24,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {8073#(and (<= 0 main_~x~0) (<= main_~x~0 50))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8073#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:33:24,651 INFO L272 TraceCheckUtils]: 12: Hoare triple {8073#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:33:24,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-15 16:33:24,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-15 16:33:24,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-15 16:33:24,658 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8036#true} {8073#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #73#return; {8073#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:33:24,658 INFO L272 TraceCheckUtils]: 17: Hoare triple {8073#(and (<= 0 main_~x~0) (<= main_~x~0 50))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:33:24,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-15 16:33:24,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-15 16:33:24,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-15 16:33:24,659 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8036#true} {8073#(and (<= 0 main_~x~0) (<= main_~x~0 50))} #75#return; {8073#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:33:24,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {8073#(and (<= 0 main_~x~0) (<= main_~x~0 50))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8110#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0))} is VALID [2022-04-15 16:33:24,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {8110#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0))} assume !false; {8110#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0))} is VALID [2022-04-15 16:33:24,661 INFO L272 TraceCheckUtils]: 24: Hoare triple {8110#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:33:24,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-15 16:33:24,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-15 16:33:24,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-15 16:33:24,662 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8036#true} {8110#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0))} #77#return; {8110#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0))} is VALID [2022-04-15 16:33:24,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {8110#(and (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {8132#(and (<= 0 main_~x~0) (<= main_~x~0 50) (not (= main_~b~0 0)) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-15 16:33:24,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {8132#(and (<= 0 main_~x~0) (<= main_~x~0 50) (not (= main_~b~0 0)) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8132#(and (<= 0 main_~x~0) (<= main_~x~0 50) (not (= main_~b~0 0)) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-15 16:33:24,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {8132#(and (<= 0 main_~x~0) (<= main_~x~0 50) (not (= main_~b~0 0)) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8132#(and (<= 0 main_~x~0) (<= main_~x~0 50) (not (= main_~b~0 0)) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-15 16:33:24,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {8132#(and (<= 0 main_~x~0) (<= main_~x~0 50) (not (= main_~b~0 0)) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {8142#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-15 16:33:24,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {8142#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} assume !false; {8142#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-15 16:33:24,665 INFO L272 TraceCheckUtils]: 34: Hoare triple {8142#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:33:24,665 INFO L290 TraceCheckUtils]: 35: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-15 16:33:24,665 INFO L290 TraceCheckUtils]: 36: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-15 16:33:24,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-15 16:33:24,665 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8036#true} {8142#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} #77#return; {8142#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-15 16:33:24,666 INFO L290 TraceCheckUtils]: 39: Hoare triple {8142#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {8164#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (not (= main_~b~0 0)) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-15 16:33:24,667 INFO L290 TraceCheckUtils]: 40: Hoare triple {8164#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (not (= main_~b~0 0)) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {8168#(and (<= 0 main_~x~0) (<= main_~x~0 50) (< 0 main_~a~0) (< 0 main_~b~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 16:33:24,667 INFO L290 TraceCheckUtils]: 41: Hoare triple {8168#(and (<= 0 main_~x~0) (<= main_~x~0 50) (< 0 main_~a~0) (< 0 main_~b~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !false; {8168#(and (<= 0 main_~x~0) (<= main_~x~0 50) (< 0 main_~a~0) (< 0 main_~b~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 16:33:24,667 INFO L272 TraceCheckUtils]: 42: Hoare triple {8168#(and (<= 0 main_~x~0) (<= main_~x~0 50) (< 0 main_~a~0) (< 0 main_~b~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:33:24,668 INFO L290 TraceCheckUtils]: 43: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-15 16:33:24,668 INFO L290 TraceCheckUtils]: 44: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-15 16:33:24,668 INFO L290 TraceCheckUtils]: 45: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-15 16:33:24,668 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8036#true} {8168#(and (<= 0 main_~x~0) (<= main_~x~0 50) (< 0 main_~a~0) (< 0 main_~b~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} #77#return; {8168#(and (<= 0 main_~x~0) (<= main_~x~0 50) (< 0 main_~a~0) (< 0 main_~b~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 16:33:24,669 INFO L290 TraceCheckUtils]: 47: Hoare triple {8168#(and (<= 0 main_~x~0) (<= main_~x~0 50) (< 0 main_~a~0) (< 0 main_~b~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !!(0 != ~a~0 && 0 != ~b~0); {8168#(and (<= 0 main_~x~0) (<= main_~x~0 50) (< 0 main_~a~0) (< 0 main_~b~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 16:33:24,669 INFO L290 TraceCheckUtils]: 48: Hoare triple {8168#(and (<= 0 main_~x~0) (<= main_~x~0 50) (< 0 main_~a~0) (< 0 main_~b~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8168#(and (<= 0 main_~x~0) (<= main_~x~0 50) (< 0 main_~a~0) (< 0 main_~b~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 16:33:24,669 INFO L290 TraceCheckUtils]: 49: Hoare triple {8168#(and (<= 0 main_~x~0) (<= main_~x~0 50) (< 0 main_~a~0) (< 0 main_~b~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8168#(and (<= 0 main_~x~0) (<= main_~x~0 50) (< 0 main_~a~0) (< 0 main_~b~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 16:33:24,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {8168#(and (<= 0 main_~x~0) (<= main_~x~0 50) (< 0 main_~a~0) (< 0 main_~b~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8199#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:33:24,671 INFO L290 TraceCheckUtils]: 51: Hoare triple {8199#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50))} assume !false; {8199#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-15 16:33:24,671 INFO L272 TraceCheckUtils]: 52: Hoare triple {8199#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:33:24,671 INFO L290 TraceCheckUtils]: 53: Hoare triple {8036#true} ~cond := #in~cond; {8209#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:33:24,671 INFO L290 TraceCheckUtils]: 54: Hoare triple {8209#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8213#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:33:24,672 INFO L290 TraceCheckUtils]: 55: Hoare triple {8213#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8213#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:33:26,674 WARN L284 TraceCheckUtils]: 56: Hoare quadruple {8213#(not (= |__VERIFIER_assert_#in~cond| 0))} {8199#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50))} #77#return; {8220#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} is UNKNOWN [2022-04-15 16:33:26,676 INFO L290 TraceCheckUtils]: 57: Hoare triple {8220#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 2)) (< 0 (+ main_~b~0 1)) (<= 0 main_~x~0) (<= main_~x~0 50) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} assume !(0 != ~a~0 && 0 != ~b~0); {8224#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~q~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 16:33:26,677 INFO L272 TraceCheckUtils]: 58: Hoare triple {8224#(and (<= 0 main_~x~0) (<= main_~x~0 50) (= main_~q~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8228#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:33:26,677 INFO L290 TraceCheckUtils]: 59: Hoare triple {8228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:33:26,677 INFO L290 TraceCheckUtils]: 60: Hoare triple {8232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8037#false} is VALID [2022-04-15 16:33:26,677 INFO L290 TraceCheckUtils]: 61: Hoare triple {8037#false} assume !false; {8037#false} is VALID [2022-04-15 16:33:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 20 proven. 26 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 16:33:26,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:34:23,875 INFO L290 TraceCheckUtils]: 61: Hoare triple {8037#false} assume !false; {8037#false} is VALID [2022-04-15 16:34:23,875 INFO L290 TraceCheckUtils]: 60: Hoare triple {8232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8037#false} is VALID [2022-04-15 16:34:23,875 INFO L290 TraceCheckUtils]: 59: Hoare triple {8228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:34:23,876 INFO L272 TraceCheckUtils]: 58: Hoare triple {8248#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8228#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:34:23,877 INFO L290 TraceCheckUtils]: 57: Hoare triple {8252#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {8248#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:34:23,879 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {8213#(not (= |__VERIFIER_assert_#in~cond| 0))} {8036#true} #77#return; {8252#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 16:34:23,879 INFO L290 TraceCheckUtils]: 55: Hoare triple {8213#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8213#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:34:23,879 INFO L290 TraceCheckUtils]: 54: Hoare triple {8265#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8213#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:34:23,880 INFO L290 TraceCheckUtils]: 53: Hoare triple {8036#true} ~cond := #in~cond; {8265#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:34:23,880 INFO L272 TraceCheckUtils]: 52: Hoare triple {8036#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L290 TraceCheckUtils]: 51: Hoare triple {8036#true} assume !false; {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L290 TraceCheckUtils]: 50: Hoare triple {8036#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L290 TraceCheckUtils]: 49: Hoare triple {8036#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L290 TraceCheckUtils]: 48: Hoare triple {8036#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L290 TraceCheckUtils]: 47: Hoare triple {8036#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8036#true} {8036#true} #77#return; {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L290 TraceCheckUtils]: 43: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L272 TraceCheckUtils]: 42: Hoare triple {8036#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L290 TraceCheckUtils]: 41: Hoare triple {8036#true} assume !false; {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L290 TraceCheckUtils]: 40: Hoare triple {8036#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {8036#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8036#true} {8036#true} #77#return; {8036#true} is VALID [2022-04-15 16:34:23,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L272 TraceCheckUtils]: 34: Hoare triple {8036#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {8036#true} assume !false; {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {8036#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {8036#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {8036#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {8036#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8036#true} {8036#true} #77#return; {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L272 TraceCheckUtils]: 24: Hoare triple {8036#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {8036#true} assume !false; {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {8036#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8036#true} {8036#true} #75#return; {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-15 16:34:23,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L272 TraceCheckUtils]: 17: Hoare triple {8036#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8036#true} {8036#true} #73#return; {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L272 TraceCheckUtils]: 12: Hoare triple {8036#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {8036#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8036#true} {8036#true} #71#return; {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L272 TraceCheckUtils]: 6: Hoare triple {8036#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {8036#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {8036#true} call #t~ret6 := main(); {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8036#true} #83#return; {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-15 16:34:23,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {8036#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8036#true} is VALID [2022-04-15 16:34:23,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {8036#true} call ULTIMATE.init(); {8036#true} is VALID [2022-04-15 16:34:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-15 16:34:23,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:34:23,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731533207] [2022-04-15 16:34:23,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:34:23,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532073093] [2022-04-15 16:34:23,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532073093] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:34:23,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:34:23,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 20 [2022-04-15 16:34:23,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:34:23,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [10398068] [2022-04-15 16:34:23,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [10398068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:34:23,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:34:23,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 16:34:23,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107670693] [2022-04-15 16:34:23,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:34:23,884 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 62 [2022-04-15 16:34:23,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:34:23,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-15 16:34:25,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:34:25,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 16:34:25,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:34:25,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 16:34:25,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-04-15 16:34:25,932 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-15 16:34:29,695 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-15 16:34:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:34:31,311 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2022-04-15 16:34:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 16:34:31,312 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 62 [2022-04-15 16:34:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:34:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-15 16:34:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2022-04-15 16:34:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-15 16:34:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2022-04-15 16:34:31,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 72 transitions. [2022-04-15 16:34:37,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 69 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 16:34:37,419 INFO L225 Difference]: With dead ends: 97 [2022-04-15 16:34:37,419 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 16:34:37,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-04-15 16:34:37,420 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 16:34:37,420 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 136 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 16:34:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 16:34:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2022-04-15 16:34:37,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:34:37,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 72 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 16:34:37,758 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 72 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 16:34:37,758 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 72 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 16:34:37,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:34:37,760 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2022-04-15 16:34:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2022-04-15 16:34:37,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:34:37,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:34:37,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 92 states. [2022-04-15 16:34:37,761 INFO L87 Difference]: Start difference. First operand has 72 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 92 states. [2022-04-15 16:34:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:34:37,763 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2022-04-15 16:34:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2022-04-15 16:34:37,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:34:37,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:34:37,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:34:37,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:34:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 16:34:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2022-04-15 16:34:37,766 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 62 [2022-04-15 16:34:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:34:37,766 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2022-04-15 16:34:37,766 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-15 16:34:37,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 93 transitions. [2022-04-15 16:34:52,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 86 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-15 16:34:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2022-04-15 16:34:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 16:34:52,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:34:52,861 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:34:52,881 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-15 16:34:53,073 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-15 16:34:53,074 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:34:53,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:34:53,074 INFO L85 PathProgramCache]: Analyzing trace with hash 487516627, now seen corresponding path program 5 times [2022-04-15 16:34:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:34:53,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2046974569] [2022-04-15 16:34:53,075 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:34:53,075 INFO L85 PathProgramCache]: Analyzing trace with hash 487516627, now seen corresponding path program 6 times [2022-04-15 16:34:53,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:34:53,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366268226] [2022-04-15 16:34:53,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:34:53,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:34:53,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:34:53,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319658322] [2022-04-15 16:34:53,087 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 16:34:53,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:34:53,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:34:53,088 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-15 16:34:53,090 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-15 16:34:53,136 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 16:34:53,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:34:53,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 16:34:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:34:53,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:35:03,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {8963#true} call ULTIMATE.init(); {8963#true} is VALID [2022-04-15 16:35:03,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {8963#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8963#true} {8963#true} #83#return; {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {8963#true} call #t~ret6 := main(); {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {8963#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {8963#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8963#true} {8963#true} #71#return; {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {8963#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L272 TraceCheckUtils]: 12: Hoare triple {8963#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-15 16:35:03,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:35:03,386 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8963#true} {8963#true} #73#return; {8963#true} is VALID [2022-04-15 16:35:03,386 INFO L272 TraceCheckUtils]: 17: Hoare triple {8963#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:35:03,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-15 16:35:03,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-15 16:35:03,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:35:03,386 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8963#true} {8963#true} #75#return; {8963#true} is VALID [2022-04-15 16:35:03,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {8963#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8963#true} is VALID [2022-04-15 16:35:03,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-15 16:35:03,386 INFO L272 TraceCheckUtils]: 24: Hoare triple {8963#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:35:03,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-15 16:35:03,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-15 16:35:03,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:35:03,387 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8963#true} {8963#true} #77#return; {8963#true} is VALID [2022-04-15 16:35:03,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {8963#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8963#true} is VALID [2022-04-15 16:35:03,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {8963#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8963#true} is VALID [2022-04-15 16:35:03,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {8963#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8963#true} is VALID [2022-04-15 16:35:03,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {8963#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8963#true} is VALID [2022-04-15 16:35:03,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-15 16:35:03,387 INFO L272 TraceCheckUtils]: 34: Hoare triple {8963#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:35:03,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-15 16:35:03,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-15 16:35:03,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:35:03,387 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8963#true} {8963#true} #77#return; {8963#true} is VALID [2022-04-15 16:35:03,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {8963#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8963#true} is VALID [2022-04-15 16:35:03,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {8963#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {8963#true} is VALID [2022-04-15 16:35:03,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-15 16:35:03,388 INFO L272 TraceCheckUtils]: 42: Hoare triple {8963#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:35:03,388 INFO L290 TraceCheckUtils]: 43: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-15 16:35:03,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-15 16:35:03,388 INFO L290 TraceCheckUtils]: 45: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:35:03,388 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8963#true} {8963#true} #77#return; {8963#true} is VALID [2022-04-15 16:35:03,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {8963#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8963#true} is VALID [2022-04-15 16:35:03,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {8963#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8963#true} is VALID [2022-04-15 16:35:03,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {8963#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8963#true} is VALID [2022-04-15 16:35:03,388 INFO L290 TraceCheckUtils]: 50: Hoare triple {8963#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8963#true} is VALID [2022-04-15 16:35:03,389 INFO L290 TraceCheckUtils]: 51: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-15 16:35:03,389 INFO L272 TraceCheckUtils]: 52: Hoare triple {8963#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:35:03,389 INFO L290 TraceCheckUtils]: 53: Hoare triple {8963#true} ~cond := #in~cond; {9127#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:35:03,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {9127#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:35:03,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {9131#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:35:05,393 WARN L284 TraceCheckUtils]: 56: Hoare quadruple {9131#(not (= |__VERIFIER_assert_#in~cond| 0))} {8963#true} #77#return; {9138#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is UNKNOWN [2022-04-15 16:35:05,394 INFO L290 TraceCheckUtils]: 57: Hoare triple {9138#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {9142#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:35:05,395 INFO L272 TraceCheckUtils]: 58: Hoare triple {9142#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9146#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:35:05,395 INFO L290 TraceCheckUtils]: 59: Hoare triple {9146#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9150#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:35:05,395 INFO L290 TraceCheckUtils]: 60: Hoare triple {9150#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8964#false} is VALID [2022-04-15 16:35:05,395 INFO L290 TraceCheckUtils]: 61: Hoare triple {8964#false} assume !false; {8964#false} is VALID [2022-04-15 16:35:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-15 16:35:05,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:36:00,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {8964#false} assume !false; {8964#false} is VALID [2022-04-15 16:36:00,787 INFO L290 TraceCheckUtils]: 60: Hoare triple {9150#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8964#false} is VALID [2022-04-15 16:36:00,787 INFO L290 TraceCheckUtils]: 59: Hoare triple {9146#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9150#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:36:00,787 INFO L272 TraceCheckUtils]: 58: Hoare triple {9142#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9146#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:36:00,788 INFO L290 TraceCheckUtils]: 57: Hoare triple {9169#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {9142#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 16:36:00,790 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {9131#(not (= |__VERIFIER_assert_#in~cond| 0))} {8963#true} #77#return; {9169#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 16:36:00,790 INFO L290 TraceCheckUtils]: 55: Hoare triple {9131#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:36:00,791 INFO L290 TraceCheckUtils]: 54: Hoare triple {9182#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:36:00,791 INFO L290 TraceCheckUtils]: 53: Hoare triple {8963#true} ~cond := #in~cond; {9182#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:36:00,791 INFO L272 TraceCheckUtils]: 52: Hoare triple {8963#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:36:00,791 INFO L290 TraceCheckUtils]: 51: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-15 16:36:00,791 INFO L290 TraceCheckUtils]: 50: Hoare triple {8963#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8963#true} is VALID [2022-04-15 16:36:00,791 INFO L290 TraceCheckUtils]: 49: Hoare triple {8963#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8963#true} is VALID [2022-04-15 16:36:00,791 INFO L290 TraceCheckUtils]: 48: Hoare triple {8963#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8963#true} is VALID [2022-04-15 16:36:00,791 INFO L290 TraceCheckUtils]: 47: Hoare triple {8963#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8963#true} is VALID [2022-04-15 16:36:00,791 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8963#true} {8963#true} #77#return; {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L290 TraceCheckUtils]: 44: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L272 TraceCheckUtils]: 42: Hoare triple {8963#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {8963#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {8963#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8963#true} {8963#true} #77#return; {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L272 TraceCheckUtils]: 34: Hoare triple {8963#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {8963#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {8963#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8963#true} is VALID [2022-04-15 16:36:00,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {8963#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {8963#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8963#true} {8963#true} #77#return; {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L272 TraceCheckUtils]: 24: Hoare triple {8963#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {8963#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8963#true} {8963#true} #75#return; {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L272 TraceCheckUtils]: 17: Hoare triple {8963#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8963#true} {8963#true} #73#return; {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-15 16:36:00,793 INFO L272 TraceCheckUtils]: 12: Hoare triple {8963#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 50 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:36:00,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {8963#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8963#true} is VALID [2022-04-15 16:36:00,794 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8963#true} {8963#true} #71#return; {8963#true} is VALID [2022-04-15 16:36:00,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:36:00,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-15 16:36:00,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-15 16:36:00,794 INFO L272 TraceCheckUtils]: 6: Hoare triple {8963#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 50 then 1 else 0)); {8963#true} is VALID [2022-04-15 16:36:00,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {8963#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8963#true} is VALID [2022-04-15 16:36:00,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {8963#true} call #t~ret6 := main(); {8963#true} is VALID [2022-04-15 16:36:00,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8963#true} {8963#true} #83#return; {8963#true} is VALID [2022-04-15 16:36:00,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-15 16:36:00,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {8963#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8963#true} is VALID [2022-04-15 16:36:00,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {8963#true} call ULTIMATE.init(); {8963#true} is VALID [2022-04-15 16:36:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-15 16:36:00,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:36:00,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366268226] [2022-04-15 16:36:00,794 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:36:00,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319658322] [2022-04-15 16:36:00,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319658322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:36:00,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:36:00,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 16:36:00,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:36:00,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2046974569] [2022-04-15 16:36:00,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2046974569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:36:00,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:36:00,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 16:36:00,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033926195] [2022-04-15 16:36:00,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:36:00,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-04-15 16:36:00,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:36:00,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 16:36:02,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:36:02,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 16:36:02,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:36:02,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 16:36:02,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 16:36:02,826 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 16:36:05,569 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-15 16:36:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:36:07,969 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2022-04-15 16:36:07,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 16:36:07,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-04-15 16:36:07,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:36:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 16:36:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-15 16:36:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 16:36:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-15 16:36:07,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-15 16:36:10,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:36:10,008 INFO L225 Difference]: With dead ends: 72 [2022-04-15 16:36:10,008 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 16:36:10,009 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 16:36:10,009 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 16:36:10,009 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 93 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 16:36:10,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 16:36:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 16:36:10,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:36:10,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 16:36:10,010 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 16:36:10,010 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 16:36:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:36:10,010 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 16:36:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 16:36:10,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:36:10,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:36:10,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 16:36:10,011 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 16:36:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:36:10,011 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 16:36:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 16:36:10,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:36:10,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:36:10,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:36:10,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:36:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 16:36:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 16:36:10,011 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2022-04-15 16:36:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:36:10,011 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 16:36:10,011 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 16:36:10,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 16:36:10,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:36:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 16:36:10,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:36:10,013 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 16:36:10,029 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-15 16:36:10,213 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-15 16:36:10,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 16:36:32,517 WARN L232 SmtUtils]: Spent 13.70s on a formula simplification. DAG size of input: 165 DAG size of output: 162 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 16:36:44,164 WARN L232 SmtUtils]: Spent 7.54s on a formula simplification. DAG size of input: 156 DAG size of output: 155 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 16:36:58,799 WARN L232 SmtUtils]: Spent 14.54s on a formula simplification. DAG size of input: 171 DAG size of output: 169 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 16:37:11,286 WARN L232 SmtUtils]: Spent 12.44s on a formula simplification. DAG size of input: 139 DAG size of output: 28 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 16:37:54,084 WARN L232 SmtUtils]: Spent 42.79s on a formula simplification. DAG size of input: 145 DAG size of output: 37 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter)