/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:18:08,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:18:08,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:18:08,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:18:08,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:18:08,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:18:08,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:18:08,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:18:08,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:18:08,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:18:08,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:18:08,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:18:08,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:18:08,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:18:08,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:18:08,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:18:08,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:18:08,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:18:08,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:18:08,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:18:08,198 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:18:08,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:18:08,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:18:08,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:18:08,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:18:08,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:18:08,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:18:08,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:18:08,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:18:08,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:18:08,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:18:08,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:18:08,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:18:08,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:18:08,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:18:08,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:18:08,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:18:08,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:18:08,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:18:08,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:18:08,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:18:08,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:18:08,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 07:18:08,228 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:18:08,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:18:08,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:18:08,230 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:18:08,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:18:08,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:18:08,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:18:08,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:18:08,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:18:08,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:18:08,231 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:18:08,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:18:08,231 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:18:08,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:18:08,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:18:08,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:18:08,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:18:08,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:18:08,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:18:08,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:18:08,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:18:08,232 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:18:08,232 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:18:08,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:18:08,232 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:18:08,233 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 07:18:08,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:18:08,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:18:08,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:18:08,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:18:08,460 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:18:08,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound100.c [2022-04-28 07:18:08,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49aed5f36/45c23e7d232e49fa8327109d539c08d4/FLAG913f051fb [2022-04-28 07:18:08,931 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:18:08,932 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound100.c [2022-04-28 07:18:08,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49aed5f36/45c23e7d232e49fa8327109d539c08d4/FLAG913f051fb [2022-04-28 07:18:09,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49aed5f36/45c23e7d232e49fa8327109d539c08d4 [2022-04-28 07:18:09,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:18:09,346 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:18:09,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:18:09,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:18:09,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:18:09,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:18:09" (1/1) ... [2022-04-28 07:18:09,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb71a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:18:09, skipping insertion in model container [2022-04-28 07:18:09,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:18:09" (1/1) ... [2022-04-28 07:18:09,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:18:09,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:18:09,508 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_unwindbound100.c[524,537] [2022-04-28 07:18:09,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:18:09,535 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:18:09,545 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_unwindbound100.c[524,537] [2022-04-28 07:18:09,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:18:09,566 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:18:09,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:18:09 WrapperNode [2022-04-28 07:18:09,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:18:09,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:18:09,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:18:09,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:18:09,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:18:09" (1/1) ... [2022-04-28 07:18:09,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:18:09" (1/1) ... [2022-04-28 07:18:09,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:18:09" (1/1) ... [2022-04-28 07:18:09,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:18:09" (1/1) ... [2022-04-28 07:18:09,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:18:09" (1/1) ... [2022-04-28 07:18:09,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:18:09" (1/1) ... [2022-04-28 07:18:09,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:18:09" (1/1) ... [2022-04-28 07:18:09,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:18:09,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:18:09,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:18:09,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:18:09,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:18:09" (1/1) ... [2022-04-28 07:18:09,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:18:09,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:18:09,684 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 07:18:09,705 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 07:18:09,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:18:09,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:18:09,729 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:18:09,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:18:09,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:18:09,729 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:18:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:18:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:18:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:18:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:18:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 07:18:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:18:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:18:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:18:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:18:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:18:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:18:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:18:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:18:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:18:09,793 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:18:09,795 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:18:09,965 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:18:09,970 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:18:09,971 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:18:09,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:18:09 BoogieIcfgContainer [2022-04-28 07:18:09,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:18:09,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:18:09,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:18:09,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:18:09,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:18:09" (1/3) ... [2022-04-28 07:18:09,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39143dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:18:09, skipping insertion in model container [2022-04-28 07:18:09,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:18:09" (2/3) ... [2022-04-28 07:18:09,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39143dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:18:09, skipping insertion in model container [2022-04-28 07:18:09,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:18:09" (3/3) ... [2022-04-28 07:18:09,979 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound100.c [2022-04-28 07:18:09,990 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:18:09,990 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:18:10,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:18:10,062 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@6ebe84c9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@90fee8b [2022-04-28 07:18:10,065 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:18:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:18:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 07:18:10,093 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:18:10,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:18:10,094 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:18:10,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:18:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1717894843, now seen corresponding path program 1 times [2022-04-28 07:18:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:18:10,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1199045095] [2022-04-28 07:18:10,116 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:18:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1717894843, now seen corresponding path program 2 times [2022-04-28 07:18:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:18:10,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403449492] [2022-04-28 07:18:10,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:18:10,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:18:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:18:10,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:18:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:18:10,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {35#true} is VALID [2022-04-28 07:18:10,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 07:18:10,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #77#return; {35#true} is VALID [2022-04-28 07:18:10,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:18:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:18:10,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 07:18:10,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 07:18:10,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 07:18:10,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #69#return; {36#false} is VALID [2022-04-28 07:18:10,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {44#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 07:18:10,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {35#true} is VALID [2022-04-28 07:18:10,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 07:18:10,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #77#return; {35#true} is VALID [2022-04-28 07:18:10,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2022-04-28 07:18:10,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35#true} is VALID [2022-04-28 07:18:10,276 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-28 07:18:10,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 07:18:10,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 07:18:10,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 07:18:10,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #69#return; {36#false} is VALID [2022-04-28 07:18:10,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {36#false} is VALID [2022-04-28 07:18:10,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-28 07:18:10,277 INFO L272 TraceCheckUtils]: 13: Hoare triple {36#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {36#false} is VALID [2022-04-28 07:18:10,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-28 07:18:10,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-28 07:18:10,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-28 07:18:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:18:10,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:18:10,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403449492] [2022-04-28 07:18:10,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403449492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:18:10,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:18:10,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:18:10,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:18:10,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1199045095] [2022-04-28 07:18:10,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1199045095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:18:10,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:18:10,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:18:10,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258123595] [2022-04-28 07:18:10,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:18:10,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 07:18:10,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:18:10,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:18:10,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:18:10,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:18:10,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:18:10,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:18:10,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:18:10,360 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:18:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:18:10,584 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2022-04-28 07:18:10,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:18:10,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 07:18:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:18:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:18:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-28 07:18:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:18:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-28 07:18:10,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-28 07:18:10,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:18:10,739 INFO L225 Difference]: With dead ends: 56 [2022-04-28 07:18:10,740 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 07:18:10,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:18:10,748 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:18:10,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 40 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:18:10,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 07:18:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-28 07:18:10,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:18:10,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:18:10,794 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:18:10,794 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:18:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:18:10,802 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 07:18:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 07:18:10,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:18:10,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:18:10,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-28 07:18:10,804 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-28 07:18:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:18:10,812 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 07:18:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 07:18:10,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:18:10,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:18:10,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:18:10,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:18:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:18:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-28 07:18:10,822 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-04-28 07:18:10,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:18:10,822 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-28 07:18:10,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:18:10,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-28 07:18:10,865 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 07:18:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-28 07:18:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 07:18:10,867 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:18:10,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:18:10,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:18:10,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:18:10,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:18:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash 444281082, now seen corresponding path program 1 times [2022-04-28 07:18:10,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:18:10,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1874602518] [2022-04-28 07:18:10,871 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:18:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash 444281082, now seen corresponding path program 2 times [2022-04-28 07:18:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:18:10,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356073111] [2022-04-28 07:18:10,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:18:10,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:18:10,911 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:18:10,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502453985] [2022-04-28 07:18:10,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:18:10,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:18:10,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:18:10,918 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 07:18:10,951 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 07:18:10,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:18:10,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:18:10,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 07:18:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:18:10,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:18:11,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {269#true} is VALID [2022-04-28 07:18:11,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#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);~counter~0 := 0; {277#(<= ~counter~0 0)} is VALID [2022-04-28 07:18:11,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#(<= ~counter~0 0)} assume true; {277#(<= ~counter~0 0)} is VALID [2022-04-28 07:18:11,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {277#(<= ~counter~0 0)} {269#true} #77#return; {277#(<= ~counter~0 0)} is VALID [2022-04-28 07:18:11,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {277#(<= ~counter~0 0)} call #t~ret7 := main(); {277#(<= ~counter~0 0)} is VALID [2022-04-28 07:18:11,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {277#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {277#(<= ~counter~0 0)} is VALID [2022-04-28 07:18:11,148 INFO L272 TraceCheckUtils]: 6: Hoare triple {277#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {277#(<= ~counter~0 0)} is VALID [2022-04-28 07:18:11,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {277#(<= ~counter~0 0)} ~cond := #in~cond; {277#(<= ~counter~0 0)} is VALID [2022-04-28 07:18:11,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#(<= ~counter~0 0)} assume !(0 == ~cond); {277#(<= ~counter~0 0)} is VALID [2022-04-28 07:18:11,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#(<= ~counter~0 0)} assume true; {277#(<= ~counter~0 0)} is VALID [2022-04-28 07:18:11,150 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {277#(<= ~counter~0 0)} {277#(<= ~counter~0 0)} #69#return; {277#(<= ~counter~0 0)} is VALID [2022-04-28 07:18:11,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {277#(<= ~counter~0 0)} is VALID [2022-04-28 07:18:11,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {311#(<= |main_#t~post6| 0)} is VALID [2022-04-28 07:18:11,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {311#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {270#false} is VALID [2022-04-28 07:18:11,152 INFO L272 TraceCheckUtils]: 14: Hoare triple {270#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {270#false} is VALID [2022-04-28 07:18:11,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {270#false} ~cond := #in~cond; {270#false} is VALID [2022-04-28 07:18:11,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {270#false} assume 0 == ~cond; {270#false} is VALID [2022-04-28 07:18:11,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-28 07:18:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:18:11,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:18:11,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:18:11,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356073111] [2022-04-28 07:18:11,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:18:11,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502453985] [2022-04-28 07:18:11,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502453985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:18:11,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:18:11,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:18:11,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:18:11,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1874602518] [2022-04-28 07:18:11,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1874602518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:18:11,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:18:11,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 07:18:11,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167441856] [2022-04-28 07:18:11,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:18:11,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 07:18:11,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:18:11,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:18:11,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:18:11,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 07:18:11,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:18:11,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 07:18:11,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 07:18:11,174 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:18:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:18:11,262 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-28 07:18:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 07:18:11,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 07:18:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:18:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:18:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-28 07:18:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:18:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-28 07:18:11,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-04-28 07:18:11,305 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 07:18:11,306 INFO L225 Difference]: With dead ends: 37 [2022-04-28 07:18:11,306 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 07:18:11,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 07:18:11,308 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:18:11,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:18:11,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 07:18:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 07:18:11,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:18:11,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:18:11,325 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:18:11,325 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:18:11,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:18:11,327 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 07:18:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 07:18:11,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:18:11,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:18:11,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-28 07:18:11,328 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-28 07:18:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:18:11,329 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 07:18:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 07:18:11,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:18:11,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:18:11,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:18:11,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:18:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:18:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-28 07:18:11,332 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 18 [2022-04-28 07:18:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:18:11,332 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-28 07:18:11,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 07:18:11,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions. [2022-04-28 07:18:11,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:18:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 07:18:11,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 07:18:11,374 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:18:11,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:18:11,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 07:18:11,597 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 07:18:11,598 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:18:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:18:11,599 INFO L85 PathProgramCache]: Analyzing trace with hash 446068542, now seen corresponding path program 1 times [2022-04-28 07:18:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:18:11,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [325172228] [2022-04-28 07:18:11,599 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:18:11,599 INFO L85 PathProgramCache]: Analyzing trace with hash 446068542, now seen corresponding path program 2 times [2022-04-28 07:18:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:18:11,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942725820] [2022-04-28 07:18:11,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:18:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:18:11,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:18:11,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788863703] [2022-04-28 07:18:11,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:18:11,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:18:11,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:18:11,617 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 07:18:11,635 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 07:18:11,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:18:11,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:18:11,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 07:18:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:18:11,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:18:11,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {516#true} call ULTIMATE.init(); {516#true} is VALID [2022-04-28 07:18:11,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {516#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);~counter~0 := 0; {516#true} is VALID [2022-04-28 07:18:11,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {516#true} assume true; {516#true} is VALID [2022-04-28 07:18:11,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {516#true} {516#true} #77#return; {516#true} is VALID [2022-04-28 07:18:11,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {516#true} call #t~ret7 := main(); {516#true} is VALID [2022-04-28 07:18:11,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {516#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {516#true} is VALID [2022-04-28 07:18:11,840 INFO L272 TraceCheckUtils]: 6: Hoare triple {516#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {516#true} is VALID [2022-04-28 07:18:11,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {516#true} ~cond := #in~cond; {516#true} is VALID [2022-04-28 07:18:11,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {516#true} assume !(0 == ~cond); {516#true} is VALID [2022-04-28 07:18:11,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#true} assume true; {516#true} is VALID [2022-04-28 07:18:11,840 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {516#true} {516#true} #69#return; {516#true} is VALID [2022-04-28 07:18:11,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {516#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {554#(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 07:18:11,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {554#(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 07:18:11,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {554#(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 07:18:11,847 INFO L272 TraceCheckUtils]: 14: Hoare triple {554#(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)); {564#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:18:11,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {568#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:18:11,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {568#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {517#false} is VALID [2022-04-28 07:18:11,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {517#false} assume !false; {517#false} is VALID [2022-04-28 07:18:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:18:11,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:18:11,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:18:11,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942725820] [2022-04-28 07:18:11,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:18:11,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788863703] [2022-04-28 07:18:11,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788863703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:18:11,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:18:11,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:18:11,850 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:18:11,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [325172228] [2022-04-28 07:18:11,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [325172228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:18:11,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:18:11,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:18:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599759586] [2022-04-28 07:18:11,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:18:11,851 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 07:18:11,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:18:11,851 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:18:11,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:18:11,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:18:11,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:18:11,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:18:11,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:18:11,872 INFO L87 Difference]: Start difference. First operand 29 states and 35 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:18:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:18:12,074 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-04-28 07:18:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:18:12,074 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 07:18:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:18:12,075 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:18:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 07:18:12,076 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:18:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 07:18:12,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 07:18:12,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:18:12,132 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:18:12,132 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 07:18:12,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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 07:18:12,134 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:18:12,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:18:12,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 07:18:12,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-28 07:18:12,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:18:12,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:18:12,149 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:18:12,150 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:18:12,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:18:12,152 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-28 07:18:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-28 07:18:12,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:18:12,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:18:12,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-28 07:18:12,153 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-28 07:18:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:18:12,155 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-28 07:18:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-28 07:18:12,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:18:12,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:18:12,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:18:12,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:18:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:18:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-28 07:18:12,157 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 18 [2022-04-28 07:18:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:18:12,157 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-28 07:18:12,157 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 07:18:12,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 40 transitions. [2022-04-28 07:18:12,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:18:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-28 07:18:12,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 07:18:12,193 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:18:12,193 INFO L195 NwaCegarLoop]: trace histogram [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 07:18:12,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 07:18:12,418 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 07:18:12,419 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:18:12,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:18:12,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1308579644, now seen corresponding path program 1 times [2022-04-28 07:18:12,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:18:12,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1602380628] [2022-04-28 07:18:12,420 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:18:12,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1308579644, now seen corresponding path program 2 times [2022-04-28 07:18:12,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:18:12,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697507451] [2022-04-28 07:18:12,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:18:12,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:18:12,432 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:18:12,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010167585] [2022-04-28 07:18:12,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:18:12,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:18:12,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:18:12,434 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 07:18:12,435 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 07:18:12,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:18:12,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:18:12,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 07:18:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:18:12,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:18:22,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2022-04-28 07:18:22,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#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);~counter~0 := 0; {808#true} is VALID [2022-04-28 07:18:22,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-28 07:18:22,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #77#return; {808#true} is VALID [2022-04-28 07:18:22,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret7 := main(); {808#true} is VALID [2022-04-28 07:18:22,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {808#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {808#true} is VALID [2022-04-28 07:18:22,973 INFO L272 TraceCheckUtils]: 6: Hoare triple {808#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {808#true} is VALID [2022-04-28 07:18:22,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#true} ~cond := #in~cond; {834#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:18:22,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {834#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {838#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:18:22,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {838#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:18:22,976 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {838#(not (= |assume_abort_if_not_#in~cond| 0))} {808#true} #69#return; {845#(<= 1 main_~y~0)} is VALID [2022-04-28 07:18:22,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:18:22,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:18:22,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !!(#t~post6 < 100);havoc #t~post6; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:18:22,978 INFO L272 TraceCheckUtils]: 14: Hoare triple {849#(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)); {808#true} is VALID [2022-04-28 07:18:22,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#true} ~cond := #in~cond; {862#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:18:22,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {862#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:18:22,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:18:24,982 WARN L284 TraceCheckUtils]: 18: Hoare quadruple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #71#return; {873#(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)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-28 07:18:24,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {873#(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)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {877#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 07:18:24,983 INFO L272 TraceCheckUtils]: 20: Hoare triple {877#(and (= 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)); {881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:18:24,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:18:24,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {809#false} is VALID [2022-04-28 07:18:24,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {809#false} assume !false; {809#false} is VALID [2022-04-28 07:18:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:18:24,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:19:03,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {809#false} assume !false; {809#false} is VALID [2022-04-28 07:19:03,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {809#false} is VALID [2022-04-28 07:19:03,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:19:03,522 INFO L272 TraceCheckUtils]: 20: Hoare triple {901#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:19:03,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {905#(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); {901#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:19:03,524 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} {808#true} #71#return; {905#(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 07:19:03,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:19:03,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:19:03,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#true} ~cond := #in~cond; {918#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 07:19:03,525 INFO L272 TraceCheckUtils]: 14: Hoare triple {808#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {808#true} is VALID [2022-04-28 07:19:03,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {808#true} assume !!(#t~post6 < 100);havoc #t~post6; {808#true} is VALID [2022-04-28 07:19:03,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {808#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {808#true} is VALID [2022-04-28 07:19:03,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {808#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {808#true} is VALID [2022-04-28 07:19:03,525 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {808#true} {808#true} #69#return; {808#true} is VALID [2022-04-28 07:19:03,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-28 07:19:03,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {808#true} assume !(0 == ~cond); {808#true} is VALID [2022-04-28 07:19:03,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#true} ~cond := #in~cond; {808#true} is VALID [2022-04-28 07:19:03,526 INFO L272 TraceCheckUtils]: 6: Hoare triple {808#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {808#true} is VALID [2022-04-28 07:19:03,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {808#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {808#true} is VALID [2022-04-28 07:19:03,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret7 := main(); {808#true} is VALID [2022-04-28 07:19:03,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #77#return; {808#true} is VALID [2022-04-28 07:19:03,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-28 07:19:03,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#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);~counter~0 := 0; {808#true} is VALID [2022-04-28 07:19:03,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2022-04-28 07:19:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:19:03,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:19:03,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697507451] [2022-04-28 07:19:03,527 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:19:03,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010167585] [2022-04-28 07:19:03,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010167585] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:19:03,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:19:03,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-28 07:19:03,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:19:03,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1602380628] [2022-04-28 07:19:03,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1602380628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:19:03,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:19:03,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:19:03,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951117629] [2022-04-28 07:19:03,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:19:03,528 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 07:19:03,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:19:03,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:19:05,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:19:05,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:19:05,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:19:05,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:19:05,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:19:05,547 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:19:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:19:08,825 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-28 07:19:08,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 07:19:08,825 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-28 07:19:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:19:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:19:08,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 07:19:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:19:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-28 07:19:08,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-28 07:19:10,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 59 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:19:10,901 INFO L225 Difference]: With dead ends: 50 [2022-04-28 07:19:10,901 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 07:19:10,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-04-28 07:19:10,902 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 07:19:10,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 130 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 07:19:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 07:19:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-04-28 07:19:10,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:19:10,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:19:10,939 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:19:10,939 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:19:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:19:10,942 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-28 07:19:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-28 07:19:10,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:19:10,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:19:10,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-28 07:19:10,943 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-28 07:19:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:19:10,945 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-28 07:19:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-28 07:19:10,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:19:10,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:19:10,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:19:10,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:19:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:19:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-04-28 07:19:10,947 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 24 [2022-04-28 07:19:10,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:19:10,947 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-04-28 07:19:10,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:19:10,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 56 transitions. [2022-04-28 07:19:12,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:19:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 07:19:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 07:19:12,999 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:19:13,000 INFO L195 NwaCegarLoop]: trace histogram [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 07:19:13,016 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 07:19:13,200 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 07:19:13,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:19:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:19:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1797927234, now seen corresponding path program 1 times [2022-04-28 07:19:13,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:19:13,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1885835532] [2022-04-28 07:19:19,308 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:19:19,309 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:19:19,309 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:19:19,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1797927234, now seen corresponding path program 2 times [2022-04-28 07:19:19,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:19:19,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460783335] [2022-04-28 07:19:19,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:19:19,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:19:19,319 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:19:19,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126205689] [2022-04-28 07:19:19,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:19:19,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:19:19,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:19:19,321 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 07:19:19,329 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 07:19:19,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:19:19,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:19:19,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:19:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:19:19,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:19:19,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-28 07:19:19,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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);~counter~0 := 0; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 07:19:19,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {1268#(<= ~counter~0 0)} assume true; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 07:19:19,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1268#(<= ~counter~0 0)} {1260#true} #77#return; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 07:19:19,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {1268#(<= ~counter~0 0)} call #t~ret7 := main(); {1268#(<= ~counter~0 0)} is VALID [2022-04-28 07:19:19,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {1268#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 07:19:19,515 INFO L272 TraceCheckUtils]: 6: Hoare triple {1268#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1268#(<= ~counter~0 0)} is VALID [2022-04-28 07:19:19,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {1268#(<= ~counter~0 0)} ~cond := #in~cond; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 07:19:19,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {1268#(<= ~counter~0 0)} assume !(0 == ~cond); {1268#(<= ~counter~0 0)} is VALID [2022-04-28 07:19:19,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {1268#(<= ~counter~0 0)} assume true; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 07:19:19,517 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1268#(<= ~counter~0 0)} {1268#(<= ~counter~0 0)} #69#return; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 07:19:19,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {1268#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1268#(<= ~counter~0 0)} is VALID [2022-04-28 07:19:19,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {1268#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 07:19:19,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {1302#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 07:19:19,519 INFO L272 TraceCheckUtils]: 14: Hoare triple {1302#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1302#(<= ~counter~0 1)} is VALID [2022-04-28 07:19:19,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {1302#(<= ~counter~0 1)} ~cond := #in~cond; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 07:19:19,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {1302#(<= ~counter~0 1)} assume !(0 == ~cond); {1302#(<= ~counter~0 1)} is VALID [2022-04-28 07:19:19,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {1302#(<= ~counter~0 1)} assume true; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 07:19:19,521 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1302#(<= ~counter~0 1)} {1302#(<= ~counter~0 1)} #71#return; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 07:19:19,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {1302#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {1302#(<= ~counter~0 1)} is VALID [2022-04-28 07:19:19,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {1302#(<= ~counter~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; {1302#(<= ~counter~0 1)} is VALID [2022-04-28 07:19:19,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {1302#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1330#(<= |main_#t~post6| 1)} is VALID [2022-04-28 07:19:19,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {1330#(<= |main_#t~post6| 1)} assume !(#t~post6 < 100);havoc #t~post6; {1261#false} is VALID [2022-04-28 07:19:19,523 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1261#false} is VALID [2022-04-28 07:19:19,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#false} ~cond := #in~cond; {1261#false} is VALID [2022-04-28 07:19:19,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#false} assume 0 == ~cond; {1261#false} is VALID [2022-04-28 07:19:19,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-28 07:19:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:19:19,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:19:19,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-28 07:19:19,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#false} assume 0 == ~cond; {1261#false} is VALID [2022-04-28 07:19:19,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#false} ~cond := #in~cond; {1261#false} is VALID [2022-04-28 07:19:19,691 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1261#false} is VALID [2022-04-28 07:19:19,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {1358#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {1261#false} is VALID [2022-04-28 07:19:19,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {1362#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1358#(< |main_#t~post6| 100)} is VALID [2022-04-28 07:19:19,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {1362#(< ~counter~0 100)} 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; {1362#(< ~counter~0 100)} is VALID [2022-04-28 07:19:19,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {1362#(< ~counter~0 100)} assume !!(0 != ~a~0 && 0 != ~b~0); {1362#(< ~counter~0 100)} is VALID [2022-04-28 07:19:19,694 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1260#true} {1362#(< ~counter~0 100)} #71#return; {1362#(< ~counter~0 100)} is VALID [2022-04-28 07:19:19,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-28 07:19:19,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {1260#true} assume !(0 == ~cond); {1260#true} is VALID [2022-04-28 07:19:19,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {1260#true} ~cond := #in~cond; {1260#true} is VALID [2022-04-28 07:19:19,694 INFO L272 TraceCheckUtils]: 14: Hoare triple {1362#(< ~counter~0 100)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1260#true} is VALID [2022-04-28 07:19:19,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {1362#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {1362#(< ~counter~0 100)} is VALID [2022-04-28 07:19:19,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {1390#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1362#(< ~counter~0 100)} is VALID [2022-04-28 07:19:19,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#(< ~counter~0 99)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1390#(< ~counter~0 99)} is VALID [2022-04-28 07:19:19,696 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1260#true} {1390#(< ~counter~0 99)} #69#return; {1390#(< ~counter~0 99)} is VALID [2022-04-28 07:19:19,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-28 07:19:19,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {1260#true} assume !(0 == ~cond); {1260#true} is VALID [2022-04-28 07:19:19,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} ~cond := #in~cond; {1260#true} is VALID [2022-04-28 07:19:19,696 INFO L272 TraceCheckUtils]: 6: Hoare triple {1390#(< ~counter~0 99)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1260#true} is VALID [2022-04-28 07:19:19,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#(< ~counter~0 99)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1390#(< ~counter~0 99)} is VALID [2022-04-28 07:19:19,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#(< ~counter~0 99)} call #t~ret7 := main(); {1390#(< ~counter~0 99)} is VALID [2022-04-28 07:19:19,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#(< ~counter~0 99)} {1260#true} #77#return; {1390#(< ~counter~0 99)} is VALID [2022-04-28 07:19:19,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#(< ~counter~0 99)} assume true; {1390#(< ~counter~0 99)} is VALID [2022-04-28 07:19:19,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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);~counter~0 := 0; {1390#(< ~counter~0 99)} is VALID [2022-04-28 07:19:19,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-28 07:19:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:19:19,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:19:19,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460783335] [2022-04-28 07:19:19,699 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:19:19,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126205689] [2022-04-28 07:19:19,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126205689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:19:19,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:19:19,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 07:19:19,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:19:19,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1885835532] [2022-04-28 07:19:19,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1885835532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:19:19,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:19:19,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:19:19,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021672686] [2022-04-28 07:19:19,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:19:19,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-28 07:19:19,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:19:19,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:19:19,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:19:19,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:19:19,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:19:19,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:19:19,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:19:19,722 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:19:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:19:19,875 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-28 07:19:19,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 07:19:19,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-28 07:19:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:19:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:19:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-28 07:19:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:19:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-28 07:19:19,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-28 07:19:19,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:19:19,930 INFO L225 Difference]: With dead ends: 73 [2022-04-28 07:19:19,930 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 07:19:19,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 07:19:19,931 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:19:19,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:19:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 07:19:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-04-28 07:19:19,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:19:19,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:19:19,998 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:19:19,998 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:19:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:19:20,001 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-28 07:19:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 07:19:20,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:19:20,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:19:20,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-28 07:19:20,002 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-28 07:19:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:19:20,004 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-28 07:19:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 07:19:20,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:19:20,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:19:20,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:19:20,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:19:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:19:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2022-04-28 07:19:20,006 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 27 [2022-04-28 07:19:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:19:20,006 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2022-04-28 07:19:20,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 07:19:20,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 76 transitions. [2022-04-28 07:19:22,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:19:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-28 07:19:22,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 07:19:22,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:19:22,081 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:19:22,097 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 07:19:22,281 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 07:19:22,281 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:19:22,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:19:22,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1799714694, now seen corresponding path program 1 times [2022-04-28 07:19:22,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:19:22,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [302423542] [2022-04-28 07:19:28,348 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:19:28,348 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:19:28,348 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:19:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1799714694, now seen corresponding path program 2 times [2022-04-28 07:19:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:19:28,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975267235] [2022-04-28 07:19:28,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:19:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:19:28,358 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:19:28,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1085615195] [2022-04-28 07:19:28,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:19:28,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:19:28,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:19:28,359 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 07:19:28,360 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 07:19:28,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:19:28,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:19:28,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 07:19:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:19:28,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:19:28,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2022-04-28 07:19:28,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#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);~counter~0 := 0; {1825#true} is VALID [2022-04-28 07:19:28,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 07:19:28,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #77#return; {1825#true} is VALID [2022-04-28 07:19:28,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret7 := main(); {1825#true} is VALID [2022-04-28 07:19:28,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1825#true} is VALID [2022-04-28 07:19:28,785 INFO L272 TraceCheckUtils]: 6: Hoare triple {1825#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1825#true} is VALID [2022-04-28 07:19:28,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#true} ~cond := #in~cond; {1825#true} is VALID [2022-04-28 07:19:28,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {1825#true} assume !(0 == ~cond); {1825#true} is VALID [2022-04-28 07:19:28,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 07:19:28,787 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1825#true} {1825#true} #69#return; {1825#true} is VALID [2022-04-28 07:19:28,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:19:28,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:19:28,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:19:28,788 INFO L272 TraceCheckUtils]: 14: Hoare triple {1863#(and (= main_~b~0 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)); {1825#true} is VALID [2022-04-28 07:19:28,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#true} ~cond := #in~cond; {1876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:19:28,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {1876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:19:28,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:19:28,791 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:19:28,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:19:28,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 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; {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 07:19:28,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 07:19:28,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} assume !!(#t~post6 < 100);havoc #t~post6; {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 07:19:28,797 INFO L272 TraceCheckUtils]: 23: Hoare triple {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~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)); {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:19:28,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:19:28,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {1908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1826#false} is VALID [2022-04-28 07:19:28,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-28 07:19:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:19:28,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:20:25,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-28 07:20:25,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {1908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1826#false} is VALID [2022-04-28 07:20:25,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:20:25,352 INFO L272 TraceCheckUtils]: 23: Hoare triple {1924#(= (+ 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)); {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:20:25,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 100);havoc #t~post6; {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:25,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:25,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {1934#(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)) (not (= (mod main_~a~0 2) 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~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; {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:25,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {1934#(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)) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1934#(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)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 07:20:25,365 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} {1825#true} #71#return; {1934#(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)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 07:20:25,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:20:25,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {1950#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:20:25,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#true} ~cond := #in~cond; {1950#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 07:20:25,366 INFO L272 TraceCheckUtils]: 14: Hoare triple {1825#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1825#true} is VALID [2022-04-28 07:20:25,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {1825#true} assume !!(#t~post6 < 100);havoc #t~post6; {1825#true} is VALID [2022-04-28 07:20:25,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {1825#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1825#true} is VALID [2022-04-28 07:20:25,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1825#true} is VALID [2022-04-28 07:20:25,366 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1825#true} {1825#true} #69#return; {1825#true} is VALID [2022-04-28 07:20:25,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 07:20:25,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {1825#true} assume !(0 == ~cond); {1825#true} is VALID [2022-04-28 07:20:25,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#true} ~cond := #in~cond; {1825#true} is VALID [2022-04-28 07:20:25,366 INFO L272 TraceCheckUtils]: 6: Hoare triple {1825#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1825#true} is VALID [2022-04-28 07:20:25,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1825#true} is VALID [2022-04-28 07:20:25,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret7 := main(); {1825#true} is VALID [2022-04-28 07:20:25,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #77#return; {1825#true} is VALID [2022-04-28 07:20:25,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-28 07:20:25,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#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);~counter~0 := 0; {1825#true} is VALID [2022-04-28 07:20:25,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2022-04-28 07:20:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 07:20:25,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:20:25,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975267235] [2022-04-28 07:20:25,367 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:20:25,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085615195] [2022-04-28 07:20:25,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085615195] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:20:25,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:20:25,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-28 07:20:25,368 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:20:25,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [302423542] [2022-04-28 07:20:25,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [302423542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:20:25,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:20:25,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:20:25,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956430015] [2022-04-28 07:20:25,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:20:25,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-28 07:20:25,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:20:25,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:20:25,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:20:25,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:20:25,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:20:25,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:20:25,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:20:25,394 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:20:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:20:25,970 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-28 07:20:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:20:25,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-28 07:20:25,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:20:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:20:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-28 07:20:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:20:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-28 07:20:25,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2022-04-28 07:20:26,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:20:26,033 INFO L225 Difference]: With dead ends: 76 [2022-04-28 07:20:26,033 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 07:20:26,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:20:26,035 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:20:26,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 126 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:20:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 07:20:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2022-04-28 07:20:26,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:20:26,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:20:26,102 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:20:26,102 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:20:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:20:26,104 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-28 07:20:26,104 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-28 07:20:26,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:20:26,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:20:26,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 07:20:26,105 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 07:20:26,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:20:26,112 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-28 07:20:26,113 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-28 07:20:26,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:20:26,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:20:26,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:20:26,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:20:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:20:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-28 07:20:26,116 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 27 [2022-04-28 07:20:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:20:26,116 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-28 07:20:26,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:20:26,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 83 transitions. [2022-04-28 07:20:28,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 82 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:20:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-28 07:20:28,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 07:20:28,216 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:20:28,217 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 07:20:28,238 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 07:20:28,427 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 07:20:28,427 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:20:28,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:20:28,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1613968938, now seen corresponding path program 1 times [2022-04-28 07:20:28,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:20:28,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [11162416] [2022-04-28 07:20:28,428 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:20:28,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1613968938, now seen corresponding path program 2 times [2022-04-28 07:20:28,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:20:28,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677630135] [2022-04-28 07:20:28,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:20:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:20:28,442 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:20:28,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [962441599] [2022-04-28 07:20:28,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:20:28,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:20:28,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:20:28,443 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 07:20:28,444 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 07:20:28,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:20:28,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:20:28,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 07:20:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:20:28,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:20:28,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {2438#true} call ULTIMATE.init(); {2438#true} is VALID [2022-04-28 07:20:28,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {2438#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);~counter~0 := 0; {2438#true} is VALID [2022-04-28 07:20:28,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {2438#true} assume true; {2438#true} is VALID [2022-04-28 07:20:28,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2438#true} {2438#true} #77#return; {2438#true} is VALID [2022-04-28 07:20:28,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {2438#true} call #t~ret7 := main(); {2438#true} is VALID [2022-04-28 07:20:28,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {2438#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2438#true} is VALID [2022-04-28 07:20:28,644 INFO L272 TraceCheckUtils]: 6: Hoare triple {2438#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2438#true} is VALID [2022-04-28 07:20:28,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#true} ~cond := #in~cond; {2464#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:20:28,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {2464#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2468#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:20:28,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {2468#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2468#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:20:28,645 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2468#(not (= |assume_abort_if_not_#in~cond| 0))} {2438#true} #69#return; {2475#(<= 1 main_~y~0)} is VALID [2022-04-28 07:20:28,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2479#(<= 1 main_~b~0)} is VALID [2022-04-28 07:20:28,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {2479#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2479#(<= 1 main_~b~0)} is VALID [2022-04-28 07:20:28,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {2479#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {2479#(<= 1 main_~b~0)} is VALID [2022-04-28 07:20:28,646 INFO L272 TraceCheckUtils]: 14: Hoare triple {2479#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2438#true} is VALID [2022-04-28 07:20:28,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {2438#true} ~cond := #in~cond; {2438#true} is VALID [2022-04-28 07:20:28,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {2438#true} assume !(0 == ~cond); {2438#true} is VALID [2022-04-28 07:20:28,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {2438#true} assume true; {2438#true} is VALID [2022-04-28 07:20:28,647 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2438#true} {2479#(<= 1 main_~b~0)} #71#return; {2479#(<= 1 main_~b~0)} is VALID [2022-04-28 07:20:28,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {2479#(<= 1 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 07:20:28,648 INFO L272 TraceCheckUtils]: 20: Hoare triple {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2438#true} is VALID [2022-04-28 07:20:28,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {2438#true} ~cond := #in~cond; {2438#true} is VALID [2022-04-28 07:20:28,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {2438#true} assume !(0 == ~cond); {2438#true} is VALID [2022-04-28 07:20:28,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {2438#true} assume true; {2438#true} is VALID [2022-04-28 07:20:28,649 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2438#true} {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} #73#return; {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 07:20:28,649 INFO L272 TraceCheckUtils]: 25: Hoare triple {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:20:28,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {2523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:20:28,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {2527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2439#false} is VALID [2022-04-28 07:20:28,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {2439#false} assume !false; {2439#false} is VALID [2022-04-28 07:20:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:20:28,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:20:28,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:20:28,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677630135] [2022-04-28 07:20:28,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:20:28,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962441599] [2022-04-28 07:20:28,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962441599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:20:28,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:20:28,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:20:28,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:20:28,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [11162416] [2022-04-28 07:20:28,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [11162416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:20:28,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:20:28,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 07:20:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079645520] [2022-04-28 07:20:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:20:28,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-04-28 07:20:28,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:20:28,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:20:28,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:20:28,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 07:20:28,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:20:28,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 07:20:28,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 07:20:28,679 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:20:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:20:29,079 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2022-04-28 07:20:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:20:29,080 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-04-28 07:20:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:20:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:20:29,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 07:20:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:20:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-28 07:20:29,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-28 07:20:29,130 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 07:20:29,132 INFO L225 Difference]: With dead ends: 85 [2022-04-28 07:20:29,132 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 07:20:29,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:20:29,134 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:20:29,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 157 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:20:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 07:20:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-04-28 07:20:29,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:20:29,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:20:29,217 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:20:29,218 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:20:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:20:29,219 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-28 07:20:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-28 07:20:29,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:20:29,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:20:29,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 07:20:29,220 INFO L87 Difference]: Start difference. First operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 07:20:29,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:20:29,222 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-28 07:20:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-28 07:20:29,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:20:29,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:20:29,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:20:29,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:20:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:20:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2022-04-28 07:20:29,224 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 29 [2022-04-28 07:20:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:20:29,224 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2022-04-28 07:20:29,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:20:29,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 80 transitions. [2022-04-28 07:20:31,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 79 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:20:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2022-04-28 07:20:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 07:20:31,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:20:31,314 INFO L195 NwaCegarLoop]: trace histogram [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 07:20:31,330 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 07:20:31,516 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 07:20:31,516 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:20:31,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:20:31,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1357155568, now seen corresponding path program 1 times [2022-04-28 07:20:31,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:20:31,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [416133672] [2022-04-28 07:20:38,947 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 07:20:39,029 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 07:20:39,094 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 07:20:39,158 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 07:20:40,691 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 07:20:40,768 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 07:20:40,768 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 07:20:40,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1724905837, now seen corresponding path program 1 times [2022-04-28 07:20:40,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:20:40,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333326466] [2022-04-28 07:20:40,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:20:40,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:20:40,781 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:20:40,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872843480] [2022-04-28 07:20:40,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:20:40,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:20:40,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:20:40,786 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 07:20:40,786 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 07:20:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:20:40,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 07:20:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:20:40,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:20:48,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {2965#true} is VALID [2022-04-28 07:20:48,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#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);~counter~0 := 0; {2965#true} is VALID [2022-04-28 07:20:48,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-28 07:20:48,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2965#true} {2965#true} #77#return; {2965#true} is VALID [2022-04-28 07:20:48,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {2965#true} call #t~ret7 := main(); {2965#true} is VALID [2022-04-28 07:20:48,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2965#true} is VALID [2022-04-28 07:20:48,497 INFO L272 TraceCheckUtils]: 6: Hoare triple {2965#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2965#true} is VALID [2022-04-28 07:20:48,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#true} ~cond := #in~cond; {2965#true} is VALID [2022-04-28 07:20:48,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {2965#true} assume !(0 == ~cond); {2965#true} is VALID [2022-04-28 07:20:48,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-28 07:20:48,497 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2965#true} {2965#true} #69#return; {2965#true} is VALID [2022-04-28 07:20:48,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3003#(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 07:20:48,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [81] L46-2-->L33-1_primed: Formula: (let ((.cse6 (+ (* v_main_~p~0_29 v_main_~a~0_38 v_main_~b~0_37) v_main_~q~0_28))) (let ((.cse0 (= v_main_~q~0_28 v_main_~q~0_27)) (.cse1 (= |v_main_#t~post6_17| |v_main_#t~post6_15|)) (.cse5 (= (mod v_main_~b~0_37 2) 0)) (.cse4 (= 0 v_main_~b~0_37)) (.cse10 (<= 0 v_main_~a~0_38)) (.cse7 (= (mod v_main_~a~0_38 2) 1)) (.cse8 (= (* v_main_~x~0_22 v_main_~y~0_26) .cse6)) (.cse9 (< v_~counter~0_29 100)) (.cse2 (= v_~counter~0_29 v_~counter~0_28)) (.cse3 (= v_main_~a~0_38 v_main_~a~0_37))) (or (and .cse0 (= v_main_~p~0_29 v_main_~p~0_29) .cse1 (= v_main_~b~0_37 v_main_~b~0_37) .cse2 (= v_main_~x~0_22 v_main_~x~0_22) (= v_main_~y~0_26 v_main_~y~0_26) .cse3) (and (not .cse4) .cse5 (< v_main_~a~0_37 v_main_~a~0_38) (= (+ v_main_~q~0_27 (* v_main_~p~0_29 v_main_~a~0_37 v_main_~b~0_37)) .cse6) .cse7 (< v_main_~a~0_38 (+ 2 v_main_~a~0_37)) .cse8 (= (+ v_~counter~0_29 v_main_~a~0_38) (+ v_~counter~0_28 v_main_~a~0_37)) .cse9 .cse10) (and .cse0 .cse1 (or (not .cse5) .cse4 (not .cse10) (not .cse7) (not .cse8) (not .cse9)) .cse2 .cse3)))) InVars {main_~q~0=v_main_~q~0_28, ~counter~0=v_~counter~0_29, main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_26, main_~b~0=v_main_~b~0_37, main_~p~0=v_main_~p~0_29, main_#t~post6=|v_main_#t~post6_17|, main_~a~0=v_main_~a~0_38} OutVars{main_~q~0=v_main_~q~0_27, ~counter~0=v_~counter~0_28, main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_26, main_~b~0=v_main_~b~0_37, main_~p~0=v_main_~p~0_29, main_#t~post6=|v_main_#t~post6_15|, main_~a~0=v_main_~a~0_37} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_#t~post6, main_~a~0] {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 07:20:48,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} [82] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 07:20:48,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} [83] L46-2-->L33-1_primed: Formula: (and (= v_main_~q~0_28 v_main_~q~0_27) (= |v_main_#t~post6_20| |v_main_#t~post6_15|) (= v_~counter~0_29 v_~counter~0_28) (= v_main_~a~0_38 v_main_~a~0_37)) InVars {main_~q~0=v_main_~q~0_28, ~counter~0=v_~counter~0_29, main_#t~post6=|v_main_#t~post6_20|, main_~a~0=v_main_~a~0_38} OutVars{main_~q~0=v_main_~q~0_27, ~counter~0=v_~counter~0_28, main_#t~post6=|v_main_#t~post6_15|, main_~a~0=v_main_~a~0_37} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_#t~post6, main_~a~0] {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 07:20:48,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} [84] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 07:20:48,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} [85] L46-2-->L33-1_primed: Formula: (and (= v_main_~q~0_28 v_main_~q~0_27) (= v_~counter~0_29 v_~counter~0_28) (= |v_main_#t~post6_23| |v_main_#t~post6_15|) (= v_main_~a~0_38 v_main_~a~0_37)) InVars {main_~q~0=v_main_~q~0_28, ~counter~0=v_~counter~0_29, main_#t~post6=|v_main_#t~post6_23|, main_~a~0=v_main_~a~0_38} OutVars{main_~q~0=v_main_~q~0_27, ~counter~0=v_~counter~0_28, main_#t~post6=|v_main_#t~post6_15|, main_~a~0=v_main_~a~0_37} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_#t~post6, main_~a~0] {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 07:20:48,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} [86] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 07:20:48,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} [87] L46-2-->L33-1_primed: Formula: (and (= v_main_~q~0_28 v_main_~q~0_27) (= v_~counter~0_29 v_~counter~0_28) (= |v_main_#t~post6_26| |v_main_#t~post6_15|) (= v_main_~a~0_38 v_main_~a~0_37)) InVars {main_~q~0=v_main_~q~0_28, ~counter~0=v_~counter~0_29, main_#t~post6=|v_main_#t~post6_26|, main_~a~0=v_main_~a~0_38} OutVars{main_~q~0=v_main_~q~0_27, ~counter~0=v_~counter~0_28, main_#t~post6=|v_main_#t~post6_15|, main_~a~0=v_main_~a~0_37} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_#t~post6, main_~a~0] {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 07:20:48,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} [88] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 07:20:48,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} [89] L46-2-->L33-1_primed: Formula: (let ((.cse2 (+ (* v_main_~p~0_29 v_main_~a~0_38 v_main_~b~0_37) v_main_~q~0_28))) (let ((.cse7 (= v_main_~q~0_28 v_main_~q~0_27)) (.cse1 (= (mod v_main_~b~0_37 2) 0)) (.cse0 (= 0 v_main_~b~0_37)) (.cse6 (<= 0 v_main_~a~0_38)) (.cse3 (= (mod v_main_~a~0_38 2) 1)) (.cse4 (= (* v_main_~x~0_22 v_main_~y~0_26) .cse2)) (.cse5 (< v_~counter~0_29 100)) (.cse8 (= v_~counter~0_29 v_~counter~0_28)) (.cse9 (= |v_main_#t~post6_29| |v_main_#t~post6_15|)) (.cse10 (= v_main_~a~0_38 v_main_~a~0_37))) (or (and (not .cse0) .cse1 (< v_main_~a~0_37 v_main_~a~0_38) (= (+ v_main_~q~0_27 (* v_main_~p~0_29 v_main_~a~0_37 v_main_~b~0_37)) .cse2) .cse3 (< v_main_~a~0_38 (+ 2 v_main_~a~0_37)) .cse4 (= (+ v_~counter~0_29 v_main_~a~0_38) (+ v_~counter~0_28 v_main_~a~0_37)) .cse5 .cse6) (and .cse7 (= v_main_~p~0_29 v_main_~p~0_29) (= v_main_~b~0_37 v_main_~b~0_37) .cse8 (= v_main_~x~0_22 v_main_~x~0_22) .cse9 (= v_main_~y~0_26 v_main_~y~0_26) .cse10) (and .cse7 (or (not .cse1) .cse0 (not .cse6) (not .cse3) (not .cse4) (not .cse5)) .cse8 .cse9 .cse10)))) InVars {main_~q~0=v_main_~q~0_28, ~counter~0=v_~counter~0_29, main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_26, main_~b~0=v_main_~b~0_37, main_~p~0=v_main_~p~0_29, main_#t~post6=|v_main_#t~post6_29|, main_~a~0=v_main_~a~0_38} OutVars{main_~q~0=v_main_~q~0_27, ~counter~0=v_~counter~0_28, main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_26, main_~b~0=v_main_~b~0_37, main_~p~0=v_main_~p~0_29, main_#t~post6=|v_main_#t~post6_15|, main_~a~0=v_main_~a~0_37} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_#t~post6, main_~a~0] {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 07:20:48,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} [90] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 07:20:48,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} [91] L46-2-->L33-1_primed: Formula: (and (= v_main_~q~0_28 v_main_~q~0_27) (= |v_main_#t~post6_32| |v_main_#t~post6_15|) (= v_~counter~0_29 v_~counter~0_28) (= v_main_~a~0_38 v_main_~a~0_37)) InVars {main_~q~0=v_main_~q~0_28, ~counter~0=v_~counter~0_29, main_#t~post6=|v_main_#t~post6_32|, main_~a~0=v_main_~a~0_38} OutVars{main_~q~0=v_main_~q~0_27, ~counter~0=v_~counter~0_28, main_#t~post6=|v_main_#t~post6_15|, main_~a~0=v_main_~a~0_37} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_#t~post6, main_~a~0] {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 07:20:48,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} [80] L33-1_primed-->L33-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 07:20:48,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= main_~q~0 0) (= main_~a~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 07:20:48,521 INFO L272 TraceCheckUtils]: 25: Hoare triple {3007#(and (= main_~b~0 main_~y~0) (or (and (= (mod main_~x~0 2) 1) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~b~0 main_~p~0 main_~x~0)) (< main_~x~0 (+ main_~a~0 2)) (<= 0 main_~x~0) (= (mod main_~b~0 2) 0) (< main_~a~0 main_~x~0) (not (= main_~b~0 0))) (and (= 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)); {3047#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:20:48,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {3047#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3051#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:20:48,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {3051#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2966#false} is VALID [2022-04-28 07:20:48,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2022-04-28 07:20:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 07:20:48,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:20:54,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2022-04-28 07:20:54,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {3051#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2966#false} is VALID [2022-04-28 07:20:54,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {3047#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3051#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:20:54,977 INFO L272 TraceCheckUtils]: 25: Hoare triple {3067#(= (+ 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)); {3047#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:20:54,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 100);havoc #t~post6; {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [80] L33-1_primed-->L33-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [91] L46-2-->L33-1_primed: Formula: (and (= v_main_~q~0_28 v_main_~q~0_27) (= |v_main_#t~post6_32| |v_main_#t~post6_15|) (= v_~counter~0_29 v_~counter~0_28) (= v_main_~a~0_38 v_main_~a~0_37)) InVars {main_~q~0=v_main_~q~0_28, ~counter~0=v_~counter~0_29, main_#t~post6=|v_main_#t~post6_32|, main_~a~0=v_main_~a~0_38} OutVars{main_~q~0=v_main_~q~0_27, ~counter~0=v_~counter~0_28, main_#t~post6=|v_main_#t~post6_15|, main_~a~0=v_main_~a~0_37} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_#t~post6, main_~a~0] {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [90] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [89] L46-2-->L33-1_primed: Formula: (let ((.cse2 (+ (* v_main_~p~0_29 v_main_~a~0_38 v_main_~b~0_37) v_main_~q~0_28))) (let ((.cse7 (= v_main_~q~0_28 v_main_~q~0_27)) (.cse1 (= (mod v_main_~b~0_37 2) 0)) (.cse0 (= 0 v_main_~b~0_37)) (.cse6 (<= 0 v_main_~a~0_38)) (.cse3 (= (mod v_main_~a~0_38 2) 1)) (.cse4 (= (* v_main_~x~0_22 v_main_~y~0_26) .cse2)) (.cse5 (< v_~counter~0_29 100)) (.cse8 (= v_~counter~0_29 v_~counter~0_28)) (.cse9 (= |v_main_#t~post6_29| |v_main_#t~post6_15|)) (.cse10 (= v_main_~a~0_38 v_main_~a~0_37))) (or (and (not .cse0) .cse1 (< v_main_~a~0_37 v_main_~a~0_38) (= (+ v_main_~q~0_27 (* v_main_~p~0_29 v_main_~a~0_37 v_main_~b~0_37)) .cse2) .cse3 (< v_main_~a~0_38 (+ 2 v_main_~a~0_37)) .cse4 (= (+ v_~counter~0_29 v_main_~a~0_38) (+ v_~counter~0_28 v_main_~a~0_37)) .cse5 .cse6) (and .cse7 (= v_main_~p~0_29 v_main_~p~0_29) (= v_main_~b~0_37 v_main_~b~0_37) .cse8 (= v_main_~x~0_22 v_main_~x~0_22) .cse9 (= v_main_~y~0_26 v_main_~y~0_26) .cse10) (and .cse7 (or (not .cse1) .cse0 (not .cse6) (not .cse3) (not .cse4) (not .cse5)) .cse8 .cse9 .cse10)))) InVars {main_~q~0=v_main_~q~0_28, ~counter~0=v_~counter~0_29, main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_26, main_~b~0=v_main_~b~0_37, main_~p~0=v_main_~p~0_29, main_#t~post6=|v_main_#t~post6_29|, main_~a~0=v_main_~a~0_38} OutVars{main_~q~0=v_main_~q~0_27, ~counter~0=v_~counter~0_28, main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_26, main_~b~0=v_main_~b~0_37, main_~p~0=v_main_~p~0_29, main_#t~post6=|v_main_#t~post6_15|, main_~a~0=v_main_~a~0_37} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_#t~post6, main_~a~0] {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [88] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [87] L46-2-->L33-1_primed: Formula: (and (= v_main_~q~0_28 v_main_~q~0_27) (= v_~counter~0_29 v_~counter~0_28) (= |v_main_#t~post6_26| |v_main_#t~post6_15|) (= v_main_~a~0_38 v_main_~a~0_37)) InVars {main_~q~0=v_main_~q~0_28, ~counter~0=v_~counter~0_29, main_#t~post6=|v_main_#t~post6_26|, main_~a~0=v_main_~a~0_38} OutVars{main_~q~0=v_main_~q~0_27, ~counter~0=v_~counter~0_28, main_#t~post6=|v_main_#t~post6_15|, main_~a~0=v_main_~a~0_37} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_#t~post6, main_~a~0] {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [86] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [85] L46-2-->L33-1_primed: Formula: (and (= v_main_~q~0_28 v_main_~q~0_27) (= v_~counter~0_29 v_~counter~0_28) (= |v_main_#t~post6_23| |v_main_#t~post6_15|) (= v_main_~a~0_38 v_main_~a~0_37)) InVars {main_~q~0=v_main_~q~0_28, ~counter~0=v_~counter~0_29, main_#t~post6=|v_main_#t~post6_23|, main_~a~0=v_main_~a~0_38} OutVars{main_~q~0=v_main_~q~0_27, ~counter~0=v_~counter~0_28, main_#t~post6=|v_main_#t~post6_15|, main_~a~0=v_main_~a~0_37} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_#t~post6, main_~a~0] {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [84] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [83] L46-2-->L33-1_primed: Formula: (and (= v_main_~q~0_28 v_main_~q~0_27) (= |v_main_#t~post6_20| |v_main_#t~post6_15|) (= v_~counter~0_29 v_~counter~0_28) (= v_main_~a~0_38 v_main_~a~0_37)) InVars {main_~q~0=v_main_~q~0_28, ~counter~0=v_~counter~0_29, main_#t~post6=|v_main_#t~post6_20|, main_~a~0=v_main_~a~0_38} OutVars{main_~q~0=v_main_~q~0_27, ~counter~0=v_~counter~0_28, main_#t~post6=|v_main_#t~post6_15|, main_~a~0=v_main_~a~0_37} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_#t~post6, main_~a~0] {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [82] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} [81] L46-2-->L33-1_primed: Formula: (let ((.cse6 (+ (* v_main_~p~0_29 v_main_~a~0_38 v_main_~b~0_37) v_main_~q~0_28))) (let ((.cse0 (= v_main_~q~0_28 v_main_~q~0_27)) (.cse1 (= |v_main_#t~post6_17| |v_main_#t~post6_15|)) (.cse5 (= (mod v_main_~b~0_37 2) 0)) (.cse4 (= 0 v_main_~b~0_37)) (.cse10 (<= 0 v_main_~a~0_38)) (.cse7 (= (mod v_main_~a~0_38 2) 1)) (.cse8 (= (* v_main_~x~0_22 v_main_~y~0_26) .cse6)) (.cse9 (< v_~counter~0_29 100)) (.cse2 (= v_~counter~0_29 v_~counter~0_28)) (.cse3 (= v_main_~a~0_38 v_main_~a~0_37))) (or (and .cse0 (= v_main_~p~0_29 v_main_~p~0_29) .cse1 (= v_main_~b~0_37 v_main_~b~0_37) .cse2 (= v_main_~x~0_22 v_main_~x~0_22) (= v_main_~y~0_26 v_main_~y~0_26) .cse3) (and (not .cse4) .cse5 (< v_main_~a~0_37 v_main_~a~0_38) (= (+ v_main_~q~0_27 (* v_main_~p~0_29 v_main_~a~0_37 v_main_~b~0_37)) .cse6) .cse7 (< v_main_~a~0_38 (+ 2 v_main_~a~0_37)) .cse8 (= (+ v_~counter~0_29 v_main_~a~0_38) (+ v_~counter~0_28 v_main_~a~0_37)) .cse9 .cse10) (and .cse0 .cse1 (or (not .cse5) .cse4 (not .cse10) (not .cse7) (not .cse8) (not .cse9)) .cse2 .cse3)))) InVars {main_~q~0=v_main_~q~0_28, ~counter~0=v_~counter~0_29, main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_26, main_~b~0=v_main_~b~0_37, main_~p~0=v_main_~p~0_29, main_#t~post6=|v_main_#t~post6_17|, main_~a~0=v_main_~a~0_38} OutVars{main_~q~0=v_main_~q~0_27, ~counter~0=v_~counter~0_28, main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_26, main_~b~0=v_main_~b~0_37, main_~p~0=v_main_~p~0_29, main_#t~post6=|v_main_#t~post6_15|, main_~a~0=v_main_~a~0_37} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_#t~post6, main_~a~0] {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3067#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:20:54,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2965#true} {2965#true} #69#return; {2965#true} is VALID [2022-04-28 07:20:54,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-28 07:20:54,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {2965#true} assume !(0 == ~cond); {2965#true} is VALID [2022-04-28 07:20:54,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#true} ~cond := #in~cond; {2965#true} is VALID [2022-04-28 07:20:54,993 INFO L272 TraceCheckUtils]: 6: Hoare triple {2965#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2965#true} is VALID [2022-04-28 07:20:54,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2965#true} is VALID [2022-04-28 07:20:54,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {2965#true} call #t~ret7 := main(); {2965#true} is VALID [2022-04-28 07:20:54,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2965#true} {2965#true} #77#return; {2965#true} is VALID [2022-04-28 07:20:54,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-28 07:20:54,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#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);~counter~0 := 0; {2965#true} is VALID [2022-04-28 07:20:54,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {2965#true} is VALID [2022-04-28 07:20:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 07:20:54,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:20:54,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333326466] [2022-04-28 07:20:54,994 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:20:54,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872843480] [2022-04-28 07:20:54,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872843480] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:20:54,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:20:54,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:20:55,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:20:55,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [416133672] [2022-04-28 07:20:55,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [416133672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:20:55,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:20:55,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 07:20:55,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122965045] [2022-04-28 07:20:55,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:20:55,405 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-28 07:20:55,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:20:55,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:20:55,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:20:55,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 07:20:55,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:20:55,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 07:20:55,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:20:55,433 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:20:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:20:56,300 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-04-28 07:20:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 07:20:56,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-28 07:20:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:20:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:20:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-28 07:20:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:20:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-28 07:20:56,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2022-04-28 07:20:56,363 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 07:20:56,365 INFO L225 Difference]: With dead ends: 73 [2022-04-28 07:20:56,365 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 07:20:56,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:20:56,365 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 07:20:56,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 108 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 07:20:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 07:20:56,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2022-04-28 07:20:56,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:20:56,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 66 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 51 states have internal predecessors, (64), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:20:56,449 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 66 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 51 states have internal predecessors, (64), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:20:56,449 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 66 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 51 states have internal predecessors, (64), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:20:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:20:56,451 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2022-04-28 07:20:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2022-04-28 07:20:56,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:20:56,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:20:56,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 51 states have internal predecessors, (64), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 71 states. [2022-04-28 07:20:56,452 INFO L87 Difference]: Start difference. First operand has 66 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 51 states have internal predecessors, (64), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 71 states. [2022-04-28 07:20:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:20:56,453 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2022-04-28 07:20:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2022-04-28 07:20:56,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:20:56,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:20:56,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:20:56,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:20:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 51 states have internal predecessors, (64), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:20:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2022-04-28 07:20:56,455 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 28 [2022-04-28 07:20:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:20:56,456 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2022-04-28 07:20:56,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:20:56,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 83 transitions. [2022-04-28 07:20:58,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 82 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:20:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2022-04-28 07:20:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 07:20:58,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:20:58,680 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 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 07:20:58,701 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 07:20:58,880 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 07:20:58,880 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:20:58,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:20:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1680888588, now seen corresponding path program 1 times [2022-04-28 07:20:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:20:58,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1026303142] [2022-04-28 07:21:04,950 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 07:21:04,950 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 07:21:04,950 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 07:21:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1680888588, now seen corresponding path program 2 times [2022-04-28 07:21:04,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:21:04,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498731790] [2022-04-28 07:21:04,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:21:04,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:21:04,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:21:04,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1741704751] [2022-04-28 07:21:04,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:21:04,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:21:04,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:21:04,967 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 07:21:04,968 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 07:21:05,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:21:05,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:21:05,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 07:21:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:21:05,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:21:05,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {3572#true} call ULTIMATE.init(); {3572#true} is VALID [2022-04-28 07:21:05,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {3572#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);~counter~0 := 0; {3572#true} is VALID [2022-04-28 07:21:05,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {3572#true} assume true; {3572#true} is VALID [2022-04-28 07:21:05,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3572#true} {3572#true} #77#return; {3572#true} is VALID [2022-04-28 07:21:05,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {3572#true} call #t~ret7 := main(); {3572#true} is VALID [2022-04-28 07:21:05,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {3572#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3572#true} is VALID [2022-04-28 07:21:05,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {3572#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3572#true} is VALID [2022-04-28 07:21:05,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {3572#true} ~cond := #in~cond; {3598#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:21:05,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {3598#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3602#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:21:05,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {3602#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3602#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:21:05,395 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3602#(not (= |assume_abort_if_not_#in~cond| 0))} {3572#true} #69#return; {3609#(<= 1 main_~y~0)} is VALID [2022-04-28 07:21:05,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {3609#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3613#(<= 1 main_~b~0)} is VALID [2022-04-28 07:21:05,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {3613#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3613#(<= 1 main_~b~0)} is VALID [2022-04-28 07:21:05,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {3613#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {3613#(<= 1 main_~b~0)} is VALID [2022-04-28 07:21:05,396 INFO L272 TraceCheckUtils]: 14: Hoare triple {3613#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3572#true} is VALID [2022-04-28 07:21:05,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {3572#true} ~cond := #in~cond; {3572#true} is VALID [2022-04-28 07:21:05,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {3572#true} assume !(0 == ~cond); {3572#true} is VALID [2022-04-28 07:21:05,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {3572#true} assume true; {3572#true} is VALID [2022-04-28 07:21:05,397 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3572#true} {3613#(<= 1 main_~b~0)} #71#return; {3613#(<= 1 main_~b~0)} is VALID [2022-04-28 07:21:05,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {3613#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {3638#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 07:21:05,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {3638#(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);~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; {3638#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 07:21:05,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {3638#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3638#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 07:21:05,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {3638#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !!(#t~post6 < 100);havoc #t~post6; {3638#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 07:21:05,399 INFO L272 TraceCheckUtils]: 23: Hoare triple {3638#(and (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)); {3572#true} is VALID [2022-04-28 07:21:05,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {3572#true} ~cond := #in~cond; {3572#true} is VALID [2022-04-28 07:21:05,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {3572#true} assume !(0 == ~cond); {3572#true} is VALID [2022-04-28 07:21:05,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {3572#true} assume true; {3572#true} is VALID [2022-04-28 07:21:05,400 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3572#true} {3638#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} #71#return; {3638#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 07:21:05,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {3638#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {3573#false} is VALID [2022-04-28 07:21:05,400 INFO L272 TraceCheckUtils]: 29: Hoare triple {3573#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {3573#false} is VALID [2022-04-28 07:21:05,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {3573#false} ~cond := #in~cond; {3573#false} is VALID [2022-04-28 07:21:05,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {3573#false} assume 0 == ~cond; {3573#false} is VALID [2022-04-28 07:21:05,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {3573#false} assume !false; {3573#false} is VALID [2022-04-28 07:21:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:21:05,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:21:05,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:21:05,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498731790] [2022-04-28 07:21:05,401 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:21:05,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741704751] [2022-04-28 07:21:05,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741704751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:21:05,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:21:05,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:21:05,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:21:05,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1026303142] [2022-04-28 07:21:05,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1026303142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:21:05,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:21:05,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:21:05,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878797477] [2022-04-28 07:21:05,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:21:05,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-04-28 07:21:05,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:21:05,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:21:05,427 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 07:21:05,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:21:05,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:21:05,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:21:05,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:21:05,428 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:21:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:21:05,721 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2022-04-28 07:21:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:21:05,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-04-28 07:21:05,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:21:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:21:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 07:21:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:21:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 07:21:05,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-28 07:21:05,772 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 07:21:05,773 INFO L225 Difference]: With dead ends: 82 [2022-04-28 07:21:05,773 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 07:21:05,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:21:05,774 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:21:05,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 110 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:21:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 07:21:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-04-28 07:21:05,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:21:05,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 70 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 54 states have internal predecessors, (68), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:21:05,878 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 70 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 54 states have internal predecessors, (68), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:21:05,879 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 70 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 54 states have internal predecessors, (68), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:21:05,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:21:05,880 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2022-04-28 07:21:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2022-04-28 07:21:05,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:21:05,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:21:05,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 54 states have internal predecessors, (68), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 75 states. [2022-04-28 07:21:05,881 INFO L87 Difference]: Start difference. First operand has 70 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 54 states have internal predecessors, (68), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 75 states. [2022-04-28 07:21:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:21:05,883 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2022-04-28 07:21:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2022-04-28 07:21:05,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:21:05,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:21:05,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:21:05,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:21:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 54 states have internal predecessors, (68), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:21:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-04-28 07:21:05,885 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 33 [2022-04-28 07:21:05,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:21:05,885 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-04-28 07:21:05,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:21:05,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 89 transitions. [2022-04-28 07:21:08,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 88 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:21:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-04-28 07:21:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 07:21:08,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:21:08,086 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:21:08,102 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 07:21:08,287 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 07:21:08,287 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:21:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:21:08,289 INFO L85 PathProgramCache]: Analyzing trace with hash 368374993, now seen corresponding path program 1 times [2022-04-28 07:21:08,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:21:08,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [902993345] [2022-04-28 07:21:14,396 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 07:21:14,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 07:21:14,497 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 07:21:15,927 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 07:21:17,810 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 07:21:17,858 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 07:21:17,858 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 07:21:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1745517901, now seen corresponding path program 1 times [2022-04-28 07:21:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:21:17,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511671320] [2022-04-28 07:21:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:21:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:21:17,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:21:17,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366776232] [2022-04-28 07:21:17,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:21:17,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:21:17,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:21:17,882 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 07:21:17,883 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 07:21:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:21:17,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 07:21:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:21:17,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:21:27,820 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 07:21:28,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {4137#true} call ULTIMATE.init(); {4137#true} is VALID [2022-04-28 07:21:28,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {4137#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);~counter~0 := 0; {4137#true} is VALID [2022-04-28 07:21:28,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {4137#true} assume true; {4137#true} is VALID [2022-04-28 07:21:28,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4137#true} {4137#true} #77#return; {4137#true} is VALID [2022-04-28 07:21:28,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {4137#true} call #t~ret7 := main(); {4137#true} is VALID [2022-04-28 07:21:28,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {4137#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4137#true} is VALID [2022-04-28 07:21:28,521 INFO L272 TraceCheckUtils]: 6: Hoare triple {4137#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4137#true} is VALID [2022-04-28 07:21:28,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {4137#true} ~cond := #in~cond; {4163#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:21:28,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {4163#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4167#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:21:28,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {4167#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4167#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:21:28,522 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4167#(not (= |assume_abort_if_not_#in~cond| 0))} {4137#true} #69#return; {4174#(<= 1 main_~y~0)} is VALID [2022-04-28 07:21:28,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {4174#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [93] L46-2-->L33-1_primed: Formula: (and (= |v_main_#t~post6_53| |v_main_#t~post6_51|) (= v_~counter~0_68 v_~counter~0_67) (= v_main_~b~0_54 v_main_~b~0_53) (= v_main_~q~0_72 v_main_~q~0_71)) InVars {main_~q~0=v_main_~q~0_72, ~counter~0=v_~counter~0_68, main_~b~0=v_main_~b~0_54, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~q~0=v_main_~q~0_71, ~counter~0=v_~counter~0_67, main_~b~0=v_main_~b~0_53, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_#t~post6] {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [94] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [95] L46-2-->L33-1_primed: Formula: (and (= v_~counter~0_68 v_~counter~0_67) (= v_main_~b~0_54 v_main_~b~0_53) (= v_main_~q~0_72 v_main_~q~0_71) (= |v_main_#t~post6_56| |v_main_#t~post6_51|)) InVars {main_~q~0=v_main_~q~0_72, ~counter~0=v_~counter~0_68, main_~b~0=v_main_~b~0_54, main_#t~post6=|v_main_#t~post6_56|} OutVars{main_~q~0=v_main_~q~0_71, ~counter~0=v_~counter~0_67, main_~b~0=v_main_~b~0_53, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_#t~post6] {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [96] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [97] L46-2-->L33-1_primed: Formula: (and (= |v_main_#t~post6_59| |v_main_#t~post6_51|) (= v_~counter~0_68 v_~counter~0_67) (= v_main_~b~0_54 v_main_~b~0_53) (= v_main_~q~0_72 v_main_~q~0_71)) InVars {main_~q~0=v_main_~q~0_72, ~counter~0=v_~counter~0_68, main_~b~0=v_main_~b~0_54, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~q~0=v_main_~q~0_71, ~counter~0=v_~counter~0_67, main_~b~0=v_main_~b~0_53, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_#t~post6] {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [98] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {4178#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} [99] L46-2-->L33-1_primed: Formula: (let ((.cse10 (+ v_main_~q~0_72 (* v_main_~p~0_44 v_main_~a~0_83 v_main_~b~0_54)))) (let ((.cse0 (= |v_main_#t~post6_62| |v_main_#t~post6_51|)) (.cse1 (= v_~counter~0_68 v_~counter~0_67)) (.cse2 (= v_main_~b~0_54 v_main_~b~0_53)) (.cse3 (= v_main_~q~0_72 v_main_~q~0_71)) (.cse4 (= .cse10 (* v_main_~x~0_35 v_main_~y~0_39))) (.cse8 (= 0 (mod v_main_~a~0_83 2))) (.cse7 (= (mod v_main_~b~0_54 2) 1)) (.cse9 (<= 0 v_main_~b~0_54)) (.cse5 (= 0 v_main_~a~0_83)) (.cse6 (< v_~counter~0_68 100))) (or (and (= v_main_~a~0_83 v_main_~a~0_83) (= v_main_~y~0_39 v_main_~y~0_39) .cse0 .cse1 .cse2 .cse3 (= v_main_~p~0_44 v_main_~p~0_44) (= v_main_~x~0_35 v_main_~x~0_35)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) .cse5 (not .cse6) (not .cse7) (not .cse8) (not .cse9))) (and .cse4 .cse8 .cse7 (= .cse10 (+ (* v_main_~p~0_44 v_main_~a~0_83 v_main_~b~0_53) v_main_~q~0_71)) (<= (+ (div v_main_~b~0_53 (- 2)) v_main_~b~0_54) (+ (div v_main_~b~0_54 2) 1)) .cse9 (not .cse5) (= (+ v_~counter~0_68 v_main_~b~0_54) (+ v_~counter~0_67 v_main_~b~0_53)) .cse6 (< v_main_~b~0_53 v_main_~b~0_54))))) InVars {main_~q~0=v_main_~q~0_72, ~counter~0=v_~counter~0_68, main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_39, main_~b~0=v_main_~b~0_54, main_~p~0=v_main_~p~0_44, main_#t~post6=|v_main_#t~post6_62|, main_~a~0=v_main_~a~0_83} OutVars{main_~q~0=v_main_~q~0_71, ~counter~0=v_~counter~0_67, main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_39, main_~b~0=v_main_~b~0_53, main_~p~0=v_main_~p~0_44, main_#t~post6=|v_main_#t~post6_51|, main_~a~0=v_main_~a~0_83} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_#t~post6] {4200#(and (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (< (+ (div main_~b~0 (- 2)) (div (+ (* ~counter~0 (- 1)) (* (- 1) main_~b~0) 100) (- 2))) 1) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~p~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {4200#(and (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (< (+ (div main_~b~0 (- 2)) (div (+ (* ~counter~0 (- 1)) (* (- 1) main_~b~0) 100) (- 2))) 1) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~p~0) (<= 1 main_~y~0))} [100] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4200#(and (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (< (+ (div main_~b~0 (- 2)) (div (+ (* ~counter~0 (- 1)) (* (- 1) main_~b~0) 100) (- 2))) 1) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~p~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {4200#(and (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (< (+ (div main_~b~0 (- 2)) (div (+ (* ~counter~0 (- 1)) (* (- 1) main_~b~0) 100) (- 2))) 1) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~p~0) (<= 1 main_~y~0))} [101] L46-2-->L33-1_primed: Formula: (let ((.cse10 (+ v_main_~q~0_72 (* v_main_~p~0_44 v_main_~a~0_83 v_main_~b~0_54)))) (let ((.cse0 (= |v_main_#t~post6_65| |v_main_#t~post6_51|)) (.cse1 (= v_~counter~0_68 v_~counter~0_67)) (.cse2 (= v_main_~b~0_54 v_main_~b~0_53)) (.cse3 (= v_main_~q~0_72 v_main_~q~0_71)) (.cse4 (= .cse10 (* v_main_~x~0_35 v_main_~y~0_39))) (.cse8 (= 0 (mod v_main_~a~0_83 2))) (.cse7 (= (mod v_main_~b~0_54 2) 1)) (.cse9 (<= 0 v_main_~b~0_54)) (.cse5 (= 0 v_main_~a~0_83)) (.cse6 (< v_~counter~0_68 100))) (or (and .cse0 (= v_main_~a~0_83 v_main_~a~0_83) (= v_main_~y~0_39 v_main_~y~0_39) .cse1 .cse2 .cse3 (= v_main_~p~0_44 v_main_~p~0_44) (= v_main_~x~0_35 v_main_~x~0_35)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) .cse5 (not .cse6) (not .cse7) (not .cse8) (not .cse9))) (and .cse4 .cse8 .cse7 (= .cse10 (+ (* v_main_~p~0_44 v_main_~a~0_83 v_main_~b~0_53) v_main_~q~0_71)) (<= (+ (div v_main_~b~0_53 (- 2)) v_main_~b~0_54) (+ (div v_main_~b~0_54 2) 1)) .cse9 (not .cse5) (= (+ v_~counter~0_68 v_main_~b~0_54) (+ v_~counter~0_67 v_main_~b~0_53)) .cse6 (< v_main_~b~0_53 v_main_~b~0_54))))) InVars {main_~q~0=v_main_~q~0_72, ~counter~0=v_~counter~0_68, main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_39, main_~b~0=v_main_~b~0_54, main_~p~0=v_main_~p~0_44, main_#t~post6=|v_main_#t~post6_65|, main_~a~0=v_main_~a~0_83} OutVars{main_~q~0=v_main_~q~0_71, ~counter~0=v_~counter~0_67, main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_39, main_~b~0=v_main_~b~0_53, main_~p~0=v_main_~p~0_44, main_#t~post6=|v_main_#t~post6_51|, main_~a~0=v_main_~a~0_83} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_#t~post6] {4207#(and (<= 1 main_~p~0) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {4207#(and (<= 1 main_~p~0) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} [102] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4207#(and (<= 1 main_~p~0) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {4207#(and (<= 1 main_~p~0) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} [103] L46-2-->L33-1_primed: Formula: (and (= v_~counter~0_68 v_~counter~0_67) (= |v_main_#t~post6_68| |v_main_#t~post6_51|) (= v_main_~b~0_54 v_main_~b~0_53) (= v_main_~q~0_72 v_main_~q~0_71)) InVars {main_~q~0=v_main_~q~0_72, ~counter~0=v_~counter~0_68, main_~b~0=v_main_~b~0_54, main_#t~post6=|v_main_#t~post6_68|} OutVars{main_~q~0=v_main_~q~0_71, ~counter~0=v_~counter~0_67, main_~b~0=v_main_~b~0_53, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_#t~post6] {4207#(and (<= 1 main_~p~0) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {4207#(and (<= 1 main_~p~0) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} [92] L33-1_primed-->L33-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4207#(and (<= 1 main_~p~0) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {4207#(and (<= 1 main_~p~0) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} assume !!(#t~post6 < 100);havoc #t~post6; {4207#(and (<= 1 main_~p~0) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:28,533 INFO L272 TraceCheckUtils]: 25: Hoare triple {4207#(and (<= 1 main_~p~0) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 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)); {4137#true} is VALID [2022-04-28 07:21:28,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {4137#true} ~cond := #in~cond; {4226#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:21:28,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {4226#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:21:28,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {4230#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:21:30,537 WARN L284 TraceCheckUtils]: 29: Hoare quadruple {4230#(not (= |__VERIFIER_assert_#in~cond| 0))} {4207#(and (<= 1 main_~p~0) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} #71#return; {4237#(and (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)))) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} is UNKNOWN [2022-04-28 07:21:30,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {4237#(and (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)))) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {4241#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 07:21:30,539 INFO L272 TraceCheckUtils]: 31: Hoare triple {4241#(and (= 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)); {4245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:21:30,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {4245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:21:30,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {4249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4138#false} is VALID [2022-04-28 07:21:30,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {4138#false} assume !false; {4138#false} is VALID [2022-04-28 07:21:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 07:21:30,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:22:06,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {4138#false} assume !false; {4138#false} is VALID [2022-04-28 07:22:06,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {4249#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4138#false} is VALID [2022-04-28 07:22:06,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {4245#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4249#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:22:06,259 INFO L272 TraceCheckUtils]: 31: Hoare triple {4265#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4245#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:22:06,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {4269#(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); {4265#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:22:06,262 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4230#(not (= |__VERIFIER_assert_#in~cond| 0))} {4137#true} #71#return; {4269#(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 07:22:06,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {4230#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:22:06,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {4282#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:22:06,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {4137#true} ~cond := #in~cond; {4282#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 07:22:06,263 INFO L272 TraceCheckUtils]: 25: Hoare triple {4137#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4137#true} is VALID [2022-04-28 07:22:06,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {4137#true} assume !!(#t~post6 < 100);havoc #t~post6; {4137#true} is VALID [2022-04-28 07:22:06,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {4137#true} [92] L33-1_primed-->L33-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4137#true} is VALID [2022-04-28 07:22:06,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {4137#true} [103] L46-2-->L33-1_primed: Formula: (and (= v_~counter~0_68 v_~counter~0_67) (= |v_main_#t~post6_68| |v_main_#t~post6_51|) (= v_main_~b~0_54 v_main_~b~0_53) (= v_main_~q~0_72 v_main_~q~0_71)) InVars {main_~q~0=v_main_~q~0_72, ~counter~0=v_~counter~0_68, main_~b~0=v_main_~b~0_54, main_#t~post6=|v_main_#t~post6_68|} OutVars{main_~q~0=v_main_~q~0_71, ~counter~0=v_~counter~0_67, main_~b~0=v_main_~b~0_53, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_#t~post6] {4137#true} is VALID [2022-04-28 07:22:06,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {4137#true} [102] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4137#true} is VALID [2022-04-28 07:22:06,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {4137#true} [101] L46-2-->L33-1_primed: Formula: (let ((.cse10 (+ v_main_~q~0_72 (* v_main_~p~0_44 v_main_~a~0_83 v_main_~b~0_54)))) (let ((.cse0 (= |v_main_#t~post6_65| |v_main_#t~post6_51|)) (.cse1 (= v_~counter~0_68 v_~counter~0_67)) (.cse2 (= v_main_~b~0_54 v_main_~b~0_53)) (.cse3 (= v_main_~q~0_72 v_main_~q~0_71)) (.cse4 (= .cse10 (* v_main_~x~0_35 v_main_~y~0_39))) (.cse8 (= 0 (mod v_main_~a~0_83 2))) (.cse7 (= (mod v_main_~b~0_54 2) 1)) (.cse9 (<= 0 v_main_~b~0_54)) (.cse5 (= 0 v_main_~a~0_83)) (.cse6 (< v_~counter~0_68 100))) (or (and .cse0 (= v_main_~a~0_83 v_main_~a~0_83) (= v_main_~y~0_39 v_main_~y~0_39) .cse1 .cse2 .cse3 (= v_main_~p~0_44 v_main_~p~0_44) (= v_main_~x~0_35 v_main_~x~0_35)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) .cse5 (not .cse6) (not .cse7) (not .cse8) (not .cse9))) (and .cse4 .cse8 .cse7 (= .cse10 (+ (* v_main_~p~0_44 v_main_~a~0_83 v_main_~b~0_53) v_main_~q~0_71)) (<= (+ (div v_main_~b~0_53 (- 2)) v_main_~b~0_54) (+ (div v_main_~b~0_54 2) 1)) .cse9 (not .cse5) (= (+ v_~counter~0_68 v_main_~b~0_54) (+ v_~counter~0_67 v_main_~b~0_53)) .cse6 (< v_main_~b~0_53 v_main_~b~0_54))))) InVars {main_~q~0=v_main_~q~0_72, ~counter~0=v_~counter~0_68, main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_39, main_~b~0=v_main_~b~0_54, main_~p~0=v_main_~p~0_44, main_#t~post6=|v_main_#t~post6_65|, main_~a~0=v_main_~a~0_83} OutVars{main_~q~0=v_main_~q~0_71, ~counter~0=v_~counter~0_67, main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_39, main_~b~0=v_main_~b~0_53, main_~p~0=v_main_~p~0_44, main_#t~post6=|v_main_#t~post6_51|, main_~a~0=v_main_~a~0_83} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_#t~post6] {4137#true} is VALID [2022-04-28 07:22:06,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {4137#true} [100] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4137#true} is VALID [2022-04-28 07:22:06,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {4137#true} [99] L46-2-->L33-1_primed: Formula: (let ((.cse10 (+ v_main_~q~0_72 (* v_main_~p~0_44 v_main_~a~0_83 v_main_~b~0_54)))) (let ((.cse0 (= |v_main_#t~post6_62| |v_main_#t~post6_51|)) (.cse1 (= v_~counter~0_68 v_~counter~0_67)) (.cse2 (= v_main_~b~0_54 v_main_~b~0_53)) (.cse3 (= v_main_~q~0_72 v_main_~q~0_71)) (.cse4 (= .cse10 (* v_main_~x~0_35 v_main_~y~0_39))) (.cse8 (= 0 (mod v_main_~a~0_83 2))) (.cse7 (= (mod v_main_~b~0_54 2) 1)) (.cse9 (<= 0 v_main_~b~0_54)) (.cse5 (= 0 v_main_~a~0_83)) (.cse6 (< v_~counter~0_68 100))) (or (and (= v_main_~a~0_83 v_main_~a~0_83) (= v_main_~y~0_39 v_main_~y~0_39) .cse0 .cse1 .cse2 .cse3 (= v_main_~p~0_44 v_main_~p~0_44) (= v_main_~x~0_35 v_main_~x~0_35)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) .cse5 (not .cse6) (not .cse7) (not .cse8) (not .cse9))) (and .cse4 .cse8 .cse7 (= .cse10 (+ (* v_main_~p~0_44 v_main_~a~0_83 v_main_~b~0_53) v_main_~q~0_71)) (<= (+ (div v_main_~b~0_53 (- 2)) v_main_~b~0_54) (+ (div v_main_~b~0_54 2) 1)) .cse9 (not .cse5) (= (+ v_~counter~0_68 v_main_~b~0_54) (+ v_~counter~0_67 v_main_~b~0_53)) .cse6 (< v_main_~b~0_53 v_main_~b~0_54))))) InVars {main_~q~0=v_main_~q~0_72, ~counter~0=v_~counter~0_68, main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_39, main_~b~0=v_main_~b~0_54, main_~p~0=v_main_~p~0_44, main_#t~post6=|v_main_#t~post6_62|, main_~a~0=v_main_~a~0_83} OutVars{main_~q~0=v_main_~q~0_71, ~counter~0=v_~counter~0_67, main_~x~0=v_main_~x~0_35, main_~y~0=v_main_~y~0_39, main_~b~0=v_main_~b~0_53, main_~p~0=v_main_~p~0_44, main_#t~post6=|v_main_#t~post6_51|, main_~a~0=v_main_~a~0_83} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_#t~post6] {4137#true} is VALID [2022-04-28 07:22:06,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {4137#true} [98] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4137#true} is VALID [2022-04-28 07:22:06,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {4137#true} [97] L46-2-->L33-1_primed: Formula: (and (= |v_main_#t~post6_59| |v_main_#t~post6_51|) (= v_~counter~0_68 v_~counter~0_67) (= v_main_~b~0_54 v_main_~b~0_53) (= v_main_~q~0_72 v_main_~q~0_71)) InVars {main_~q~0=v_main_~q~0_72, ~counter~0=v_~counter~0_68, main_~b~0=v_main_~b~0_54, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~q~0=v_main_~q~0_71, ~counter~0=v_~counter~0_67, main_~b~0=v_main_~b~0_53, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_#t~post6] {4137#true} is VALID [2022-04-28 07:22:06,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {4137#true} [96] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4137#true} is VALID [2022-04-28 07:22:06,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {4137#true} [95] L46-2-->L33-1_primed: Formula: (and (= v_~counter~0_68 v_~counter~0_67) (= v_main_~b~0_54 v_main_~b~0_53) (= v_main_~q~0_72 v_main_~q~0_71) (= |v_main_#t~post6_56| |v_main_#t~post6_51|)) InVars {main_~q~0=v_main_~q~0_72, ~counter~0=v_~counter~0_68, main_~b~0=v_main_~b~0_54, main_#t~post6=|v_main_#t~post6_56|} OutVars{main_~q~0=v_main_~q~0_71, ~counter~0=v_~counter~0_67, main_~b~0=v_main_~b~0_53, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_#t~post6] {4137#true} is VALID [2022-04-28 07:22:06,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {4137#true} [94] L33-1_primed-->L46-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4137#true} is VALID [2022-04-28 07:22:06,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {4137#true} [93] L46-2-->L33-1_primed: Formula: (and (= |v_main_#t~post6_53| |v_main_#t~post6_51|) (= v_~counter~0_68 v_~counter~0_67) (= v_main_~b~0_54 v_main_~b~0_53) (= v_main_~q~0_72 v_main_~q~0_71)) InVars {main_~q~0=v_main_~q~0_72, ~counter~0=v_~counter~0_68, main_~b~0=v_main_~b~0_54, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~q~0=v_main_~q~0_71, ~counter~0=v_~counter~0_67, main_~b~0=v_main_~b~0_53, main_#t~post6=|v_main_#t~post6_51|} AuxVars[] AssignedVars[main_~q~0, ~counter~0, main_~b~0, main_#t~post6] {4137#true} is VALID [2022-04-28 07:22:06,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {4137#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4137#true} is VALID [2022-04-28 07:22:06,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4137#true} {4137#true} #69#return; {4137#true} is VALID [2022-04-28 07:22:06,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {4137#true} assume true; {4137#true} is VALID [2022-04-28 07:22:06,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {4137#true} assume !(0 == ~cond); {4137#true} is VALID [2022-04-28 07:22:06,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {4137#true} ~cond := #in~cond; {4137#true} is VALID [2022-04-28 07:22:06,274 INFO L272 TraceCheckUtils]: 6: Hoare triple {4137#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4137#true} is VALID [2022-04-28 07:22:06,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {4137#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4137#true} is VALID [2022-04-28 07:22:06,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {4137#true} call #t~ret7 := main(); {4137#true} is VALID [2022-04-28 07:22:06,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4137#true} {4137#true} #77#return; {4137#true} is VALID [2022-04-28 07:22:06,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {4137#true} assume true; {4137#true} is VALID [2022-04-28 07:22:06,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {4137#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);~counter~0 := 0; {4137#true} is VALID [2022-04-28 07:22:06,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {4137#true} call ULTIMATE.init(); {4137#true} is VALID [2022-04-28 07:22:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 07:22:06,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:22:06,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511671320] [2022-04-28 07:22:06,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:22:06,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366776232] [2022-04-28 07:22:06,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366776232] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:22:06,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:22:06,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 17 [2022-04-28 07:22:10,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:22:10,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [902993345] [2022-04-28 07:22:10,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [902993345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:22:10,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:22:10,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 07:22:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824576701] [2022-04-28 07:22:10,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:22:10,893 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 18 states have internal predecessors, (25), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-28 07:22:10,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:22:10,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 18 states have internal predecessors, (25), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 07:22:10,916 WARN L143 InductivityCheck]: Transition 4370#(and (= (mod (+ main_~b~0 1) 2) 1) (= (mod main_~a~0 2) 0) (< ~counter~0 101) (<= 0 (+ main_~b~0 1)) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (not (= main_~a~0 0))) ( _ , #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; , 4207#(and (<= 1 main_~p~0) (or (<= main_~y~0 main_~b~0) (and (= (mod main_~a~0 2) 0) (<= (+ (div main_~b~0 (- 2)) (div (+ (* (- 1) main_~y~0) 1) (- 2))) 0) (not (= main_~a~0 0)))) (<= 1 main_~y~0)) ) not inductive [2022-04-28 07:22:10,934 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 07:22:11,117 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 07:22:11,118 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 07:22:11,120 INFO L158 Benchmark]: Toolchain (without parser) took 241774.72ms. Allocated memory was 185.6MB in the beginning and 226.5MB in the end (delta: 40.9MB). Free memory was 136.8MB in the beginning and 115.4MB in the end (delta: 21.4MB). Peak memory consumption was 63.2MB. Max. memory is 8.0GB. [2022-04-28 07:22:11,121 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 07:22:11,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.56ms. Allocated memory is still 185.6MB. Free memory was 136.6MB in the beginning and 160.8MB in the end (delta: -24.2MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-04-28 07:22:11,121 INFO L158 Benchmark]: Boogie Preprocessor took 42.04ms. Allocated memory is still 185.6MB. Free memory was 160.8MB in the beginning and 159.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 07:22:11,121 INFO L158 Benchmark]: RCFGBuilder took 354.19ms. Allocated memory is still 185.6MB. Free memory was 159.1MB in the beginning and 146.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 07:22:11,121 INFO L158 Benchmark]: TraceAbstraction took 241146.28ms. Allocated memory was 185.6MB in the beginning and 226.5MB in the end (delta: 40.9MB). Free memory was 146.0MB in the beginning and 115.9MB in the end (delta: 30.1MB). Peak memory consumption was 71.0MB. Max. memory is 8.0GB. [2022-04-28 07:22:11,122 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.11ms. Allocated memory is still 185.6MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.56ms. Allocated memory is still 185.6MB. Free memory was 136.6MB in the beginning and 160.8MB in the end (delta: -24.2MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.04ms. Allocated memory is still 185.6MB. Free memory was 160.8MB in the beginning and 159.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 354.19ms. Allocated memory is still 185.6MB. Free memory was 159.1MB in the beginning and 146.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 241146.28ms. Allocated memory was 185.6MB in the beginning and 226.5MB in the end (delta: 40.9MB). Free memory was 146.0MB in the beginning and 115.9MB in the end (delta: 30.1MB). Peak memory consumption was 71.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 07:22:11,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...