/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-fb4f59a-m [2022-04-28 14:05:09,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:05:09,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:05:10,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:05:10,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:05:10,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:05:10,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:05:10,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:05:10,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:05:10,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:05:10,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:05:10,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:05:10,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:05:10,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:05:10,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:05:10,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:05:10,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:05:10,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:05:10,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:05:10,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:05:10,058 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:05:10,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:05:10,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:05:10,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:05:10,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:05:10,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:05:10,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:05:10,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:05:10,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:05:10,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:05:10,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:05:10,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:05:10,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:05:10,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:05:10,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:05:10,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:05:10,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:05:10,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:05:10,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:05:10,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:05:10,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:05:10,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:05:10,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:05:10,090 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:05:10,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:05:10,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:05:10,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:05:10,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:05:10,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:05:10,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:05:10,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:05:10,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:05:10,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:05:10,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:05:10,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:05:10,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:05:10,094 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:05:10,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:05:10,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:05:10,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:05:10,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:05:10,094 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:05:10,094 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:05:10,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:05:10,095 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:05:10,095 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-28 14:05:10,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:05:10,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:05:10,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:05:10,355 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:05:10,356 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:05:10,356 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-28 14:05:10,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a678a8353/9327af3bf4df431b9c9f9cb6b49b10d7/FLAGe6723df00 [2022-04-28 14:05:10,769 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:05:10,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound50.c [2022-04-28 14:05:10,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a678a8353/9327af3bf4df431b9c9f9cb6b49b10d7/FLAGe6723df00 [2022-04-28 14:05:11,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a678a8353/9327af3bf4df431b9c9f9cb6b49b10d7 [2022-04-28 14:05:11,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:05:11,204 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:05:11,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:05:11,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:05:11,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:05:11,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:05:11" (1/1) ... [2022-04-28 14:05:11,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6198869a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:05:11, skipping insertion in model container [2022-04-28 14:05:11,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:05:11" (1/1) ... [2022-04-28 14:05:11,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:05:11,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:05:11,369 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-28 14:05:11,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:05:11,393 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:05:11,403 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-28 14:05:11,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:05:11,431 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:05:11,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:05:11 WrapperNode [2022-04-28 14:05:11,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:05:11,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:05:11,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:05:11,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:05:11,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:05:11" (1/1) ... [2022-04-28 14:05:11,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:05:11" (1/1) ... [2022-04-28 14:05:11,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:05:11" (1/1) ... [2022-04-28 14:05:11,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:05:11" (1/1) ... [2022-04-28 14:05:11,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:05:11" (1/1) ... [2022-04-28 14:05:11,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:05:11" (1/1) ... [2022-04-28 14:05:11,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:05:11" (1/1) ... [2022-04-28 14:05:11,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:05:11,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:05:11,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:05:11,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:05:11,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:05:11" (1/1) ... [2022-04-28 14:05:11,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:05:11,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:05:11,512 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-28 14:05:11,519 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-28 14:05:11,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:05:11,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:05:11,543 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:05:11,543 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:05:11,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:05:11,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:05:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:05:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:05:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:05:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:05:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:05:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:05:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:05:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:05:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:05:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:05:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:05:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:05:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:05:11,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:05:11,588 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:05:11,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:05:11,737 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:05:11,753 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:05:11,753 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:05:11,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:05:11 BoogieIcfgContainer [2022-04-28 14:05:11,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:05:11,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:05:11,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:05:11,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:05:11,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:05:11" (1/3) ... [2022-04-28 14:05:11,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e98f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:05:11, skipping insertion in model container [2022-04-28 14:05:11,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:05:11" (2/3) ... [2022-04-28 14:05:11,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e98f7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:05:11, skipping insertion in model container [2022-04-28 14:05:11,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:05:11" (3/3) ... [2022-04-28 14:05:11,777 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound50.c [2022-04-28 14:05:11,789 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:05:11,789 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:05:11,874 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:05:11,882 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@365c91db, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9efc000 [2022-04-28 14:05:11,882 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:05:11,894 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-28 14:05:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:05:11,902 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:05:11,903 INFO L195 NwaCegarLoop]: 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-28 14:05:11,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:05:11,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:05:11,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 1 times [2022-04-28 14:05:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:11,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145741645] [2022-04-28 14:05:11,932 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:05:11,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 2 times [2022-04-28 14:05:11,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:05:11,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802338115] [2022-04-28 14:05:11,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:05:11,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:05:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:05:12,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:05:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:05:12,177 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-28 14:05:12,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 14:05:12,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-28 14:05:12,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 14:05:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:05:12,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 14:05:12,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 14:05:12,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 14:05:12,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-28 14:05:12,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 14:05:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:05:12,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 14:05:12,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 14:05:12,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 14:05:12,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-28 14:05:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 14:05:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:05:12,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 14:05:12,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 14:05:12,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 14:05:12,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-28 14:05:12,209 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-28 14:05:12,209 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-28 14:05:12,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 14:05:12,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-28 14:05:12,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-28 14:05:12,210 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-28 14:05:12,211 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-28 14:05:12,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 14:05:12,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 14:05:12,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 14:05:12,212 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-28 14:05:12,212 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-28 14:05:12,212 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-28 14:05:12,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 14:05:12,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 14:05:12,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 14:05:12,213 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-28 14:05:12,214 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-28 14:05:12,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 14:05:12,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 14:05:12,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 14:05:12,215 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-28 14:05:12,215 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-28 14:05:12,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-28 14:05:12,215 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-28 14:05:12,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-28 14:05:12,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-28 14:05:12,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-28 14:05:12,217 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-28 14:05:12,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:05:12,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802338115] [2022-04-28 14:05:12,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802338115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:05:12,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:05:12,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:05:12,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:05:12,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [145741645] [2022-04-28 14:05:12,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [145741645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:05:12,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:05:12,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:05:12,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143461843] [2022-04-28 14:05:12,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:05:12,227 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-28 14:05:12,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:05:12,231 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-28 14:05:12,256 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-28 14:05:12,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:05:12,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:12,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:05:12,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:05:12,276 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-28 14:05:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:12,396 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-28 14:05:12,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:05:12,397 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-28 14:05:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:05:12,398 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-28 14:05:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-28 14:05:12,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-28 14:05:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-28 14:05:12,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-04-28 14:05:12,522 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-28 14:05:12,537 INFO L225 Difference]: With dead ends: 61 [2022-04-28 14:05:12,538 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 14:05:12,545 INFO L412 NwaCegarLoop]: 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-28 14:05:12,548 INFO L413 NwaCegarLoop]: 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-28 14:05:12,548 INFO L414 NwaCegarLoop]: 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-28 14:05:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 14:05:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 14:05:12,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:05:12,587 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-28 14:05:12,589 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-28 14:05:12,589 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-28 14:05:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:12,597 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-28 14:05:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-28 14:05:12,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:12,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:12,599 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-28 14:05:12,600 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-28 14:05:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:12,615 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-28 14:05:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-28 14:05:12,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:12,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:12,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:05:12,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:05:12,618 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-28 14:05:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-28 14:05:12,624 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-28 14:05:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:05:12,624 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-28 14:05:12,625 INFO L496 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-28 14:05:12,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 36 transitions. [2022-04-28 14:05:12,675 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-28 14:05:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-28 14:05:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 14:05:12,676 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:05:12,677 INFO L195 NwaCegarLoop]: 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-28 14:05:12,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:05:12,677 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:05:12,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:05:12,679 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 1 times [2022-04-28 14:05:12,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:12,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [405341930] [2022-04-28 14:05:12,682 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:05:12,682 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 2 times [2022-04-28 14:05:12,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:05:12,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347561984] [2022-04-28 14:05:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:05:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:05:12,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:05:12,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581252322] [2022-04-28 14:05:12,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:05:12,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:05:12,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:05:12,735 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-28 14:05:12,763 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-28 14:05:12,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:05:12,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:05:12,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 14:05:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:05:12,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:05:13,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} call ULTIMATE.init(); {295#true} is VALID [2022-04-28 14:05:13,079 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-28 14:05:13,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 14:05:13,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} #83#return; {295#true} is VALID [2022-04-28 14:05:13,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} call #t~ret6 := main(); {295#true} is VALID [2022-04-28 14:05:13,080 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-28 14:05:13,080 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-28 14:05:13,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-28 14:05:13,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-28 14:05:13,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 14:05:13,081 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {295#true} {295#true} #71#return; {295#true} is VALID [2022-04-28 14:05:13,081 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-28 14:05:13,081 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-28 14:05:13,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-28 14:05:13,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-28 14:05:13,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 14:05:13,082 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {295#true} {295#true} #73#return; {295#true} is VALID [2022-04-28 14:05:13,082 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-28 14:05:13,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-28 14:05:13,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-28 14:05:13,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 14:05:13,083 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {295#true} {295#true} #75#return; {295#true} is VALID [2022-04-28 14:05:13,084 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-28 14:05:13,084 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-28 14:05:13,086 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-28 14:05:13,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {373#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {377#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:05:13,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {377#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {296#false} is VALID [2022-04-28 14:05:13,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-04-28 14:05:13,088 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-28 14:05:13,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:05:13,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:05:13,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347561984] [2022-04-28 14:05:13,088 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:05:13,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581252322] [2022-04-28 14:05:13,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581252322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:05:13,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:05:13,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:05:13,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:05:13,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [405341930] [2022-04-28 14:05:13,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [405341930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:05:13,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:05:13,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:05:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527526386] [2022-04-28 14:05:13,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:05:13,093 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-28 14:05:13,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:05:13,094 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-28 14:05:13,128 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-28 14:05:13,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:05:13,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:13,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:05:13,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:05:13,130 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-28 14:05:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:13,379 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-28 14:05:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:05:13,379 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-28 14:05:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:05:13,380 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-28 14:05:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 14:05:13,387 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-28 14:05:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 14:05:13,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-28 14:05:13,460 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-28 14:05:13,464 INFO L225 Difference]: With dead ends: 43 [2022-04-28 14:05:13,465 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 14:05:13,468 INFO L412 NwaCegarLoop]: 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-28 14:05:13,470 INFO L413 NwaCegarLoop]: 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-28 14:05:13,475 INFO L414 NwaCegarLoop]: 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-28 14:05:13,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 14:05:13,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2022-04-28 14:05:13,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:05:13,497 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-28 14:05:13,498 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-28 14:05:13,498 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-28 14:05:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:13,501 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-28 14:05:13,502 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-28 14:05:13,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:13,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:13,503 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-28 14:05:13,503 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-28 14:05:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:05:13,506 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-28 14:05:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-28 14:05:13,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:05:13,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:05:13,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:05:13,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:05:13,508 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-28 14:05:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-04-28 14:05:13,510 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 28 [2022-04-28 14:05:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:05:13,510 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-04-28 14:05:13,511 INFO L496 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-28 14:05:13,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 42 transitions. [2022-04-28 14:05:13,558 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-28 14:05:13,558 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-28 14:05:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 14:05:13,561 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:05:13,562 INFO L195 NwaCegarLoop]: 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-28 14:05:13,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 14:05:13,775 WARN L477 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-28 14:05:13,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:05:13,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:05:13,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 1 times [2022-04-28 14:05:13,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:13,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1457427910] [2022-04-28 14:05:13,777 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:05:13,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 2 times [2022-04-28 14:05:13,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:05:13,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644748298] [2022-04-28 14:05:13,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:05:13,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:05:13,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:05:13,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301419855] [2022-04-28 14:05:13,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:05:13,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:05:13,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:05:13,814 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-28 14:05:13,845 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-28 14:05:13,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:05:13,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:05:13,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 14:05:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:05:13,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:05:23,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-28 14:05:23,179 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-28 14:05:23,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 14:05:23,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-28 14:05:23,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-28 14:05:23,179 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-28 14:05:23,180 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-28 14:05:23,180 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-28 14:05:23,181 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-28 14:05:23,181 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-28 14:05:23,182 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-28 14:05:23,183 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-28 14:05:23,183 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-28 14:05:23,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 14:05:23,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 14:05:23,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 14:05:23,184 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-28 14:05:23,184 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-28 14:05:23,185 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-28 14:05:23,185 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-28 14:05:23,185 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-28 14:05:23,186 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-28 14:05:23,187 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-28 14:05:23,187 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-28 14:05:23,188 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-28 14:05:23,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#true} ~cond := #in~cond; {708#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:05:23,189 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-28 14:05:23,189 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-28 14:05:25,192 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-28 14:05:25,193 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-28 14:05:25,196 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-28 14:05:25,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:05:25,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-28 14:05:25,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-28 14:05:25,197 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-28 14:05:25,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:05:56,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-28 14:05:56,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-28 14:05:56,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:05:56,383 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-28 14:05:56,384 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-28 14:05:56,386 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-28 14:05:56,387 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-28 14:05:56,387 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-28 14:05:56,388 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-28 14:05:56,388 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-28 14:05:56,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {623#true} assume !false; {623#true} is VALID [2022-04-28 14:05:56,388 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-28 14:05:56,388 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {623#true} {623#true} #75#return; {623#true} is VALID [2022-04-28 14:05:56,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 14:05:56,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 14:05:56,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 14:05:56,389 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-28 14:05:56,389 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {623#true} {623#true} #73#return; {623#true} is VALID [2022-04-28 14:05:56,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 14:05:56,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 14:05:56,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 14:05:56,390 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-28 14:05:56,390 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-28 14:05:56,390 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {623#true} {623#true} #71#return; {623#true} is VALID [2022-04-28 14:05:56,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 14:05:56,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 14:05:56,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 14:05:56,391 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-28 14:05:56,391 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-28 14:05:56,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-28 14:05:56,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-28 14:05:56,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 14:05:56,392 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-28 14:05:56,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-28 14:05:56,392 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-28 14:05:56,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:05:56,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644748298] [2022-04-28 14:05:56,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:05:56,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301419855] [2022-04-28 14:05:56,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301419855] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:05:56,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:05:56,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-28 14:05:56,393 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:05:56,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1457427910] [2022-04-28 14:05:56,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1457427910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:05:56,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:05:56,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 14:05:56,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690975391] [2022-04-28 14:05:56,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:05:56,394 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-28 14:05:56,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:05:56,395 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-28 14:05:58,422 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-28 14:05:58,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 14:05:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:05:58,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 14:05:58,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-04-28 14:05:58,423 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-28 14:06:01,077 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-28 14:06:07,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 14:06:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:07,665 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-28 14:06:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 14:06:07,666 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-28 14:06:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:06:07,666 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-28 14:06:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-28 14:06:07,669 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-28 14:06:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-28 14:06:07,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2022-04-28 14:06:07,726 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-28 14:06:07,728 INFO L225 Difference]: With dead ends: 47 [2022-04-28 14:06:07,728 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 14:06:07,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-28 14:06:07,729 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:06:07,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 137 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 228 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 14:06:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 14:06:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-04-28 14:06:07,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:06:07,778 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-28 14:06:07,779 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-28 14:06:07,779 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-28 14:06:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:07,782 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 14:06:07,782 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 14:06:07,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:07,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:07,783 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-28 14:06:07,783 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-28 14:06:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:06:07,786 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 14:06:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 14:06:07,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:06:07,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:06:07,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:06:07,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:06:07,787 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-28 14:06:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-28 14:06:07,789 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 34 [2022-04-28 14:06:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:06:07,789 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-28 14:06:07,789 INFO L496 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-28 14:06:07,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 49 transitions. [2022-04-28 14:06:07,853 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-28 14:06:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-28 14:06:07,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 14:06:07,854 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:06:07,854 INFO L195 NwaCegarLoop]: 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-28 14:06:07,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 14:06:08,054 WARN L477 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-28 14:06:08,055 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:06:08,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:06:08,055 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 1 times [2022-04-28 14:06:08,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:06:08,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1525059284] [2022-04-28 14:06:08,056 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:06:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 2 times [2022-04-28 14:06:08,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:06:08,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683108929] [2022-04-28 14:06:08,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:06:08,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:06:08,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:06:08,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253869266] [2022-04-28 14:06:08,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:06:08,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:06:08,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:06:08,076 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-28 14:06:08,091 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-28 14:06:08,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:06:08,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:06:08,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 14:06:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:06:08,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:06:11,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 14:06:11,324 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-28 14:06:11,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:06:11,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #83#return; {1116#true} is VALID [2022-04-28 14:06:11,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 14:06:11,324 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-28 14:06:11,324 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-28 14:06:11,325 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-28 14:06:11,325 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-28 14:06:11,325 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-28 14:06:11,326 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-28 14:06:11,327 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-28 14:06:11,327 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-28 14:06:11,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:06:11,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:06:11,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:06:11,327 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-28 14:06:11,328 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-28 14:06:11,328 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-28 14:06:11,328 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-28 14:06:11,329 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-28 14:06:11,329 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-28 14:06:11,330 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-28 14:06:11,330 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-28 14:06:11,330 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-28 14:06:11,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:06:11,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:06:11,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:06:11,331 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-28 14:06:11,331 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-28 14:06:11,333 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-28 14:06:11,333 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-28 14:06:11,335 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-28 14:06:11,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:06:11,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {1227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 14:06:11,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 14:06:11,336 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-28 14:06:11,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:07:13,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 14:07:13,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {1227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 14:07:13,852 INFO L290 TraceCheckUtils]: 33: Hoare triple {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:07:13,852 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-28 14:07:13,853 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-28 14:07:13,858 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-28 14:07:13,859 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-28 14:07:13,860 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-28 14:07:13,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:07:13,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:07:13,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:07:13,861 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-28 14:07:13,862 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-28 14:07:13,868 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-28 14:07:13,869 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-28 14:07:13,870 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-28 14:07:13,870 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-28 14:07:13,871 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-28 14:07:13,871 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-28 14:07:13,871 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1116#true} {1116#true} #73#return; {1116#true} is VALID [2022-04-28 14:07:13,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:07:13,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:07:13,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:07:13,872 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-28 14:07:13,872 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-28 14:07:13,872 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #71#return; {1116#true} is VALID [2022-04-28 14:07:13,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:07:13,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 14:07:13,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 14:07:13,872 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-28 14:07:13,873 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-28 14:07:13,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 14:07:13,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #83#return; {1116#true} is VALID [2022-04-28 14:07:13,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 14:07:13,873 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-28 14:07:13,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 14:07:13,874 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-28 14:07:13,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:07:13,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683108929] [2022-04-28 14:07:13,874 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:07:13,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253869266] [2022-04-28 14:07:13,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253869266] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:07:13,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:07:13,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-28 14:07:13,875 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:07:13,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1525059284] [2022-04-28 14:07:13,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1525059284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:07:13,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:07:13,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 14:07:13,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980626172] [2022-04-28 14:07:13,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:07:13,876 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-28 14:07:13,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:07:13,876 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-28 14:07:13,906 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-28 14:07:13,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 14:07:13,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:13,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 14:07:13,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-04-28 14:07:13,908 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-28 14:07:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:14,968 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-28 14:07:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:07:14,969 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-28 14:07:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:07:14,969 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-28 14:07:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-28 14:07:14,971 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-28 14:07:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-28 14:07:14,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2022-04-28 14:07:15,037 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-28 14:07:15,038 INFO L225 Difference]: With dead ends: 59 [2022-04-28 14:07:15,039 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 14:07:15,039 INFO L412 NwaCegarLoop]: 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-28 14:07:15,040 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 14:07:15,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 125 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 14:07:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 14:07:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2022-04-28 14:07:15,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:07:15,105 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-28 14:07:15,106 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-28 14:07:15,106 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-28 14:07:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:15,108 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-28 14:07:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2022-04-28 14:07:15,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:15,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:15,109 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-28 14:07:15,110 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-28 14:07:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:15,112 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-28 14:07:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2022-04-28 14:07:15,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:15,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:15,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:07:15,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:07:15,113 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-28 14:07:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-28 14:07:15,115 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 36 [2022-04-28 14:07:15,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:07:15,115 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-28 14:07:15,116 INFO L496 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-28 14:07:15,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-28 14:07:15,195 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-28 14:07:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-28 14:07:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 14:07:15,196 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:07:15,196 INFO L195 NwaCegarLoop]: 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-28 14:07:15,215 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-28 14:07:15,407 WARN L477 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-28 14:07:15,407 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:07:15,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:07:15,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2032180221, now seen corresponding path program 1 times [2022-04-28 14:07:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:15,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [172154377] [2022-04-28 14:07:15,409 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:07:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2032180221, now seen corresponding path program 2 times [2022-04-28 14:07:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:07:15,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106506023] [2022-04-28 14:07:15,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:07:15,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:07:15,431 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:07:15,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [848093936] [2022-04-28 14:07:15,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:07:15,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:07:15,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:07:15,432 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-28 14:07:15,439 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-28 14:07:15,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:07:15,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:07:15,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 14:07:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:07:15,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:07:15,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {1677#true} call ULTIMATE.init(); {1677#true} is VALID [2022-04-28 14:07:15,833 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-28 14:07:15,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:07:15,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1677#true} {1677#true} #83#return; {1677#true} is VALID [2022-04-28 14:07:15,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {1677#true} call #t~ret6 := main(); {1677#true} is VALID [2022-04-28 14:07:15,833 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-28 14:07:15,834 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-28 14:07:15,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-28 14:07:15,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-28 14:07:15,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:07:15,834 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1677#true} {1677#true} #71#return; {1677#true} is VALID [2022-04-28 14:07:15,834 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-28 14:07:15,834 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-28 14:07:15,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-28 14:07:15,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-28 14:07:15,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:07:15,835 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1677#true} {1677#true} #73#return; {1677#true} is VALID [2022-04-28 14:07:15,835 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-28 14:07:15,836 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-28 14:07:15,836 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-28 14:07:15,836 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-28 14:07:15,837 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-28 14:07:15,838 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-28 14:07:15,838 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-28 14:07:15,838 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-28 14:07:15,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-28 14:07:15,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-28 14:07:15,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:07:15,840 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-28 14:07:15,840 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-28 14:07:15,841 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-28 14:07:15,842 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-28 14:07:15,842 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-28 14:07:15,845 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-28 14:07:15,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {1786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:07:15,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {1790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1678#false} is VALID [2022-04-28 14:07:15,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {1678#false} assume !false; {1678#false} is VALID [2022-04-28 14:07:15,846 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-28 14:07:15,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:07:16,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {1678#false} assume !false; {1678#false} is VALID [2022-04-28 14:07:16,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {1790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1678#false} is VALID [2022-04-28 14:07:16,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {1786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:07:16,383 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-28 14:07:16,384 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-28 14:07:16,404 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-28 14:07:16,405 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-28 14:07:16,409 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-28 14:07:16,411 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-28 14:07:16,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:07:16,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-28 14:07:16,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-28 14:07:16,412 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-28 14:07:16,412 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-28 14:07:16,413 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-28 14:07:16,413 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1677#true} {1677#true} #75#return; {1677#true} is VALID [2022-04-28 14:07:16,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:07:16,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-28 14:07:16,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-28 14:07:16,413 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-28 14:07:16,413 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1677#true} {1677#true} #73#return; {1677#true} is VALID [2022-04-28 14:07:16,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:07:16,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-28 14:07:16,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-28 14:07:16,414 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-28 14:07:16,414 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-28 14:07:16,414 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1677#true} {1677#true} #71#return; {1677#true} is VALID [2022-04-28 14:07:16,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:07:16,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-28 14:07:16,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-28 14:07:16,415 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-28 14:07:16,415 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-28 14:07:16,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {1677#true} call #t~ret6 := main(); {1677#true} is VALID [2022-04-28 14:07:16,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1677#true} {1677#true} #83#return; {1677#true} is VALID [2022-04-28 14:07:16,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-28 14:07:16,415 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-28 14:07:16,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {1677#true} call ULTIMATE.init(); {1677#true} is VALID [2022-04-28 14:07:16,416 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-28 14:07:16,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:07:16,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106506023] [2022-04-28 14:07:16,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:07:16,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848093936] [2022-04-28 14:07:16,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848093936] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:07:16,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:07:16,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2022-04-28 14:07:16,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:07:16,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [172154377] [2022-04-28 14:07:16,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [172154377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:07:16,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:07:16,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 14:07:16,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739764580] [2022-04-28 14:07:16,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:07:16,418 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-28 14:07:16,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:07:16,418 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-28 14:07:16,468 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-28 14:07:16,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 14:07:16,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:16,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 14:07:16,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 14:07:16,469 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-28 14:07:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:16,928 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 14:07:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:07:16,928 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-28 14:07:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:07:16,929 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-28 14:07:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:07:16,930 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-28 14:07:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:07:16,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 14:07:16,999 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-28 14:07:17,004 INFO L225 Difference]: With dead ends: 54 [2022-04-28 14:07:17,005 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 14:07:17,005 INFO L412 NwaCegarLoop]: 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-28 14:07:17,008 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:07:17,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 83 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 14:07:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 14:07:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2022-04-28 14:07:17,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:07:17,062 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-28 14:07:17,062 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-28 14:07:17,062 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-28 14:07:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:17,069 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-28 14:07:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-28 14:07:17,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:17,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:17,070 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-28 14:07:17,071 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-28 14:07:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:17,073 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-28 14:07:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-28 14:07:17,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:17,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:17,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:07:17,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:07:17,075 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-28 14:07:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-04-28 14:07:17,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 37 [2022-04-28 14:07:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:07:17,077 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-04-28 14:07:17,077 INFO L496 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-28 14:07:17,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 52 transitions. [2022-04-28 14:07:17,978 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-28 14:07:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-04-28 14:07:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 14:07:17,979 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:07:17,980 INFO L195 NwaCegarLoop]: 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-28 14:07:18,006 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-28 14:07:18,202 WARN L477 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-28 14:07:18,203 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:07:18,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:07:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 1 times [2022-04-28 14:07:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:18,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1700342172] [2022-04-28 14:07:18,204 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:07:18,204 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 2 times [2022-04-28 14:07:18,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:07:18,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865007635] [2022-04-28 14:07:18,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:07:18,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:07:18,223 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:07:18,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399388832] [2022-04-28 14:07:18,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:07:18,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:07:18,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:07:18,228 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-28 14:07:18,229 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-28 14:07:18,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:07:18,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:07:18,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 14:07:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:07:18,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:07:18,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {2214#true} call ULTIMATE.init(); {2214#true} is VALID [2022-04-28 14:07:18,523 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-28 14:07:18,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-28 14:07:18,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2214#true} {2214#true} #83#return; {2214#true} is VALID [2022-04-28 14:07:18,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {2214#true} call #t~ret6 := main(); {2214#true} is VALID [2022-04-28 14:07:18,524 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-28 14:07:18,524 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-28 14:07:18,524 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-28 14:07:18,525 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-28 14:07:18,525 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-28 14:07:18,525 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-28 14:07:18,526 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-28 14:07:18,526 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-28 14:07:18,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-28 14:07:18,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-28 14:07:18,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-28 14:07:18,527 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-28 14:07:18,527 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-28 14:07:18,527 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-28 14:07:18,527 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-28 14:07:18,528 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-28 14:07:18,528 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-28 14:07:18,529 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-28 14:07:18,529 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-28 14:07:18,529 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-28 14:07:18,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-28 14:07:18,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-28 14:07:18,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-28 14:07:18,530 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-28 14:07:18,530 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-28 14:07:18,530 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-28 14:07:18,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-28 14:07:18,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-28 14:07:18,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-28 14:07:18,531 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-28 14:07:18,532 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-28 14:07:18,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {2330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:07:18,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {2334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2215#false} is VALID [2022-04-28 14:07:18,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {2215#false} assume !false; {2215#false} is VALID [2022-04-28 14:07:18,533 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-28 14:07:18,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:07:18,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {2215#false} assume !false; {2215#false} is VALID [2022-04-28 14:07:18,786 INFO L290 TraceCheckUtils]: 37: Hoare triple {2334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2215#false} is VALID [2022-04-28 14:07:18,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {2330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:07:18,787 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-28 14:07:18,788 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-28 14:07:18,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-28 14:07:18,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-28 14:07:18,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-28 14:07:18,788 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-28 14:07:18,790 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-28 14:07:18,790 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2214#true} {2214#true} #77#return; {2214#true} is VALID [2022-04-28 14:07:18,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-28 14:07:18,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-28 14:07:18,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-28 14:07:18,791 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-28 14:07:18,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {2214#true} assume !false; {2214#true} is VALID [2022-04-28 14:07:18,791 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-28 14:07:18,791 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2214#true} {2214#true} #75#return; {2214#true} is VALID [2022-04-28 14:07:18,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-28 14:07:18,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-28 14:07:18,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-28 14:07:18,792 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-28 14:07:18,792 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2214#true} {2214#true} #73#return; {2214#true} is VALID [2022-04-28 14:07:18,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-28 14:07:18,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-28 14:07:18,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-28 14:07:18,792 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-28 14:07:18,792 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-28 14:07:18,792 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2214#true} {2214#true} #71#return; {2214#true} is VALID [2022-04-28 14:07:18,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-28 14:07:18,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {2214#true} assume !(0 == ~cond); {2214#true} is VALID [2022-04-28 14:07:18,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {2214#true} ~cond := #in~cond; {2214#true} is VALID [2022-04-28 14:07:18,793 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-28 14:07:18,793 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-28 14:07:18,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {2214#true} call #t~ret6 := main(); {2214#true} is VALID [2022-04-28 14:07:18,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2214#true} {2214#true} #83#return; {2214#true} is VALID [2022-04-28 14:07:18,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-28 14:07:18,793 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-28 14:07:18,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {2214#true} call ULTIMATE.init(); {2214#true} is VALID [2022-04-28 14:07:18,794 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-28 14:07:18,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:07:18,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865007635] [2022-04-28 14:07:18,794 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:07:18,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399388832] [2022-04-28 14:07:18,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399388832] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:07:18,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:07:18,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-28 14:07:18,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:07:18,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1700342172] [2022-04-28 14:07:18,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1700342172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:07:18,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:07:18,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:07:18,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237032902] [2022-04-28 14:07:18,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:07:18,796 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-28 14:07:18,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:07:18,796 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-28 14:07:18,819 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-28 14:07:18,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:07:18,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:18,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:07:18,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:07:18,820 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-28 14:07:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:19,183 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-04-28 14:07:19,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:07:19,184 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-28 14:07:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:07:19,184 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-28 14:07:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:07:19,185 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-28 14:07:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 14:07:19,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 14:07:19,218 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-28 14:07:19,219 INFO L225 Difference]: With dead ends: 51 [2022-04-28 14:07:19,219 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 14:07:19,219 INFO L412 NwaCegarLoop]: 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-28 14:07:19,220 INFO L413 NwaCegarLoop]: 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-28 14:07:19,220 INFO L414 NwaCegarLoop]: 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-28 14:07:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 14:07:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 14:07:19,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:07:19,263 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-28 14:07:19,263 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-28 14:07:19,263 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-28 14:07:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:19,264 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-28 14:07:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-28 14:07:19,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:19,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:19,265 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-28 14:07:19,265 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-28 14:07:19,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:19,267 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-28 14:07:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-28 14:07:19,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:19,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:19,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:07:19,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:07:19,267 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-28 14:07:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-04-28 14:07:19,269 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 39 [2022-04-28 14:07:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:07:19,269 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-04-28 14:07:19,269 INFO L496 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-28 14:07:19,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 42 transitions. [2022-04-28 14:07:20,147 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-28 14:07:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-28 14:07:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 14:07:20,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:07:20,148 INFO L195 NwaCegarLoop]: 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-28 14:07:20,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 14:07:20,348 WARN L477 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-28 14:07:20,349 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:07:20,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:07:20,349 INFO L85 PathProgramCache]: Analyzing trace with hash -982526417, now seen corresponding path program 1 times [2022-04-28 14:07:20,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:20,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1064832269] [2022-04-28 14:07:20,349 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:07:20,350 INFO L85 PathProgramCache]: Analyzing trace with hash -982526417, now seen corresponding path program 2 times [2022-04-28 14:07:20,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:07:20,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558970657] [2022-04-28 14:07:20,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:07:20,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:07:20,363 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:07:20,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [204388533] [2022-04-28 14:07:20,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:07:20,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:07:20,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:07:20,365 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-28 14:07:20,388 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-28 14:07:20,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:07:20,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:07:20,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 14:07:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:07:20,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:07:20,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {2710#true} call ULTIMATE.init(); {2710#true} is VALID [2022-04-28 14:07:20,968 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-28 14:07:20,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-28 14:07:20,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2710#true} {2710#true} #83#return; {2710#true} is VALID [2022-04-28 14:07:20,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {2710#true} call #t~ret6 := main(); {2710#true} is VALID [2022-04-28 14:07:20,968 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-28 14:07:20,968 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-28 14:07:20,970 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-28 14:07:20,971 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-28 14:07:20,975 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-28 14:07:20,976 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-28 14:07:20,983 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-28 14:07:20,984 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-28 14:07:20,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-28 14:07:20,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-28 14:07:20,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-28 14:07:20,985 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-28 14:07:20,986 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-28 14:07:20,986 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-28 14:07:20,986 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-28 14:07:20,986 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-28 14:07:20,987 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-28 14:07:20,987 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-28 14:07:20,988 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-28 14:07:20,988 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-28 14:07:20,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-28 14:07:20,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-28 14:07:20,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-28 14:07:20,990 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-28 14:07:20,990 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-28 14:07:20,992 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-28 14:07:20,992 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-28 14:07:20,992 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-28 14:07:20,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-28 14:07:20,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-28 14:07:20,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-28 14:07:20,993 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-28 14:07:20,993 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-28 14:07:20,993 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-28 14:07:20,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {2711#false} ~cond := #in~cond; {2711#false} is VALID [2022-04-28 14:07:20,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {2711#false} assume 0 == ~cond; {2711#false} is VALID [2022-04-28 14:07:20,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {2711#false} assume !false; {2711#false} is VALID [2022-04-28 14:07:20,994 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-28 14:07:20,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:07:22,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {2711#false} assume !false; {2711#false} is VALID [2022-04-28 14:07:22,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {2711#false} assume 0 == ~cond; {2711#false} is VALID [2022-04-28 14:07:22,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {2711#false} ~cond := #in~cond; {2711#false} is VALID [2022-04-28 14:07:22,028 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-28 14:07:22,028 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-28 14:07:22,029 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-28 14:07:22,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-28 14:07:22,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-28 14:07:22,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-28 14:07:22,029 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-28 14:07:22,030 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-28 14:07:22,031 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-28 14:07:22,031 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-28 14:07:22,032 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-28 14:07:22,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-28 14:07:22,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-28 14:07:22,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-28 14:07:22,032 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-28 14:07:22,032 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-28 14:07:22,033 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-28 14:07:22,034 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-28 14:07:22,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-28 14:07:22,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-28 14:07:22,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-28 14:07:22,034 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-28 14:07:22,034 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-28 14:07:22,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-28 14:07:22,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {2710#true} assume !(0 == ~cond); {2710#true} is VALID [2022-04-28 14:07:22,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {2710#true} ~cond := #in~cond; {2710#true} is VALID [2022-04-28 14:07:22,035 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-28 14:07:22,035 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-28 14:07:22,036 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-28 14:07:22,036 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-28 14:07:22,036 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-28 14:07:22,037 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-28 14:07:22,037 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-28 14:07:22,037 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-28 14:07:22,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {2710#true} call #t~ret6 := main(); {2710#true} is VALID [2022-04-28 14:07:22,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2710#true} {2710#true} #83#return; {2710#true} is VALID [2022-04-28 14:07:22,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {2710#true} assume true; {2710#true} is VALID [2022-04-28 14:07:22,037 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-28 14:07:22,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {2710#true} call ULTIMATE.init(); {2710#true} is VALID [2022-04-28 14:07:22,037 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-28 14:07:22,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:07:22,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558970657] [2022-04-28 14:07:22,038 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:07:22,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204388533] [2022-04-28 14:07:22,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204388533] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:07:22,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:07:22,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-04-28 14:07:22,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:07:22,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1064832269] [2022-04-28 14:07:22,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1064832269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:07:22,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:07:22,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:07:22,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866742871] [2022-04-28 14:07:22,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:07:22,039 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-28 14:07:22,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:07:22,039 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-28 14:07:22,071 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-28 14:07:22,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:07:22,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:22,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:07:22,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:07:22,072 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-28 14:07:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:22,442 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-28 14:07:22,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:07:22,442 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-28 14:07:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:07:22,443 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-28 14:07:22,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 14:07:22,444 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-28 14:07:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 14:07:22,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-28 14:07:22,486 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-28 14:07:22,488 INFO L225 Difference]: With dead ends: 52 [2022-04-28 14:07:22,488 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 14:07:22,489 INFO L412 NwaCegarLoop]: 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-28 14:07:22,489 INFO L413 NwaCegarLoop]: 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-28 14:07:22,490 INFO L414 NwaCegarLoop]: 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-28 14:07:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 14:07:22,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2022-04-28 14:07:22,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:07:22,554 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-28 14:07:22,554 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-28 14:07:22,554 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-28 14:07:22,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:22,556 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-28 14:07:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-28 14:07:22,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:22,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:22,556 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-28 14:07:22,556 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-28 14:07:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:07:22,558 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-28 14:07:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-28 14:07:22,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:07:22,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:07:22,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:07:22,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:07:22,559 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-28 14:07:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2022-04-28 14:07:22,560 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 42 [2022-04-28 14:07:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:07:22,560 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2022-04-28 14:07:22,561 INFO L496 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-28 14:07:22,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 54 transitions. [2022-04-28 14:07:23,471 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-28 14:07:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-04-28 14:07:23,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 14:07:23,471 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:07:23,472 INFO L195 NwaCegarLoop]: 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-28 14:07:23,488 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-28 14:07:23,675 WARN L477 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-28 14:07:23,675 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:07:23,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:07:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1669465851, now seen corresponding path program 1 times [2022-04-28 14:07:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:07:23,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [318485518] [2022-04-28 14:07:23,676 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:07:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1669465851, now seen corresponding path program 2 times [2022-04-28 14:07:23,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:07:23,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418693754] [2022-04-28 14:07:23,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:07:23,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:07:23,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:07:23,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692877783] [2022-04-28 14:07:23,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:07:23,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:07:23,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:07:23,722 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-28 14:07:23,723 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-28 14:07:23,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:07:23,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:07:23,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:07:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:07:23,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:07:34,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {3266#true} call ULTIMATE.init(); {3266#true} is VALID [2022-04-28 14:07:34,010 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-28 14:07:34,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-28 14:07:34,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3266#true} {3266#true} #83#return; {3266#true} is VALID [2022-04-28 14:07:34,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {3266#true} call #t~ret6 := main(); {3266#true} is VALID [2022-04-28 14:07:34,011 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-28 14:07:34,011 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-28 14:07:34,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-28 14:07:34,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-28 14:07:34,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-28 14:07:34,011 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3266#true} {3266#true} #71#return; {3266#true} is VALID [2022-04-28 14:07:34,012 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-28 14:07:34,012 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-28 14:07:34,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-28 14:07:34,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-28 14:07:34,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-28 14:07:34,012 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3266#true} {3266#true} #73#return; {3266#true} is VALID [2022-04-28 14:07:34,012 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-28 14:07:34,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-28 14:07:34,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-28 14:07:34,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-28 14:07:34,013 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3266#true} {3266#true} #75#return; {3266#true} is VALID [2022-04-28 14:07:34,013 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-28 14:07:34,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {3266#true} assume !false; {3266#true} is VALID [2022-04-28 14:07:34,013 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-28 14:07:34,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-28 14:07:34,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-28 14:07:34,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-28 14:07:34,013 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3266#true} {3266#true} #77#return; {3266#true} is VALID [2022-04-28 14:07:34,014 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-28 14:07:34,014 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-28 14:07:34,015 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-28 14:07:34,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {3358#(not (= main_~b~0 0))} assume !false; {3358#(not (= main_~b~0 0))} is VALID [2022-04-28 14:07:34,015 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-28 14:07:34,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {3266#true} ~cond := #in~cond; {3374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:07:34,016 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-28 14:07:34,016 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-28 14:07:36,020 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-28 14:07:36,020 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-28 14:07:36,021 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-28 14:07:36,021 INFO L290 TraceCheckUtils]: 40: Hoare triple {3393#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3397#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:07:36,022 INFO L290 TraceCheckUtils]: 41: Hoare triple {3397#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3267#false} is VALID [2022-04-28 14:07:36,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {3267#false} assume !false; {3267#false} is VALID [2022-04-28 14:07:36,022 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-28 14:07:36,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:08:09,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {3267#false} assume !false; {3267#false} is VALID [2022-04-28 14:08:09,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {3397#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3267#false} is VALID [2022-04-28 14:08:09,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {3393#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3397#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:08:09,906 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-28 14:08:09,907 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-28 14:08:09,909 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-28 14:08:09,910 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-28 14:08:09,910 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-28 14:08:09,911 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-28 14:08:09,911 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-28 14:08:09,911 INFO L290 TraceCheckUtils]: 32: Hoare triple {3266#true} assume !false; {3266#true} is VALID [2022-04-28 14:08:09,911 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-28 14:08:09,911 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-28 14:08:09,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {3266#true} assume !!(0 != ~a~0 && 0 != ~b~0); {3266#true} is VALID [2022-04-28 14:08:09,911 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3266#true} {3266#true} #77#return; {3266#true} is VALID [2022-04-28 14:08:09,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-28 14:08:09,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-28 14:08:09,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-28 14:08:09,912 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-28 14:08:09,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {3266#true} assume !false; {3266#true} is VALID [2022-04-28 14:08:09,912 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-28 14:08:09,912 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3266#true} {3266#true} #75#return; {3266#true} is VALID [2022-04-28 14:08:09,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-28 14:08:09,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-28 14:08:09,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-28 14:08:09,913 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-28 14:08:09,913 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3266#true} {3266#true} #73#return; {3266#true} is VALID [2022-04-28 14:08:09,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-28 14:08:09,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-28 14:08:09,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-28 14:08:09,913 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-28 14:08:09,913 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-28 14:08:09,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3266#true} {3266#true} #71#return; {3266#true} is VALID [2022-04-28 14:08:09,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-28 14:08:09,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {3266#true} assume !(0 == ~cond); {3266#true} is VALID [2022-04-28 14:08:09,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {3266#true} ~cond := #in~cond; {3266#true} is VALID [2022-04-28 14:08:09,914 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-28 14:08:09,914 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-28 14:08:09,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {3266#true} call #t~ret6 := main(); {3266#true} is VALID [2022-04-28 14:08:09,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3266#true} {3266#true} #83#return; {3266#true} is VALID [2022-04-28 14:08:09,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {3266#true} assume true; {3266#true} is VALID [2022-04-28 14:08:09,914 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-28 14:08:09,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {3266#true} call ULTIMATE.init(); {3266#true} is VALID [2022-04-28 14:08:09,915 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-28 14:08:09,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:08:09,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418693754] [2022-04-28 14:08:09,915 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:08:09,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692877783] [2022-04-28 14:08:09,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692877783] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:08:09,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:08:09,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-28 14:08:09,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:08:09,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [318485518] [2022-04-28 14:08:09,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [318485518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:08:09,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:08:09,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:08:09,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274613259] [2022-04-28 14:08:09,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:08:09,916 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-28 14:08:09,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:08:09,917 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-28 14:08:11,951 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-28 14:08:11,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:08:11,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:08:11,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:08:11,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:08:11,952 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-28 14:08:15,536 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-28 14:08:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:18,481 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-28 14:08:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:08:18,481 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-28 14:08:18,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:08:18,482 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-28 14:08:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-28 14:08:18,483 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-28 14:08:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-28 14:08:18,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2022-04-28 14:08:20,525 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-28 14:08:20,525 INFO L225 Difference]: With dead ends: 58 [2022-04-28 14:08:20,525 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 14:08:20,526 INFO L412 NwaCegarLoop]: 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-28 14:08:20,526 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 14:08:20,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 165 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 14:08:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 14:08:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-04-28 14:08:20,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:08:20,573 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-28 14:08:20,573 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-28 14:08:20,573 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-28 14:08:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:20,576 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-04-28 14:08:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-04-28 14:08:20,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:08:20,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:08:20,577 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-28 14:08:20,577 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-28 14:08:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:08:20,579 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-04-28 14:08:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-04-28 14:08:20,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:08:20,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:08:20,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:08:20,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:08:20,579 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-28 14:08:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-28 14:08:20,581 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 43 [2022-04-28 14:08:20,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:08:20,581 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-28 14:08:20,581 INFO L496 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-28 14:08:20,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-28 14:08:23,156 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-28 14:08:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 14:08:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 14:08:23,157 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:08:23,157 INFO L195 NwaCegarLoop]: 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-28 14:08:23,173 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-28 14:08:23,357 WARN L477 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-28 14:08:23,357 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:08:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:08:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1372706166, now seen corresponding path program 1 times [2022-04-28 14:08:23,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:08:23,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [440103100] [2022-04-28 14:08:23,358 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:08:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1372706166, now seen corresponding path program 2 times [2022-04-28 14:08:23,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:08:23,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155707048] [2022-04-28 14:08:23,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:08:23,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:08:23,372 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:08:23,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1942841972] [2022-04-28 14:08:23,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:08:23,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:08:23,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:08:23,373 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-28 14:08:23,394 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-28 14:08:23,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:08:23,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:08:23,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 14:08:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:08:23,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:08:33,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {3840#true} call ULTIMATE.init(); {3840#true} is VALID [2022-04-28 14:08:33,613 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-28 14:08:33,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-28 14:08:33,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3840#true} {3840#true} #83#return; {3840#true} is VALID [2022-04-28 14:08:33,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {3840#true} call #t~ret6 := main(); {3840#true} is VALID [2022-04-28 14:08:33,613 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-28 14:08:33,614 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-28 14:08:33,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-28 14:08:33,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-28 14:08:33,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-28 14:08:33,614 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3840#true} {3840#true} #71#return; {3840#true} is VALID [2022-04-28 14:08:33,614 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-28 14:08:33,614 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-28 14:08:33,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-28 14:08:33,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-28 14:08:33,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-28 14:08:33,614 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {3840#true} #73#return; {3840#true} is VALID [2022-04-28 14:08:33,614 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-28 14:08:33,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-28 14:08:33,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-28 14:08:33,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-28 14:08:33,615 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3840#true} {3840#true} #75#return; {3840#true} is VALID [2022-04-28 14:08:33,615 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-28 14:08:33,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {3840#true} assume !false; {3840#true} is VALID [2022-04-28 14:08:33,615 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-28 14:08:33,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-28 14:08:33,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-28 14:08:33,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-28 14:08:33,615 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3840#true} {3840#true} #77#return; {3840#true} is VALID [2022-04-28 14:08:33,616 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-28 14:08:33,616 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-28 14:08:33,617 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-28 14:08:33,617 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-28 14:08:33,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {3932#(not (= main_~a~0 0))} assume !false; {3932#(not (= main_~a~0 0))} is VALID [2022-04-28 14:08:33,618 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-28 14:08:33,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {3840#true} ~cond := #in~cond; {3951#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:08:33,618 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-28 14:08:33,619 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-28 14:08:35,621 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-28 14:08:35,622 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-28 14:08:35,623 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-28 14:08:35,623 INFO L290 TraceCheckUtils]: 41: Hoare triple {3970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:08:35,623 INFO L290 TraceCheckUtils]: 42: Hoare triple {3974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3841#false} is VALID [2022-04-28 14:08:35,623 INFO L290 TraceCheckUtils]: 43: Hoare triple {3841#false} assume !false; {3841#false} is VALID [2022-04-28 14:08:35,623 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-28 14:08:35,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:09:02,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {3841#false} assume !false; {3841#false} is VALID [2022-04-28 14:09:02,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {3974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3841#false} is VALID [2022-04-28 14:09:02,205 INFO L290 TraceCheckUtils]: 41: Hoare triple {3970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:09:02,206 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-28 14:09:02,206 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-28 14:09:02,208 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-28 14:09:02,208 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-28 14:09:02,208 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-28 14:09:02,209 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-28 14:09:02,209 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-28 14:09:02,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {3840#true} assume !false; {3840#true} is VALID [2022-04-28 14:09:02,209 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-28 14:09:02,209 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-28 14:09:02,209 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-28 14:09:02,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {3840#true} assume !!(0 != ~a~0 && 0 != ~b~0); {3840#true} is VALID [2022-04-28 14:09:02,209 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3840#true} {3840#true} #77#return; {3840#true} is VALID [2022-04-28 14:09:02,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-28 14:09:02,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-28 14:09:02,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-28 14:09:02,210 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-28 14:09:02,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {3840#true} assume !false; {3840#true} is VALID [2022-04-28 14:09:02,210 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-28 14:09:02,210 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3840#true} {3840#true} #75#return; {3840#true} is VALID [2022-04-28 14:09:02,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-28 14:09:02,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-28 14:09:02,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-28 14:09:02,211 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-28 14:09:02,211 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3840#true} {3840#true} #73#return; {3840#true} is VALID [2022-04-28 14:09:02,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-28 14:09:02,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-28 14:09:02,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-28 14:09:02,211 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-28 14:09:02,211 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-28 14:09:02,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3840#true} {3840#true} #71#return; {3840#true} is VALID [2022-04-28 14:09:02,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-28 14:09:02,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {3840#true} assume !(0 == ~cond); {3840#true} is VALID [2022-04-28 14:09:02,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {3840#true} ~cond := #in~cond; {3840#true} is VALID [2022-04-28 14:09:02,212 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-28 14:09:02,212 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-28 14:09:02,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {3840#true} call #t~ret6 := main(); {3840#true} is VALID [2022-04-28 14:09:02,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3840#true} {3840#true} #83#return; {3840#true} is VALID [2022-04-28 14:09:02,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {3840#true} assume true; {3840#true} is VALID [2022-04-28 14:09:02,212 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-28 14:09:02,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {3840#true} call ULTIMATE.init(); {3840#true} is VALID [2022-04-28 14:09:02,213 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-28 14:09:02,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:09:02,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155707048] [2022-04-28 14:09:02,213 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:09:02,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942841972] [2022-04-28 14:09:02,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942841972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:09:02,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:09:02,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-28 14:09:02,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:09:02,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [440103100] [2022-04-28 14:09:02,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [440103100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:09:02,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:09:02,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:09:02,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499993411] [2022-04-28 14:09:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:09:02,215 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-28 14:09:02,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:09:02,215 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-28 14:09:04,243 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-28 14:09:04,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:09:04,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:04,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:09:04,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 14:09:04,243 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-28 14:09:07,180 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-28 14:09:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:08,304 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-28 14:09:08,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:09:08,304 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-28 14:09:08,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:09:08,304 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-28 14:09:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-28 14:09:08,305 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-28 14:09:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-28 14:09:08,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2022-04-28 14:09:10,347 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-28 14:09:10,349 INFO L225 Difference]: With dead ends: 53 [2022-04-28 14:09:10,349 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 14:09:10,349 INFO L412 NwaCegarLoop]: 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-28 14:09:10,350 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 14:09:10,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 136 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 14:09:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 14:09:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2022-04-28 14:09:10,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:09:10,397 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-28 14:09:10,397 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-28 14:09:10,397 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-28 14:09:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:10,399 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-28 14:09:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-28 14:09:10,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:10,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:10,399 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-28 14:09:10,400 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-28 14:09:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:09:10,401 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-28 14:09:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-04-28 14:09:10,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:09:10,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:09:10,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:09:10,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:09:10,402 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-28 14:09:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-28 14:09:10,403 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 44 [2022-04-28 14:09:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:09:10,403 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-28 14:09:10,404 INFO L496 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-28 14:09:10,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-28 14:09:12,818 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-28 14:09:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 14:09:12,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 14:09:12,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:09:12,819 INFO L195 NwaCegarLoop]: 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-28 14:09:12,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 14:09:13,019 WARN L477 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-28 14:09:13,019 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:09:13,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:09:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1114540728, now seen corresponding path program 1 times [2022-04-28 14:09:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:13,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [903399526] [2022-04-28 14:09:13,020 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:09:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1114540728, now seen corresponding path program 2 times [2022-04-28 14:09:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:09:13,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307098522] [2022-04-28 14:09:13,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:09:13,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:09:13,035 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:09:13,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1117999151] [2022-04-28 14:09:13,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:09:13,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:09:13,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:09:13,037 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-28 14:09:13,039 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-28 14:09:13,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:09:13,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:09:13,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 14:09:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:09:13,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:09:23,648 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 14:09:24,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {4400#true} call ULTIMATE.init(); {4400#true} is VALID [2022-04-28 14:09:24,233 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-28 14:09:24,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-28 14:09:24,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4400#true} {4400#true} #83#return; {4400#true} is VALID [2022-04-28 14:09:24,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {4400#true} call #t~ret6 := main(); {4400#true} is VALID [2022-04-28 14:09:24,233 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-28 14:09:24,233 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-28 14:09:24,234 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-28 14:09:24,234 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-28 14:09:24,234 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-28 14:09:24,235 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-28 14:09:24,235 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-28 14:09:24,235 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-28 14:09:24,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {4400#true} ~cond := #in~cond; {4400#true} is VALID [2022-04-28 14:09:24,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {4400#true} assume !(0 == ~cond); {4400#true} is VALID [2022-04-28 14:09:24,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-28 14:09:24,236 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-28 14:09:24,236 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-28 14:09:24,236 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-28 14:09:24,237 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-28 14:09:24,237 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-28 14:09:24,237 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-28 14:09:24,238 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-28 14:09:24,238 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-28 14:09:24,238 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-28 14:09:24,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {4400#true} ~cond := #in~cond; {4485#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:09:24,239 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-28 14:09:24,239 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-28 14:09:24,240 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-28 14:09:24,240 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-28 14:09:24,241 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-28 14:09:24,241 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-28 14:09:24,242 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-28 14:09:24,243 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-28 14:09:24,243 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-28 14:09:24,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {4400#true} ~cond := #in~cond; {4485#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:09:24,243 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-28 14:09:24,244 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-28 14:09:26,246 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-28 14:09:26,248 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-28 14:09:26,248 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-28 14:09:26,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {4536#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4540#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:09:26,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {4540#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4401#false} is VALID [2022-04-28 14:09:26,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {4401#false} assume !false; {4401#false} is VALID [2022-04-28 14:09:26,249 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-28 14:09:26,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:09:57,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {4401#false} assume !false; {4401#false} is VALID [2022-04-28 14:09:57,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {4540#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4401#false} is VALID [2022-04-28 14:09:57,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {4536#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4540#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:09:57,057 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-28 14:09:57,057 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-28 14:09:57,059 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-28 14:09:57,059 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-28 14:09:57,075 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-28 14:09:57,076 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-28 14:09:57,076 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-28 14:09:57,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {4400#true} assume !false; {4400#true} is VALID [2022-04-28 14:09:57,076 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-28 14:09:57,076 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-28 14:09:57,076 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-28 14:09:57,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {4400#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4400#true} is VALID [2022-04-28 14:09:57,076 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4400#true} {4400#true} #77#return; {4400#true} is VALID [2022-04-28 14:09:57,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-28 14:09:57,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {4400#true} assume !(0 == ~cond); {4400#true} is VALID [2022-04-28 14:09:57,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {4400#true} ~cond := #in~cond; {4400#true} is VALID [2022-04-28 14:09:57,077 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-28 14:09:57,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {4400#true} assume !false; {4400#true} is VALID [2022-04-28 14:09:57,077 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-28 14:09:57,077 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4400#true} {4400#true} #75#return; {4400#true} is VALID [2022-04-28 14:09:57,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-28 14:09:57,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {4400#true} assume !(0 == ~cond); {4400#true} is VALID [2022-04-28 14:09:57,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {4400#true} ~cond := #in~cond; {4400#true} is VALID [2022-04-28 14:09:57,078 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-28 14:09:57,078 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4400#true} {4400#true} #73#return; {4400#true} is VALID [2022-04-28 14:09:57,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-28 14:09:57,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {4400#true} assume !(0 == ~cond); {4400#true} is VALID [2022-04-28 14:09:57,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {4400#true} ~cond := #in~cond; {4400#true} is VALID [2022-04-28 14:09:57,078 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-28 14:09:57,078 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-28 14:09:57,078 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4400#true} {4400#true} #71#return; {4400#true} is VALID [2022-04-28 14:09:57,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-28 14:09:57,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {4400#true} assume !(0 == ~cond); {4400#true} is VALID [2022-04-28 14:09:57,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {4400#true} ~cond := #in~cond; {4400#true} is VALID [2022-04-28 14:09:57,079 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-28 14:09:57,079 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-28 14:09:57,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {4400#true} call #t~ret6 := main(); {4400#true} is VALID [2022-04-28 14:09:57,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4400#true} {4400#true} #83#return; {4400#true} is VALID [2022-04-28 14:09:57,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {4400#true} assume true; {4400#true} is VALID [2022-04-28 14:09:57,079 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-28 14:09:57,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {4400#true} call ULTIMATE.init(); {4400#true} is VALID [2022-04-28 14:09:57,080 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-28 14:09:57,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:09:57,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307098522] [2022-04-28 14:09:57,080 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:09:57,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117999151] [2022-04-28 14:09:57,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117999151] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:09:57,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:09:57,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 18 [2022-04-28 14:09:57,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:09:57,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [903399526] [2022-04-28 14:09:57,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [903399526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:09:57,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:09:57,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 14:09:57,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170297357] [2022-04-28 14:09:57,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:09:57,081 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-28 14:09:57,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:09:57,082 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-28 14:09:59,115 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-28 14:09:59,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 14:09:59,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:09:59,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 14:09:59,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:09:59,116 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-28 14:10:06,651 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-28 14:10:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:10:07,183 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2022-04-28 14:10:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 14:10:07,183 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-28 14:10:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:10:07,183 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-28 14:10:07,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 59 transitions. [2022-04-28 14:10:07,185 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-28 14:10:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 59 transitions. [2022-04-28 14:10:07,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 59 transitions. [2022-04-28 14:10:09,262 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-28 14:10:09,263 INFO L225 Difference]: With dead ends: 57 [2022-04-28 14:10:09,263 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 14:10:09,264 INFO L412 NwaCegarLoop]: 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-28 14:10:09,264 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 46 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 14:10:09,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 117 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 227 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 14:10:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 14:10:09,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-04-28 14:10:09,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:10:09,346 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-28 14:10:09,346 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-28 14:10:09,346 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-28 14:10:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:10:09,347 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 14:10:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 14:10:09,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:10:09,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:10:09,348 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-28 14:10:09,348 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-28 14:10:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:10:09,349 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 14:10:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 14:10:09,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:10:09,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:10:09,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:10:09,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:10:09,350 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-28 14:10:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-04-28 14:10:09,351 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 44 [2022-04-28 14:10:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:10:09,351 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-04-28 14:10:09,352 INFO L496 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-28 14:10:09,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 52 transitions. [2022-04-28 14:10:11,921 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-28 14:10:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-28 14:10:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 14:10:11,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:10:11,922 INFO L195 NwaCegarLoop]: 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-28 14:10:11,938 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-28 14:10:12,122 WARN L477 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-28 14:10:12,123 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:10:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:10:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2079436449, now seen corresponding path program 1 times [2022-04-28 14:10:12,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:10:12,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1172113545] [2022-04-28 14:10:12,124 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:10:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2079436449, now seen corresponding path program 2 times [2022-04-28 14:10:12,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:10:12,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912537939] [2022-04-28 14:10:12,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:10:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:10:12,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:10:12,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1150696267] [2022-04-28 14:10:12,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:10:12,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:10:12,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:10:12,140 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-28 14:10:12,150 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-28 14:10:12,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:10:12,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:10:12,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 14:10:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:10:12,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:10:24,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {4999#true} call ULTIMATE.init(); {4999#true} is VALID [2022-04-28 14:10:24,036 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-28 14:10:24,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-28 14:10:24,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4999#true} {4999#true} #83#return; {4999#true} is VALID [2022-04-28 14:10:24,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {4999#true} call #t~ret6 := main(); {4999#true} is VALID [2022-04-28 14:10:24,036 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-28 14:10:24,036 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-28 14:10:24,037 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-28 14:10:24,037 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-28 14:10:24,037 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-28 14:10:24,038 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-28 14:10:24,038 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-28 14:10:24,039 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-28 14:10:24,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-28 14:10:24,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-28 14:10:24,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-28 14:10:24,039 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-28 14:10:24,039 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-28 14:10:24,040 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-28 14:10:24,040 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-28 14:10:24,040 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-28 14:10:24,041 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-28 14:10:24,041 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-28 14:10:24,041 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-28 14:10:24,042 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-28 14:10:24,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-28 14:10:24,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-28 14:10:24,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-28 14:10:24,042 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-28 14:10:24,043 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-28 14:10:24,044 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-28 14:10:24,044 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-28 14:10:24,044 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-28 14:10:24,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-28 14:10:24,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-28 14:10:24,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-28 14:10:24,045 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-28 14:10:24,046 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-28 14:10:24,046 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-28 14:10:24,047 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-28 14:10:24,048 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-28 14:10:24,048 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-28 14:10:24,048 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-28 14:10:24,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {4999#true} ~cond := #in~cond; {5141#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:10:24,049 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-28 14:10:24,049 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-28 14:10:26,052 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-28 14:10:26,053 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-28 14:10:26,054 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-28 14:10:26,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {5160#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5164#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:10:26,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {5164#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5000#false} is VALID [2022-04-28 14:10:26,067 INFO L290 TraceCheckUtils]: 51: Hoare triple {5000#false} assume !false; {5000#false} is VALID [2022-04-28 14:10:26,067 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-28 14:10:26,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:11:04,626 INFO L290 TraceCheckUtils]: 51: Hoare triple {5000#false} assume !false; {5000#false} is VALID [2022-04-28 14:11:04,626 INFO L290 TraceCheckUtils]: 50: Hoare triple {5164#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5000#false} is VALID [2022-04-28 14:11:04,627 INFO L290 TraceCheckUtils]: 49: Hoare triple {5160#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5164#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:11:04,627 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-28 14:11:04,628 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-28 14:11:04,630 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-28 14:11:04,630 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-28 14:11:04,631 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-28 14:11:04,631 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-28 14:11:04,631 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-28 14:11:04,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {4999#true} assume !false; {4999#true} is VALID [2022-04-28 14:11:04,631 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-28 14:11:04,631 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-28 14:11:04,632 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-28 14:11:04,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {4999#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4999#true} is VALID [2022-04-28 14:11:04,632 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4999#true} {4999#true} #77#return; {4999#true} is VALID [2022-04-28 14:11:04,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-28 14:11:04,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-28 14:11:04,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-28 14:11:04,632 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-28 14:11:04,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {4999#true} assume !false; {4999#true} is VALID [2022-04-28 14:11:04,632 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-28 14:11:04,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {4999#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4999#true} is VALID [2022-04-28 14:11:04,632 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4999#true} {4999#true} #77#return; {4999#true} is VALID [2022-04-28 14:11:04,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-28 14:11:04,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-28 14:11:04,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-28 14:11:04,633 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-28 14:11:04,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {4999#true} assume !false; {4999#true} is VALID [2022-04-28 14:11:04,633 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-28 14:11:04,633 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4999#true} {4999#true} #75#return; {4999#true} is VALID [2022-04-28 14:11:04,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-28 14:11:04,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-28 14:11:04,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-28 14:11:04,633 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-28 14:11:04,634 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4999#true} {4999#true} #73#return; {4999#true} is VALID [2022-04-28 14:11:04,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-28 14:11:04,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-28 14:11:04,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-28 14:11:04,634 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-28 14:11:04,634 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-28 14:11:04,634 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4999#true} {4999#true} #71#return; {4999#true} is VALID [2022-04-28 14:11:04,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-28 14:11:04,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {4999#true} assume !(0 == ~cond); {4999#true} is VALID [2022-04-28 14:11:04,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {4999#true} ~cond := #in~cond; {4999#true} is VALID [2022-04-28 14:11:04,635 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-28 14:11:04,635 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-28 14:11:04,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {4999#true} call #t~ret6 := main(); {4999#true} is VALID [2022-04-28 14:11:04,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4999#true} {4999#true} #83#return; {4999#true} is VALID [2022-04-28 14:11:04,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {4999#true} assume true; {4999#true} is VALID [2022-04-28 14:11:04,635 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-28 14:11:04,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {4999#true} call ULTIMATE.init(); {4999#true} is VALID [2022-04-28 14:11:04,635 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-28 14:11:04,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:11:04,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912537939] [2022-04-28 14:11:04,636 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:11:04,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150696267] [2022-04-28 14:11:04,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150696267] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:11:04,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:11:04,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 19 [2022-04-28 14:11:04,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:11:04,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1172113545] [2022-04-28 14:11:04,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1172113545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:11:04,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:11:04,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 14:11:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634184831] [2022-04-28 14:11:04,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:11:04,637 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-28 14:11:04,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:11:04,638 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-28 14:11:06,679 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-28 14:11:06,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 14:11:06,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:11:06,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 14:11:06,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:11:06,680 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-28 14:11:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:10,596 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2022-04-28 14:11:10,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 14:11:10,596 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-28 14:11:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:11:10,596 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-28 14:11:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 69 transitions. [2022-04-28 14:11:10,598 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-28 14:11:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 69 transitions. [2022-04-28 14:11:10,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 69 transitions. [2022-04-28 14:11:14,670 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-28 14:11:14,671 INFO L225 Difference]: With dead ends: 63 [2022-04-28 14:11:14,671 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 14:11:14,672 INFO L412 NwaCegarLoop]: 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-28 14:11:14,672 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 14:11:14,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 120 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 14:11:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 14:11:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2022-04-28 14:11:14,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:11:14,827 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-28 14:11:14,827 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-28 14:11:14,827 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-28 14:11:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:14,828 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-28 14:11:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-28 14:11:14,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:14,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:14,829 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-28 14:11:14,829 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-28 14:11:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:14,831 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-28 14:11:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-28 14:11:14,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:14,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:14,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:11:14,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:11:14,832 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-28 14:11:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-28 14:11:14,833 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 52 [2022-04-28 14:11:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:11:14,833 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-28 14:11:14,833 INFO L496 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-28 14:11:14,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-28 14:11:19,472 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-28 14:11:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-28 14:11:19,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 14:11:19,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:11:19,472 INFO L195 NwaCegarLoop]: 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-28 14:11:19,488 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-28 14:11:19,673 WARN L477 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-28 14:11:19,673 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:11:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:11:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1287237523, now seen corresponding path program 1 times [2022-04-28 14:11:19,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:11:19,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461441684] [2022-04-28 14:11:19,674 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:11:19,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1287237523, now seen corresponding path program 2 times [2022-04-28 14:11:19,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:11:19,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471405966] [2022-04-28 14:11:19,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:11:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:11:19,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:11:19,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [9453448] [2022-04-28 14:11:19,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:11:19,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:11:19,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:11:19,689 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-28 14:11:19,703 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-28 14:11:19,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:11:19,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:11:19,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 14:11:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:11:19,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:11:20,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {5675#true} call ULTIMATE.init(); {5675#true} is VALID [2022-04-28 14:11:20,736 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-28 14:11:20,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-28 14:11:20,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5675#true} {5675#true} #83#return; {5675#true} is VALID [2022-04-28 14:11:20,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {5675#true} call #t~ret6 := main(); {5675#true} is VALID [2022-04-28 14:11:20,736 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-28 14:11:20,736 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-28 14:11:20,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-28 14:11:20,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-28 14:11:20,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-28 14:11:20,737 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5675#true} {5675#true} #71#return; {5675#true} is VALID [2022-04-28 14:11:20,737 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-28 14:11:20,737 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-28 14:11:20,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-28 14:11:20,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-28 14:11:20,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-28 14:11:20,737 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5675#true} {5675#true} #73#return; {5675#true} is VALID [2022-04-28 14:11:20,737 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-28 14:11:20,738 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-28 14:11:20,738 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-28 14:11:20,738 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-28 14:11:20,739 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-28 14:11:20,739 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-28 14:11:20,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {5749#(<= 1 main_~b~0)} assume !false; {5749#(<= 1 main_~b~0)} is VALID [2022-04-28 14:11:20,739 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-28 14:11:20,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-28 14:11:20,740 INFO L290 TraceCheckUtils]: 26: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-28 14:11:20,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-28 14:11:20,744 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5675#true} {5749#(<= 1 main_~b~0)} #77#return; {5749#(<= 1 main_~b~0)} is VALID [2022-04-28 14:11:20,744 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-28 14:11:20,745 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-28 14:11:20,746 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-28 14:11:20,747 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-28 14:11:20,747 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-28 14:11:20,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-28 14:11:20,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-28 14:11:20,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-28 14:11:20,748 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-28 14:11:20,748 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-28 14:11:20,749 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-28 14:11:20,750 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-28 14:11:20,750 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-28 14:11:20,751 INFO L290 TraceCheckUtils]: 42: Hoare triple {5676#false} assume !false; {5676#false} is VALID [2022-04-28 14:11:20,751 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-28 14:11:20,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {5676#false} ~cond := #in~cond; {5676#false} is VALID [2022-04-28 14:11:20,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {5676#false} assume !(0 == ~cond); {5676#false} is VALID [2022-04-28 14:11:20,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {5676#false} assume true; {5676#false} is VALID [2022-04-28 14:11:20,751 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5676#false} {5676#false} #77#return; {5676#false} is VALID [2022-04-28 14:11:20,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {5676#false} assume !(0 != ~a~0 && 0 != ~b~0); {5676#false} is VALID [2022-04-28 14:11:20,751 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-28 14:11:20,751 INFO L290 TraceCheckUtils]: 50: Hoare triple {5676#false} ~cond := #in~cond; {5676#false} is VALID [2022-04-28 14:11:20,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {5676#false} assume 0 == ~cond; {5676#false} is VALID [2022-04-28 14:11:20,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {5676#false} assume !false; {5676#false} is VALID [2022-04-28 14:11:20,752 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-28 14:11:20,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:11:21,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {5676#false} assume !false; {5676#false} is VALID [2022-04-28 14:11:21,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {5676#false} assume 0 == ~cond; {5676#false} is VALID [2022-04-28 14:11:21,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {5676#false} ~cond := #in~cond; {5676#false} is VALID [2022-04-28 14:11:21,769 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-28 14:11:21,769 INFO L290 TraceCheckUtils]: 48: Hoare triple {5676#false} assume !(0 != ~a~0 && 0 != ~b~0); {5676#false} is VALID [2022-04-28 14:11:21,769 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5675#true} {5676#false} #77#return; {5676#false} is VALID [2022-04-28 14:11:21,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-28 14:11:21,769 INFO L290 TraceCheckUtils]: 45: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-28 14:11:21,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-28 14:11:21,770 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-28 14:11:21,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {5676#false} assume !false; {5676#false} is VALID [2022-04-28 14:11:21,770 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-28 14:11:21,770 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-28 14:11:21,771 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-28 14:11:21,772 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-28 14:11:21,772 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-28 14:11:21,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-28 14:11:21,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-28 14:11:21,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-28 14:11:21,773 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-28 14:11:21,773 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-28 14:11:21,774 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-28 14:11:21,775 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-28 14:11:21,775 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-28 14:11:21,776 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-28 14:11:21,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-28 14:11:21,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-28 14:11:21,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-28 14:11:21,794 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-28 14:11:21,795 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-28 14:11:21,796 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-28 14:11:21,796 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-28 14:11:21,797 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-28 14:11:21,797 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-28 14:11:21,797 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-28 14:11:21,797 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-28 14:11:21,798 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5675#true} {5675#true} #73#return; {5675#true} is VALID [2022-04-28 14:11:21,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-28 14:11:21,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-28 14:11:21,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-28 14:11:21,798 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-28 14:11:21,798 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-28 14:11:21,798 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5675#true} {5675#true} #71#return; {5675#true} is VALID [2022-04-28 14:11:21,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-28 14:11:21,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {5675#true} assume !(0 == ~cond); {5675#true} is VALID [2022-04-28 14:11:21,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {5675#true} ~cond := #in~cond; {5675#true} is VALID [2022-04-28 14:11:21,799 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-28 14:11:21,799 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-28 14:11:21,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {5675#true} call #t~ret6 := main(); {5675#true} is VALID [2022-04-28 14:11:21,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5675#true} {5675#true} #83#return; {5675#true} is VALID [2022-04-28 14:11:21,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {5675#true} assume true; {5675#true} is VALID [2022-04-28 14:11:21,799 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-28 14:11:21,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {5675#true} call ULTIMATE.init(); {5675#true} is VALID [2022-04-28 14:11:21,799 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-28 14:11:21,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:11:21,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471405966] [2022-04-28 14:11:21,800 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:11:21,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9453448] [2022-04-28 14:11:21,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9453448] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:11:21,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:11:21,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2022-04-28 14:11:21,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:11:21,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [461441684] [2022-04-28 14:11:21,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [461441684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:11:21,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:11:21,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:11:21,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439854674] [2022-04-28 14:11:21,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:11:21,801 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-28 14:11:21,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:11:21,802 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-28 14:11:21,834 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-28 14:11:21,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:11:21,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:11:21,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:11:21,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-28 14:11:21,835 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-28 14:11:22,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:22,472 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2022-04-28 14:11:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 14:11:22,472 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-28 14:11:22,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:11:22,472 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-28 14:11:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-28 14:11:22,473 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-28 14:11:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-28 14:11:22,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-28 14:11:22,557 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-28 14:11:22,558 INFO L225 Difference]: With dead ends: 72 [2022-04-28 14:11:22,558 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 14:11:22,558 INFO L412 NwaCegarLoop]: 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-28 14:11:22,559 INFO L413 NwaCegarLoop]: 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-28 14:11:22,559 INFO L414 NwaCegarLoop]: 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-28 14:11:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 14:11:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-04-28 14:11:22,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:11:22,735 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-28 14:11:22,736 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-28 14:11:22,736 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-28 14:11:22,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:22,737 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-04-28 14:11:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-28 14:11:22,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:22,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:22,738 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-28 14:11:22,738 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-28 14:11:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:22,740 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-04-28 14:11:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-28 14:11:22,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:22,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:22,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:11:22,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:11:22,740 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-28 14:11:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2022-04-28 14:11:22,742 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 53 [2022-04-28 14:11:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:11:22,742 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2022-04-28 14:11:22,742 INFO L496 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-28 14:11:22,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 65 transitions. [2022-04-28 14:11:29,899 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-28 14:11:29,899 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-04-28 14:11:29,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 14:11:29,899 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:11:29,899 INFO L195 NwaCegarLoop]: 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-28 14:11:29,917 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-28 14:11:30,103 WARN L477 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-28 14:11:30,103 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:11:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:11:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash 338559610, now seen corresponding path program 3 times [2022-04-28 14:11:30,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:11:30,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513167046] [2022-04-28 14:11:30,104 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:11:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash 338559610, now seen corresponding path program 4 times [2022-04-28 14:11:30,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:11:30,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602851125] [2022-04-28 14:11:30,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:11:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:11:30,120 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:11:30,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [176474496] [2022-04-28 14:11:30,120 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:11:30,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:11:30,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:11:30,121 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-28 14:11:30,135 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-28 14:11:30,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:11:30,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:11:30,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 14:11:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:11:30,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:11:31,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {6371#true} call ULTIMATE.init(); {6371#true} is VALID [2022-04-28 14:11:31,063 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-28 14:11:31,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-28 14:11:31,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6371#true} {6371#true} #83#return; {6371#true} is VALID [2022-04-28 14:11:31,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {6371#true} call #t~ret6 := main(); {6371#true} is VALID [2022-04-28 14:11:31,063 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-28 14:11:31,063 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-28 14:11:31,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-28 14:11:31,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-28 14:11:31,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-28 14:11:31,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6371#true} {6371#true} #71#return; {6371#true} is VALID [2022-04-28 14:11:31,063 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-28 14:11:31,064 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-28 14:11:31,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-28 14:11:31,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-28 14:11:31,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-28 14:11:31,064 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6371#true} {6371#true} #73#return; {6371#true} is VALID [2022-04-28 14:11:31,064 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-28 14:11:31,064 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-28 14:11:31,065 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-28 14:11:31,065 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-28 14:11:31,065 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-28 14:11:31,066 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-28 14:11:31,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {6445#(<= 1 main_~b~0)} assume !false; {6445#(<= 1 main_~b~0)} is VALID [2022-04-28 14:11:31,067 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-28 14:11:31,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-28 14:11:31,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-28 14:11:31,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-28 14:11:31,068 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6371#true} {6445#(<= 1 main_~b~0)} #77#return; {6445#(<= 1 main_~b~0)} is VALID [2022-04-28 14:11:31,069 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-28 14:11:31,069 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-28 14:11:31,070 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-28 14:11:31,071 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-28 14:11:31,071 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-28 14:11:31,071 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-28 14:11:31,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-28 14:11:31,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-28 14:11:31,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-28 14:11:31,072 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-28 14:11:31,073 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-28 14:11:31,073 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-28 14:11:31,074 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-28 14:11:31,075 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-28 14:11:31,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {6372#false} assume !false; {6372#false} is VALID [2022-04-28 14:11:31,075 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-28 14:11:31,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {6372#false} ~cond := #in~cond; {6372#false} is VALID [2022-04-28 14:11:31,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {6372#false} assume !(0 == ~cond); {6372#false} is VALID [2022-04-28 14:11:31,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {6372#false} assume true; {6372#false} is VALID [2022-04-28 14:11:31,075 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6372#false} {6372#false} #77#return; {6372#false} is VALID [2022-04-28 14:11:31,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {6372#false} assume !(0 != ~a~0 && 0 != ~b~0); {6372#false} is VALID [2022-04-28 14:11:31,075 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-28 14:11:31,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {6372#false} ~cond := #in~cond; {6372#false} is VALID [2022-04-28 14:11:31,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {6372#false} assume 0 == ~cond; {6372#false} is VALID [2022-04-28 14:11:31,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {6372#false} assume !false; {6372#false} is VALID [2022-04-28 14:11:31,076 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-28 14:11:31,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:11:31,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {6372#false} assume !false; {6372#false} is VALID [2022-04-28 14:11:31,654 INFO L290 TraceCheckUtils]: 52: Hoare triple {6372#false} assume 0 == ~cond; {6372#false} is VALID [2022-04-28 14:11:31,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {6372#false} ~cond := #in~cond; {6372#false} is VALID [2022-04-28 14:11:31,654 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-28 14:11:31,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {6372#false} assume !(0 != ~a~0 && 0 != ~b~0); {6372#false} is VALID [2022-04-28 14:11:31,654 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6371#true} {6372#false} #77#return; {6372#false} is VALID [2022-04-28 14:11:31,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-28 14:11:31,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-28 14:11:31,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-28 14:11:31,655 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-28 14:11:31,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {6372#false} assume !false; {6372#false} is VALID [2022-04-28 14:11:31,656 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-28 14:11:31,656 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-28 14:11:31,657 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-28 14:11:31,658 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-28 14:11:31,658 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-28 14:11:31,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-28 14:11:31,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-28 14:11:31,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-28 14:11:31,659 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-28 14:11:31,659 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-28 14:11:31,660 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-28 14:11:31,661 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-28 14:11:31,662 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-28 14:11:31,662 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-28 14:11:31,662 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-28 14:11:31,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-28 14:11:31,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-28 14:11:31,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-28 14:11:31,663 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-28 14:11:31,663 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-28 14:11:31,664 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-28 14:11:31,664 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-28 14:11:31,664 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-28 14:11:31,665 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-28 14:11:31,665 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-28 14:11:31,665 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-28 14:11:31,665 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6371#true} {6371#true} #73#return; {6371#true} is VALID [2022-04-28 14:11:31,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-28 14:11:31,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-28 14:11:31,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-28 14:11:31,665 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-28 14:11:31,665 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-28 14:11:31,666 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6371#true} {6371#true} #71#return; {6371#true} is VALID [2022-04-28 14:11:31,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-28 14:11:31,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {6371#true} assume !(0 == ~cond); {6371#true} is VALID [2022-04-28 14:11:31,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {6371#true} ~cond := #in~cond; {6371#true} is VALID [2022-04-28 14:11:31,666 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-28 14:11:31,666 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-28 14:11:31,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {6371#true} call #t~ret6 := main(); {6371#true} is VALID [2022-04-28 14:11:31,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6371#true} {6371#true} #83#return; {6371#true} is VALID [2022-04-28 14:11:31,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {6371#true} assume true; {6371#true} is VALID [2022-04-28 14:11:31,666 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-28 14:11:31,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {6371#true} call ULTIMATE.init(); {6371#true} is VALID [2022-04-28 14:11:31,666 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-28 14:11:31,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:11:31,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602851125] [2022-04-28 14:11:31,667 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:11:31,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176474496] [2022-04-28 14:11:31,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176474496] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:11:31,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:11:31,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2022-04-28 14:11:31,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:11:31,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513167046] [2022-04-28 14:11:31,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513167046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:11:31,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:11:31,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 14:11:31,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737937371] [2022-04-28 14:11:31,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:11:31,668 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-28 14:11:31,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:11:31,668 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-28 14:11:31,701 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-28 14:11:31,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 14:11:31,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:11:31,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 14:11:31,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-28 14:11:31,701 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-28 14:11:32,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:32,493 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2022-04-28 14:11:32,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 14:11:32,493 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-28 14:11:32,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:11:32,493 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-28 14:11:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 14:11:32,495 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-28 14:11:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 14:11:32,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-04-28 14:11:32,546 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-28 14:11:32,547 INFO L225 Difference]: With dead ends: 84 [2022-04-28 14:11:32,547 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 14:11:32,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-04-28 14:11:32,548 INFO L413 NwaCegarLoop]: 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-28 14:11:32,548 INFO L414 NwaCegarLoop]: 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-28 14:11:32,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 14:11:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-04-28 14:11:32,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:11:32,736 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-28 14:11:32,737 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-28 14:11:32,737 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-28 14:11:32,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:32,738 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-04-28 14:11:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-04-28 14:11:32,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:32,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:32,739 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-28 14:11:32,739 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-28 14:11:32,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:11:32,741 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-04-28 14:11:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-04-28 14:11:32,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:11:32,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:11:32,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:11:32,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:11:32,742 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-28 14:11:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-04-28 14:11:32,743 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 54 [2022-04-28 14:11:32,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:11:32,743 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2022-04-28 14:11:32,743 INFO L496 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-28 14:11:32,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 71 transitions. [2022-04-28 14:11:41,465 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-28 14:11:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2022-04-28 14:11:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 14:11:41,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:11:41,466 INFO L195 NwaCegarLoop]: 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-28 14:11:41,482 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-28 14:11:41,667 WARN L477 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-28 14:11:41,667 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:11:41,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:11:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1563197702, now seen corresponding path program 3 times [2022-04-28 14:11:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:11:41,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1177467205] [2022-04-28 14:11:41,668 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:11:41,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1563197702, now seen corresponding path program 4 times [2022-04-28 14:11:41,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:11:41,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268198100] [2022-04-28 14:11:41,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:11:41,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:11:41,681 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:11:41,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568075463] [2022-04-28 14:11:41,681 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 14:11:41,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:11:41,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:11:41,682 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-28 14:11:41,702 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-28 14:11:41,731 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 14:11:41,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:11:41,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 14:11:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:11:41,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:11:52,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {7121#true} call ULTIMATE.init(); {7121#true} is VALID [2022-04-28 14:11:52,920 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-28 14:11:52,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-28 14:11:52,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7121#true} {7121#true} #83#return; {7121#true} is VALID [2022-04-28 14:11:52,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {7121#true} call #t~ret6 := main(); {7121#true} is VALID [2022-04-28 14:11:52,920 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-28 14:11:52,920 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-28 14:11:52,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-28 14:11:52,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-28 14:11:52,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-28 14:11:52,920 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7121#true} {7121#true} #71#return; {7121#true} is VALID [2022-04-28 14:11:52,920 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-28 14:11:52,920 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-28 14:11:52,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-28 14:11:52,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-28 14:11:52,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-28 14:11:52,921 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7121#true} {7121#true} #73#return; {7121#true} is VALID [2022-04-28 14:11:52,921 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-28 14:11:52,921 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-28 14:11:52,921 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-28 14:11:52,922 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-28 14:11:52,922 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-28 14:11:52,922 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-28 14:11:52,923 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-28 14:11:52,923 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-28 14:11:52,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-28 14:11:52,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-28 14:11:52,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-28 14:11:52,924 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-28 14:11:52,924 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-28 14:11:52,925 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-28 14:11:52,925 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-28 14:11:52,925 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-28 14:11:52,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {7121#true} ~cond := #in~cond; {7230#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:11:52,926 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-28 14:11:52,926 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-28 14:11:52,927 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-28 14:11:52,927 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-28 14:11:52,928 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-28 14:11:52,929 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-28 14:11:52,929 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-28 14:11:52,929 INFO L290 TraceCheckUtils]: 41: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-28 14:11:52,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-28 14:11:52,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-28 14:11:52,929 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-28 14:11:52,930 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-28 14:11:52,930 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-28 14:11:52,931 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-28 14:11:52,932 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-28 14:11:52,932 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-28 14:11:52,932 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-28 14:11:52,932 INFO L290 TraceCheckUtils]: 51: Hoare triple {7121#true} ~cond := #in~cond; {7230#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:11:52,933 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-28 14:11:52,933 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-28 14:11:54,935 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-28 14:11:54,936 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-28 14:11:54,937 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-28 14:11:54,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {7305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:11:54,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {7309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7122#false} is VALID [2022-04-28 14:11:54,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {7122#false} assume !false; {7122#false} is VALID [2022-04-28 14:11:54,938 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-28 14:11:54,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:12:23,772 INFO L290 TraceCheckUtils]: 59: Hoare triple {7122#false} assume !false; {7122#false} is VALID [2022-04-28 14:12:23,773 INFO L290 TraceCheckUtils]: 58: Hoare triple {7309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7122#false} is VALID [2022-04-28 14:12:23,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {7305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:12:23,774 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-28 14:12:23,774 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-28 14:12:23,776 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-28 14:12:23,776 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-28 14:12:23,776 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-28 14:12:23,777 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-28 14:12:23,777 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-28 14:12:23,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {7121#true} assume !false; {7121#true} is VALID [2022-04-28 14:12:23,777 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-28 14:12:23,777 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-28 14:12:23,777 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-28 14:12:23,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {7121#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7121#true} is VALID [2022-04-28 14:12:23,777 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7121#true} {7121#true} #77#return; {7121#true} is VALID [2022-04-28 14:12:23,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-28 14:12:23,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-28 14:12:23,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-28 14:12:23,777 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-28 14:12:23,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {7121#true} assume !false; {7121#true} is VALID [2022-04-28 14:12:23,778 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-28 14:12:23,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {7121#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7121#true} is VALID [2022-04-28 14:12:23,778 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7121#true} {7121#true} #77#return; {7121#true} is VALID [2022-04-28 14:12:23,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-28 14:12:23,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-28 14:12:23,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-28 14:12:23,778 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-28 14:12:23,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {7121#true} assume !false; {7121#true} is VALID [2022-04-28 14:12:23,778 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-28 14:12:23,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {7121#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7121#true} is VALID [2022-04-28 14:12:23,778 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7121#true} {7121#true} #77#return; {7121#true} is VALID [2022-04-28 14:12:23,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-28 14:12:23,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-28 14:12:23,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-28 14:12:23,779 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-28 14:12:23,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {7121#true} assume !false; {7121#true} is VALID [2022-04-28 14:12:23,779 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-28 14:12:23,779 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7121#true} {7121#true} #75#return; {7121#true} is VALID [2022-04-28 14:12:23,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-28 14:12:23,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-28 14:12:23,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-28 14:12:23,779 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-28 14:12:23,779 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7121#true} {7121#true} #73#return; {7121#true} is VALID [2022-04-28 14:12:23,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-28 14:12:23,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-28 14:12:23,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-28 14:12:23,779 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-28 14:12:23,780 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-28 14:12:23,780 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7121#true} {7121#true} #71#return; {7121#true} is VALID [2022-04-28 14:12:23,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-28 14:12:23,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {7121#true} assume !(0 == ~cond); {7121#true} is VALID [2022-04-28 14:12:23,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {7121#true} ~cond := #in~cond; {7121#true} is VALID [2022-04-28 14:12:23,780 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-28 14:12:23,780 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-28 14:12:23,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {7121#true} call #t~ret6 := main(); {7121#true} is VALID [2022-04-28 14:12:23,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7121#true} {7121#true} #83#return; {7121#true} is VALID [2022-04-28 14:12:23,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {7121#true} assume true; {7121#true} is VALID [2022-04-28 14:12:23,780 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-28 14:12:23,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {7121#true} call ULTIMATE.init(); {7121#true} is VALID [2022-04-28 14:12:23,780 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-28 14:12:23,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:12:23,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268198100] [2022-04-28 14:12:23,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:12:23,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568075463] [2022-04-28 14:12:23,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568075463] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:12:23,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:12:23,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 18 [2022-04-28 14:12:23,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:12:23,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1177467205] [2022-04-28 14:12:23,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1177467205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:12:23,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:12:23,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 14:12:23,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949498487] [2022-04-28 14:12:23,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:12:23,782 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-28 14:12:23,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:12:23,782 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-28 14:12:25,823 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-28 14:12:25,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 14:12:25,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:12:25,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 14:12:25,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-28 14:12:25,824 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-28 14:12:29,209 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-28 14:12:34,907 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-28 14:12:37,908 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-28 14:12:41,768 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-28 14:12:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:12:42,267 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2022-04-28 14:12:42,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 14:12:42,268 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-28 14:12:42,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:12:42,268 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-28 14:12:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-28 14:12:42,269 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-28 14:12:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2022-04-28 14:12:42,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 80 transitions. [2022-04-28 14:12:50,365 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-28 14:12:50,367 INFO L225 Difference]: With dead ends: 98 [2022-04-28 14:12:50,367 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 14:12:50,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2022-04-28 14:12:50,368 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 37 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 24 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-04-28 14:12:50,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 134 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 256 Invalid, 4 Unknown, 0 Unchecked, 10.9s Time] [2022-04-28 14:12:50,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 14:12:50,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2022-04-28 14:12:50,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:12:50,677 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-28 14:12:50,677 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-28 14:12:50,678 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-28 14:12:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:12:50,680 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-28 14:12:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-28 14:12:50,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:12:50,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:12:50,681 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-28 14:12:50,681 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-28 14:12:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:12:50,683 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-28 14:12:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-28 14:12:50,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:12:50,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:12:50,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:12:50,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:12:50,684 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-28 14:12:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2022-04-28 14:12:50,686 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 60 [2022-04-28 14:12:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:12:50,686 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2022-04-28 14:12:50,686 INFO L496 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-28 14:12:50,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 91 transitions. [2022-04-28 14:13:05,652 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-28 14:13:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-04-28 14:13:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 14:13:05,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:13:05,653 INFO L195 NwaCegarLoop]: 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-28 14:13:05,669 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-28 14:13:05,853 WARN L477 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-28 14:13:05,853 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:13:05,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:13:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 464884373, now seen corresponding path program 1 times [2022-04-28 14:13:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:13:05,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2033382888] [2022-04-28 14:13:05,854 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:13:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 464884373, now seen corresponding path program 2 times [2022-04-28 14:13:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:13:05,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972942917] [2022-04-28 14:13:05,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:13:05,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:13:05,874 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:13:05,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1749409232] [2022-04-28 14:13:05,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:13:05,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:13:05,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:13:05,876 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-28 14:13:05,879 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-28 14:13:05,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:13:05,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:13:05,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 14:13:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:13:05,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:13:17,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {8036#true} call ULTIMATE.init(); {8036#true} is VALID [2022-04-28 14:13:17,860 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-28 14:13:17,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-28 14:13:17,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8036#true} #83#return; {8036#true} is VALID [2022-04-28 14:13:17,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {8036#true} call #t~ret6 := main(); {8036#true} is VALID [2022-04-28 14:13:17,860 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-28 14:13:17,861 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-28 14:13:17,861 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-28 14:13:17,861 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-28 14:13:17,862 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-28 14:13:17,862 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-28 14:13:17,863 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-28 14:13:17,863 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-28 14:13:17,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-28 14:13:17,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-28 14:13:17,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-28 14:13:17,864 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-28 14:13:17,864 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-28 14:13:17,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-28 14:13:17,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-28 14:13:17,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-28 14:13:17,865 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-28 14:13:17,865 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-28 14:13:17,865 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-28 14:13:17,865 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-28 14:13:17,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-28 14:13:17,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-28 14:13:17,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-28 14:13:17,866 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-28 14:13:17,866 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-28 14:13:17,867 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-28 14:13:17,867 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-28 14:13:17,868 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-28 14:13:17,869 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-28 14:13:17,869 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-28 14:13:17,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-28 14:13:17,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-28 14:13:17,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-28 14:13:17,870 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-28 14:13:17,870 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-28 14:13:17,871 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-28 14:13:17,872 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-28 14:13:17,872 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-28 14:13:17,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-28 14:13:17,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-28 14:13:17,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-28 14:13:17,872 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-28 14:13:17,873 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-28 14:13:17,873 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-28 14:13:17,874 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-28 14:13:17,875 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-28 14:13:17,875 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-28 14:13:17,875 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-28 14:13:17,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {8036#true} ~cond := #in~cond; {8209#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:13:17,876 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-28 14:13:17,876 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-28 14:13:19,879 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-28 14:13:19,881 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-28 14:13:19,882 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-28 14:13:19,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {8228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:13:19,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {8232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8037#false} is VALID [2022-04-28 14:13:19,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {8037#false} assume !false; {8037#false} is VALID [2022-04-28 14:13:19,883 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-28 14:13:19,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:13:53,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {8037#false} assume !false; {8037#false} is VALID [2022-04-28 14:13:53,117 INFO L290 TraceCheckUtils]: 60: Hoare triple {8232#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8037#false} is VALID [2022-04-28 14:13:53,117 INFO L290 TraceCheckUtils]: 59: Hoare triple {8228#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8232#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:13:53,118 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-28 14:13:53,119 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-28 14:13:53,120 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-28 14:13:53,121 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-28 14:13:53,121 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-28 14:13:53,121 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-28 14:13:53,122 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-28 14:13:53,122 INFO L290 TraceCheckUtils]: 51: Hoare triple {8036#true} assume !false; {8036#true} is VALID [2022-04-28 14:13:53,122 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-28 14:13:53,122 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-28 14:13:53,122 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-28 14:13:53,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {8036#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8036#true} is VALID [2022-04-28 14:13:53,122 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8036#true} {8036#true} #77#return; {8036#true} is VALID [2022-04-28 14:13:53,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-28 14:13:53,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-28 14:13:53,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-28 14:13:53,122 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-28 14:13:53,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {8036#true} assume !false; {8036#true} is VALID [2022-04-28 14:13:53,122 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-28 14:13:53,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {8036#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8036#true} is VALID [2022-04-28 14:13:53,123 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8036#true} {8036#true} #77#return; {8036#true} is VALID [2022-04-28 14:13:53,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-28 14:13:53,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-28 14:13:53,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-28 14:13:53,123 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-28 14:13:53,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {8036#true} assume !false; {8036#true} is VALID [2022-04-28 14:13:53,123 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-28 14:13:53,123 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-28 14:13:53,123 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-28 14:13:53,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {8036#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8036#true} is VALID [2022-04-28 14:13:53,123 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8036#true} {8036#true} #77#return; {8036#true} is VALID [2022-04-28 14:13:53,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-28 14:13:53,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-28 14:13:53,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-28 14:13:53,124 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-28 14:13:53,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {8036#true} assume !false; {8036#true} is VALID [2022-04-28 14:13:53,124 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-28 14:13:53,124 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8036#true} {8036#true} #75#return; {8036#true} is VALID [2022-04-28 14:13:53,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-28 14:13:53,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-28 14:13:53,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-28 14:13:53,124 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-28 14:13:53,124 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8036#true} {8036#true} #73#return; {8036#true} is VALID [2022-04-28 14:13:53,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-28 14:13:53,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-28 14:13:53,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-28 14:13:53,125 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-28 14:13:53,125 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-28 14:13:53,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8036#true} {8036#true} #71#return; {8036#true} is VALID [2022-04-28 14:13:53,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-28 14:13:53,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {8036#true} assume !(0 == ~cond); {8036#true} is VALID [2022-04-28 14:13:53,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {8036#true} ~cond := #in~cond; {8036#true} is VALID [2022-04-28 14:13:53,125 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-28 14:13:53,126 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-28 14:13:53,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {8036#true} call #t~ret6 := main(); {8036#true} is VALID [2022-04-28 14:13:53,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8036#true} {8036#true} #83#return; {8036#true} is VALID [2022-04-28 14:13:53,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {8036#true} assume true; {8036#true} is VALID [2022-04-28 14:13:53,126 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-28 14:13:53,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {8036#true} call ULTIMATE.init(); {8036#true} is VALID [2022-04-28 14:13:53,126 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-28 14:13:53,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:13:53,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972942917] [2022-04-28 14:13:53,127 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:13:53,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749409232] [2022-04-28 14:13:53,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749409232] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:13:53,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:13:53,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 20 [2022-04-28 14:13:53,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:13:53,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2033382888] [2022-04-28 14:13:53,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2033382888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:13:53,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:13:53,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 14:13:53,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799383034] [2022-04-28 14:13:53,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:13:53,128 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-28 14:13:53,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:13:53,128 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-28 14:13:55,173 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-28 14:13:55,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 14:13:55,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:13:55,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 14:13:55,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-04-28 14:13:55,174 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-28 14:13:58,725 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-28 14:14:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:14:00,426 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2022-04-28 14:14:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 14:14:00,426 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-28 14:14:00,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:14:00,427 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-28 14:14:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2022-04-28 14:14:00,428 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-28 14:14:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2022-04-28 14:14:00,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 72 transitions. [2022-04-28 14:14:06,505 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-28 14:14:06,507 INFO L225 Difference]: With dead ends: 97 [2022-04-28 14:14:06,507 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 14:14:06,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-04-28 14:14:06,508 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:14:06,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 136 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 338 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-04-28 14:14:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 14:14:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2022-04-28 14:14:06,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:14:06,834 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-28 14:14:06,834 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-28 14:14:06,834 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-28 14:14:06,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:14:06,836 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2022-04-28 14:14:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2022-04-28 14:14:06,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:14:06,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:14:06,837 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-28 14:14:06,837 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-28 14:14:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:14:06,840 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2022-04-28 14:14:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2022-04-28 14:14:06,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:14:06,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:14:06,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:14:06,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:14:06,840 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-28 14:14:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2022-04-28 14:14:06,842 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 62 [2022-04-28 14:14:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:14:06,842 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2022-04-28 14:14:06,843 INFO L496 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-28 14:14:06,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 93 transitions. [2022-04-28 14:14:22,050 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-28 14:14:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2022-04-28 14:14:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 14:14:22,051 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:14:22,051 INFO L195 NwaCegarLoop]: 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-28 14:14:22,070 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-28 14:14:22,260 WARN L477 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-28 14:14:22,261 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:14:22,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:14:22,261 INFO L85 PathProgramCache]: Analyzing trace with hash 487516627, now seen corresponding path program 5 times [2022-04-28 14:14:22,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:14:22,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [382341390] [2022-04-28 14:14:22,262 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:14:22,262 INFO L85 PathProgramCache]: Analyzing trace with hash 487516627, now seen corresponding path program 6 times [2022-04-28 14:14:22,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:14:22,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194226038] [2022-04-28 14:14:22,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:14:22,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:14:22,274 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:14:22,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592178045] [2022-04-28 14:14:22,274 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 14:14:22,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:14:22,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:14:22,276 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-28 14:14:22,276 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-28 14:14:22,324 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 14:14:22,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:14:22,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 14:14:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:14:22,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:14:32,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {8963#true} call ULTIMATE.init(); {8963#true} is VALID [2022-04-28 14:14:32,556 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-28 14:14:32,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:14:32,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8963#true} {8963#true} #83#return; {8963#true} is VALID [2022-04-28 14:14:32,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {8963#true} call #t~ret6 := main(); {8963#true} is VALID [2022-04-28 14:14:32,556 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-28 14:14:32,557 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-28 14:14:32,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-28 14:14:32,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-28 14:14:32,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:14:32,557 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8963#true} {8963#true} #71#return; {8963#true} is VALID [2022-04-28 14:14:32,557 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-28 14:14:32,557 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-28 14:14:32,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-28 14:14:32,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-28 14:14:32,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:14:32,557 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8963#true} {8963#true} #73#return; {8963#true} is VALID [2022-04-28 14:14:32,557 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-28 14:14:32,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-28 14:14:32,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-28 14:14:32,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:14:32,558 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8963#true} {8963#true} #75#return; {8963#true} is VALID [2022-04-28 14:14:32,558 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-28 14:14:32,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-28 14:14:32,558 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-28 14:14:32,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-28 14:14:32,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-28 14:14:32,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:14:32,558 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8963#true} {8963#true} #77#return; {8963#true} is VALID [2022-04-28 14:14:32,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {8963#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8963#true} is VALID [2022-04-28 14:14:32,558 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-28 14:14:32,558 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-28 14:14:32,558 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-28 14:14:32,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-28 14:14:32,558 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-28 14:14:32,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-28 14:14:32,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-28 14:14:32,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:14:32,559 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8963#true} {8963#true} #77#return; {8963#true} is VALID [2022-04-28 14:14:32,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {8963#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8963#true} is VALID [2022-04-28 14:14:32,559 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-28 14:14:32,559 INFO L290 TraceCheckUtils]: 41: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-28 14:14:32,559 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-28 14:14:32,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-28 14:14:32,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-28 14:14:32,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:14:32,559 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8963#true} {8963#true} #77#return; {8963#true} is VALID [2022-04-28 14:14:32,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {8963#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8963#true} is VALID [2022-04-28 14:14:32,559 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-28 14:14:32,560 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-28 14:14:32,560 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-28 14:14:32,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-28 14:14:32,560 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-28 14:14:32,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {8963#true} ~cond := #in~cond; {9127#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:14:32,560 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-28 14:14:32,561 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-28 14:14:34,563 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-28 14:14:34,565 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-28 14:14:34,566 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-28 14:14:34,566 INFO L290 TraceCheckUtils]: 59: Hoare triple {9146#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9150#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:14:34,567 INFO L290 TraceCheckUtils]: 60: Hoare triple {9150#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8964#false} is VALID [2022-04-28 14:14:34,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {8964#false} assume !false; {8964#false} is VALID [2022-04-28 14:14:34,567 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-28 14:14:34,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:15:10,356 INFO L290 TraceCheckUtils]: 61: Hoare triple {8964#false} assume !false; {8964#false} is VALID [2022-04-28 14:15:10,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {9150#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8964#false} is VALID [2022-04-28 14:15:10,356 INFO L290 TraceCheckUtils]: 59: Hoare triple {9146#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9150#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:15:10,357 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-28 14:15:10,358 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-28 14:15:10,359 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-28 14:15:10,360 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-28 14:15:10,360 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-28 14:15:10,360 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-28 14:15:10,360 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-28 14:15:10,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-28 14:15:10,360 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-28 14:15:10,361 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-28 14:15:10,361 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-28 14:15:10,361 INFO L290 TraceCheckUtils]: 47: Hoare triple {8963#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8963#true} is VALID [2022-04-28 14:15:10,361 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8963#true} {8963#true} #77#return; {8963#true} is VALID [2022-04-28 14:15:10,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:15:10,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-28 14:15:10,361 INFO L290 TraceCheckUtils]: 43: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-28 14:15:10,361 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-28 14:15:10,361 INFO L290 TraceCheckUtils]: 41: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-28 14:15:10,361 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-28 14:15:10,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {8963#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8963#true} is VALID [2022-04-28 14:15:10,361 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8963#true} {8963#true} #77#return; {8963#true} is VALID [2022-04-28 14:15:10,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:15:10,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-28 14:15:10,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-28 14:15:10,362 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-28 14:15:10,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-28 14:15:10,362 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-28 14:15:10,362 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-28 14:15:10,362 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-28 14:15:10,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {8963#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8963#true} is VALID [2022-04-28 14:15:10,362 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8963#true} {8963#true} #77#return; {8963#true} is VALID [2022-04-28 14:15:10,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:15:10,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-28 14:15:10,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-28 14:15:10,362 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-28 14:15:10,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {8963#true} assume !false; {8963#true} is VALID [2022-04-28 14:15:10,363 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-28 14:15:10,363 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8963#true} {8963#true} #75#return; {8963#true} is VALID [2022-04-28 14:15:10,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:15:10,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-28 14:15:10,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-28 14:15:10,363 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-28 14:15:10,363 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8963#true} {8963#true} #73#return; {8963#true} is VALID [2022-04-28 14:15:10,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:15:10,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-28 14:15:10,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-28 14:15:10,363 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-28 14:15:10,363 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-28 14:15:10,363 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8963#true} {8963#true} #71#return; {8963#true} is VALID [2022-04-28 14:15:10,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:15:10,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {8963#true} assume !(0 == ~cond); {8963#true} is VALID [2022-04-28 14:15:10,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {8963#true} ~cond := #in~cond; {8963#true} is VALID [2022-04-28 14:15:10,364 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-28 14:15:10,364 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-28 14:15:10,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {8963#true} call #t~ret6 := main(); {8963#true} is VALID [2022-04-28 14:15:10,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8963#true} {8963#true} #83#return; {8963#true} is VALID [2022-04-28 14:15:10,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {8963#true} assume true; {8963#true} is VALID [2022-04-28 14:15:10,364 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-28 14:15:10,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {8963#true} call ULTIMATE.init(); {8963#true} is VALID [2022-04-28 14:15:10,364 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-28 14:15:10,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:15:10,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194226038] [2022-04-28 14:15:10,365 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:15:10,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592178045] [2022-04-28 14:15:10,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592178045] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:15:10,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:15:10,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 14:15:10,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:15:10,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [382341390] [2022-04-28 14:15:10,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [382341390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:15:10,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:15:10,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 14:15:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804954421] [2022-04-28 14:15:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:15:10,366 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-28 14:15:10,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:15:10,366 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-28 14:15:12,396 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-28 14:15:12,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 14:15:12,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:15:12,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 14:15:12,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 14:15:12,397 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-28 14:15:14,898 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-28 14:15:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:15:18,218 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2022-04-28 14:15:18,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 14:15:18,218 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-28 14:15:18,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:15:18,218 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-28 14:15:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-28 14:15:18,219 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-28 14:15:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-28 14:15:18,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-28 14:15:20,263 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-28 14:15:20,263 INFO L225 Difference]: With dead ends: 72 [2022-04-28 14:15:20,263 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:15:20,264 INFO L412 NwaCegarLoop]: 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-28 14:15:20,265 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 14:15:20,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 93 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 14:15:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:15:20,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:15:20,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:15:20,266 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-28 14:15:20,266 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-28 14:15:20,266 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-28 14:15:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:15:20,266 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:15:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:15:20,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:15:20,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:15:20,266 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-28 14:15:20,266 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-28 14:15:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:15:20,267 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:15:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:15:20,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:15:20,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:15:20,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:15:20,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:15:20,267 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-28 14:15:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:15:20,267 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2022-04-28 14:15:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:15:20,267 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:15:20,268 INFO L496 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-28 14:15:20,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:15:20,268 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-28 14:15:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:15:20,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:15:20,270 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:15:20,290 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-28 14:15:20,479 WARN L477 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-28 14:15:20,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:15:42,421 WARN L232 SmtUtils]: Spent 13.42s 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-28 14:15:53,914 WARN L232 SmtUtils]: Spent 7.46s 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-28 14:16:08,274 WARN L232 SmtUtils]: Spent 14.25s 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-28 14:16:55,964 WARN L232 SmtUtils]: Spent 46.31s 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) [2022-04-28 14:18:25,668 WARN L232 SmtUtils]: Spent 1.49m on a formula simplification. DAG size of input: 150 DAG size of output: 28 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 14:18:53,397 WARN L232 SmtUtils]: Spent 26.70s on a formula simplification. DAG size of input: 143 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 14:19:16,867 WARN L232 SmtUtils]: Spent 23.41s on a formula simplification. DAG size of input: 155 DAG size of output: 40 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 14:19:16,877 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-28 14:19:16,878 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-28 14:19:16,878 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-28 14:19:16,878 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-28 14:19:16,878 INFO L895 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 14:19:16,878 INFO L895 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:19:16,878 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 14:19:16,878 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 50) (<= 1 main_~y~0)) [2022-04-28 14:19:16,878 INFO L902 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: true [2022-04-28 14:19:16,878 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 19 60) the Hoare annotation is: true [2022-04-28 14:19:16,878 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 19 60) the Hoare annotation is: true [2022-04-28 14:19:16,879 INFO L895 garLoopResultBuilder]: At program point L44(lines 44 54) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~x~0))) (and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) .cse0) (<= main_~x~0 50) (= (mod (+ .cse0 (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0)) (<= 1 main_~b~0) (<= 1 main_~y~0))) [2022-04-28 14:19:16,882 INFO L895 garLoopResultBuilder]: At program point L40(lines 40 54) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~x~0))) (and (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) .cse0) (<= main_~x~0 50) (= (mod (+ .cse0 (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0)) (<= 1 main_~b~0) (<= 1 main_~y~0))) [2022-04-28 14:19:16,883 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 55) the Hoare annotation is: (and (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= main_~x~0 50) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-28 14:19:16,883 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 60) the Hoare annotation is: true [2022-04-28 14:19:16,883 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 50)) [2022-04-28 14:19:16,883 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1)) (<= 0 main_~x~0) (<= main_~x~0 50)) [2022-04-28 14:19:16,883 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= main_~x~0 50) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-28 14:19:16,883 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-28 14:19:16,883 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 50)) [2022-04-28 14:19:16,883 INFO L895 garLoopResultBuilder]: At program point L47(lines 47 54) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~x~0))) (and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) .cse0) (<= main_~x~0 50) (= (mod (+ .cse0 (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0)) (<= 1 main_~b~0) (<= 1 main_~y~0))) [2022-04-28 14:19:16,883 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 34 55) the Hoare annotation is: (let ((.cse0 (<= 0 main_~x~0)) (.cse1 (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (.cse2 (<= main_~x~0 50)) (.cse3 (<= 1 main_~y~0))) (or (and .cse0 .cse1 .cse2 (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0) .cse3) (and .cse0 .cse1 .cse2 (<= 1 main_~b~0) .cse3))) [2022-04-28 14:19:16,883 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (<= 0 main_~x~0)) (.cse1 (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (.cse2 (<= main_~x~0 50)) (.cse3 (<= 1 main_~y~0))) (or (and .cse0 .cse1 .cse2 (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0) .cse3) (and .cse0 .cse1 .cse2 (<= 1 main_~b~0) .cse3))) [2022-04-28 14:19:16,884 INFO L895 garLoopResultBuilder]: At program point L35-1(lines 34 55) the Hoare annotation is: (let ((.cse5 (* main_~y~0 main_~x~0))) (let ((.cse0 (<= 0 main_~x~0)) (.cse1 (or (= main_~q~0 .cse5) (and (= (mod (+ .cse5 (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))) (.cse2 (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) .cse5)) (.cse3 (<= main_~x~0 50)) (.cse4 (<= 1 main_~y~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 main_~b~0) .cse4) (and .cse0 .cse1 .cse2 .cse3 (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0) .cse4)))) [2022-04-28 14:19:16,884 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:19:16,884 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 14:19:16,884 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:19:16,884 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:19:16,884 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 14:19:16,884 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:19:16,884 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:19:16,884 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 14:19:16,884 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 14:19:16,885 INFO L895 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 14:19:16,885 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 14:19:16,885 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 14:19:16,885 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 14:19:16,888 INFO L356 BasicCegarLoop]: Path program histogram: [6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 14:19:16,890 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:19:16,895 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:19:16,900 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:19:18,958 INFO L163 areAnnotationChecker]: CFG has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:19:18,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:19:18 BoogieIcfgContainer [2022-04-28 14:19:18,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:19:18,973 INFO L158 Benchmark]: Toolchain (without parser) took 847768.93ms. Allocated memory was 189.8MB in the beginning and 276.8MB in the end (delta: 87.0MB). Free memory was 135.1MB in the beginning and 241.1MB in the end (delta: -106.0MB). Peak memory consumption was 143.0MB. Max. memory is 8.0GB. [2022-04-28 14:19:18,973 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 189.8MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:19:18,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.91ms. Allocated memory is still 189.8MB. Free memory was 134.9MB in the beginning and 158.3MB in the end (delta: -23.4MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-04-28 14:19:18,973 INFO L158 Benchmark]: Boogie Preprocessor took 35.66ms. Allocated memory is still 189.8MB. Free memory was 158.3MB in the beginning and 156.7MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-28 14:19:18,973 INFO L158 Benchmark]: RCFGBuilder took 285.86ms. Allocated memory is still 189.8MB. Free memory was 156.7MB in the beginning and 144.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 14:19:18,974 INFO L158 Benchmark]: TraceAbstraction took 847215.63ms. Allocated memory was 189.8MB in the beginning and 276.8MB in the end (delta: 87.0MB). Free memory was 143.6MB in the beginning and 241.1MB in the end (delta: -97.4MB). Peak memory consumption was 150.4MB. Max. memory is 8.0GB. [2022-04-28 14:19:18,978 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 189.8MB. Free memory is still 151.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.91ms. Allocated memory is still 189.8MB. Free memory was 134.9MB in the beginning and 158.3MB in the end (delta: -23.4MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.66ms. Allocated memory is still 189.8MB. Free memory was 158.3MB in the beginning and 156.7MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 285.86ms. Allocated memory is still 189.8MB. Free memory was 156.7MB in the beginning and 144.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 847215.63ms. Allocated memory was 189.8MB in the beginning and 276.8MB in the end (delta: 87.0MB). Free memory was 143.6MB in the beginning and 241.1MB in the end (delta: -97.4MB). Peak memory consumption was 150.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 845.1s, OverallIterations: 16, TraceHistogramMax: 5, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 90.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 236.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 448 SdHoareTripleChecker+Valid, 35.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 414 mSDsluCounter, 1828 SdHoareTripleChecker+Invalid, 35.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1425 mSDsCounter, 194 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2361 IncrementalHoareTripleChecker+Invalid, 2565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 194 mSolverCounterUnsat, 403 mSDtfsCounter, 2361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1406 GetRequests, 1158 SyntacticMatches, 15 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=15, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 119 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 218 PreInvPairs, 332 NumberOfFragments, 528 HoareAnnotationTreeSize, 218 FomulaSimplifications, 37903 FormulaSimplificationTreeSizeReduction, 47.8s HoareSimplificationTime, 34 FomulaSimplificationsInter, 721196 FormulaSimplificationTreeSizeReductionInter, 188.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((0 <= x && q + b * a * p == y * x) && x <= 50) && !((a + 1) % 2 == 0)) && 0 <= b) && 1 <= y) || ((((0 <= x && q + b * a * p == y * x) && x <= 50) && 1 <= b) && 1 <= y) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 14:19:19,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...