/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:24:19,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:24:19,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:24:19,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:24:19,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:24:19,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:24:19,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:24:19,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:24:19,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:24:19,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:24:19,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:24:19,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:24:19,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:24:19,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:24:19,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:24:19,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:24:19,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:24:19,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:24:19,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:24:19,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:24:19,510 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:24:19,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:24:19,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:24:19,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:24:19,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:24:19,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:24:19,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:24:19,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:24:19,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:24:19,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:24:19,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:24:19,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:24:19,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:24:19,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:24:19,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:24:19,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:24:19,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:24:19,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:24:19,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:24:19,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:24:19,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:24:19,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:24:19,529 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:24:19,540 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:24:19,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:24:19,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:24:19,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:24:19,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:24:19,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:24:19,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:24:19,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:24:19,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:24:19,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:24:19,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:24:19,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:24:19,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:24:19,543 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:24:19,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:24:19,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:24:19,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:24:19,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:24:19,544 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:24:19,544 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:24:19,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:24:19,544 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:24:19,544 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 11:24:19,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:24:19,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:24:19,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:24:19,776 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:24:19,780 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:24:19,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound1.c [2022-04-28 11:24:19,849 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd9ddb8df/71e3a5e7d81f42839eb1860012d17f25/FLAG04ef5d854 [2022-04-28 11:24:20,255 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:24:20,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound1.c [2022-04-28 11:24:20,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd9ddb8df/71e3a5e7d81f42839eb1860012d17f25/FLAG04ef5d854 [2022-04-28 11:24:20,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd9ddb8df/71e3a5e7d81f42839eb1860012d17f25 [2022-04-28 11:24:20,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:24:20,654 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:24:20,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:24:20,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:24:20,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:24:20,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:24:20" (1/1) ... [2022-04-28 11:24:20,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79972541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:20, skipping insertion in model container [2022-04-28 11:24:20,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:24:20" (1/1) ... [2022-04-28 11:24:20,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:24:20,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:24:20,825 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/cohendiv-ll_valuebound1.c[576,589] [2022-04-28 11:24:20,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:24:20,848 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:24:20,858 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/cohendiv-ll_valuebound1.c[576,589] [2022-04-28 11:24:20,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:24:20,874 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:24:20,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:20 WrapperNode [2022-04-28 11:24:20,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:24:20,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:24:20,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:24:20,875 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:24:20,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:20" (1/1) ... [2022-04-28 11:24:20,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:20" (1/1) ... [2022-04-28 11:24:20,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:20" (1/1) ... [2022-04-28 11:24:20,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:20" (1/1) ... [2022-04-28 11:24:20,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:20" (1/1) ... [2022-04-28 11:24:20,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:20" (1/1) ... [2022-04-28 11:24:20,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:20" (1/1) ... [2022-04-28 11:24:20,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:24:20,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:24:20,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:24:20,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:24:20,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:20" (1/1) ... [2022-04-28 11:24:20,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:24:20,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:20,940 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 11:24:20,954 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 11:24:20,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:24:20,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:24:20,971 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:24:20,972 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:24:20,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:24:20,972 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:24:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:24:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:24:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:24:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:24:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 11:24:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:24:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:24:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:24:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:24:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:24:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:24:20,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:24:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:24:20,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:24:21,025 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:24:21,026 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:24:21,194 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:24:21,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:24:21,210 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 11:24:21,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:24:21 BoogieIcfgContainer [2022-04-28 11:24:21,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:24:21,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:24:21,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:24:21,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:24:21,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:24:20" (1/3) ... [2022-04-28 11:24:21,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49765017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:24:21, skipping insertion in model container [2022-04-28 11:24:21,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:24:20" (2/3) ... [2022-04-28 11:24:21,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49765017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:24:21, skipping insertion in model container [2022-04-28 11:24:21,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:24:21" (3/3) ... [2022-04-28 11:24:21,219 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound1.c [2022-04-28 11:24:21,231 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:24:21,231 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:24:21,280 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:24:21,286 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@5a90e95f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48ee4fd4 [2022-04-28 11:24:21,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:24:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:24:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 11:24:21,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:21,302 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:21,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:21,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:21,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1768835633, now seen corresponding path program 1 times [2022-04-28 11:24:21,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:21,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1600984977] [2022-04-28 11:24:21,329 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:24:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1768835633, now seen corresponding path program 2 times [2022-04-28 11:24:21,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:21,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145483199] [2022-04-28 11:24:21,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:21,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:21,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:24:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:21,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-28 11:24:21,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 11:24:21,524 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-28 11:24:21,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:24:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:21,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 11:24:21,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 11:24:21,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 11:24:21,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-28 11:24:21,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 11:24:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:21,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 11:24:21,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 11:24:21,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 11:24:21,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-28 11:24:21,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 11:24:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:21,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 11:24:21,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 11:24:21,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 11:24:21,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-28 11:24:21,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {59#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:24:21,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {59#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-28 11:24:21,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 11:24:21,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-28 11:24:21,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret6 := main(); {42#true} is VALID [2022-04-28 11:24:21,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-28 11:24:21,559 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {42#true} is VALID [2022-04-28 11:24:21,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 11:24:21,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 11:24:21,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 11:24:21,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-28 11:24:21,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {43#false} is VALID [2022-04-28 11:24:21,561 INFO L272 TraceCheckUtils]: 12: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {42#true} is VALID [2022-04-28 11:24:21,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 11:24:21,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 11:24:21,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 11:24:21,562 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-28 11:24:21,562 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-28 11:24:21,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 11:24:21,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 11:24:21,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 11:24:21,564 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-28 11:24:21,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {43#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {43#false} is VALID [2022-04-28 11:24:21,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#false} assume false; {43#false} is VALID [2022-04-28 11:24:21,564 INFO L272 TraceCheckUtils]: 24: Hoare triple {43#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {43#false} is VALID [2022-04-28 11:24:21,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-28 11:24:21,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-28 11:24:21,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-28 11:24:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 11:24:21,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:21,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145483199] [2022-04-28 11:24:21,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145483199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:21,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:21,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:24:21,570 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:21,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1600984977] [2022-04-28 11:24:21,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1600984977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:21,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:21,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:24:21,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425514905] [2022-04-28 11:24:21,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:21,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 11:24:21,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:21,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:24:21,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:21,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:24:21,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:21,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:24:21,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:24:21,649 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:24:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:21,846 INFO L93 Difference]: Finished difference Result 71 states and 110 transitions. [2022-04-28 11:24:21,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:24:21,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 11:24:21,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:24:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-28 11:24:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:24:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-28 11:24:21,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-04-28 11:24:21,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:21,985 INFO L225 Difference]: With dead ends: 71 [2022-04-28 11:24:21,985 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 11:24:21,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:24:21,991 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:21,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:24:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 11:24:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 11:24:22,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:22,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:24:22,020 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:24:22,021 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:24:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:22,025 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:24:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:24:22,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:22,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:22,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-28 11:24:22,027 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-28 11:24:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:22,031 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:24:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:24:22,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:22,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:22,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:22,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:24:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-28 11:24:22,037 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 28 [2022-04-28 11:24:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:22,037 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-28 11:24:22,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:24:22,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-28 11:24:22,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:22,085 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:24:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 11:24:22,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:22,086 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:22,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:24:22,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:22,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:22,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1378913883, now seen corresponding path program 1 times [2022-04-28 11:24:22,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:22,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1024948662] [2022-04-28 11:24:22,088 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:24:22,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1378913883, now seen corresponding path program 2 times [2022-04-28 11:24:22,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:22,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092007104] [2022-04-28 11:24:22,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:22,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:22,110 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:22,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314356918] [2022-04-28 11:24:22,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:22,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:22,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:22,112 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 11:24:22,153 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 11:24:22,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:24:22,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:22,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:24:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:22,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:25,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2022-04-28 11:24:25,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#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(14, 2);call #Ultimate.allocInit(12, 3); {340#true} is VALID [2022-04-28 11:24:25,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 11:24:25,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #98#return; {340#true} is VALID [2022-04-28 11:24:25,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret6 := main(); {340#true} is VALID [2022-04-28 11:24:25,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {340#true} is VALID [2022-04-28 11:24:25,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {340#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {340#true} is VALID [2022-04-28 11:24:25,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#true} ~cond := #in~cond; {340#true} is VALID [2022-04-28 11:24:25,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#true} assume !(0 == ~cond); {340#true} is VALID [2022-04-28 11:24:25,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 11:24:25,016 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {340#true} {340#true} #78#return; {340#true} is VALID [2022-04-28 11:24:25,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {340#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {340#true} is VALID [2022-04-28 11:24:25,016 INFO L272 TraceCheckUtils]: 12: Hoare triple {340#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {340#true} is VALID [2022-04-28 11:24:25,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {340#true} ~cond := #in~cond; {340#true} is VALID [2022-04-28 11:24:25,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {340#true} assume !(0 == ~cond); {340#true} is VALID [2022-04-28 11:24:25,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 11:24:25,017 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {340#true} {340#true} #80#return; {340#true} is VALID [2022-04-28 11:24:25,017 INFO L272 TraceCheckUtils]: 17: Hoare triple {340#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {340#true} is VALID [2022-04-28 11:24:25,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {340#true} ~cond := #in~cond; {340#true} is VALID [2022-04-28 11:24:25,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {340#true} assume !(0 == ~cond); {340#true} is VALID [2022-04-28 11:24:25,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 11:24:25,018 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {340#true} {340#true} #82#return; {340#true} is VALID [2022-04-28 11:24:25,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {340#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {411#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:24:25,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {411#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false; {411#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 11:24:25,033 INFO L272 TraceCheckUtils]: 24: Hoare triple {411#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {418#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:25,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {418#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {422#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:25,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {422#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {341#false} is VALID [2022-04-28 11:24:25,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-28 11:24:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 11:24:25,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:24:25,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:25,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092007104] [2022-04-28 11:24:25,035 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:25,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314356918] [2022-04-28 11:24:25,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314356918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:25,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:25,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:24:25,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:25,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1024948662] [2022-04-28 11:24:25,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1024948662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:25,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:25,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:24:25,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119202600] [2022-04-28 11:24:25,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:25,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 11:24:25,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:25,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:24:25,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:25,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:24:25,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:25,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:24:25,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:24:25,066 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:24:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:25,287 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 11:24:25,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:24:25,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 11:24:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:24:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:24:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:24:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:24:25,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-28 11:24:25,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:25,341 INFO L225 Difference]: With dead ends: 45 [2022-04-28 11:24:25,341 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 11:24:25,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:24:25,342 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:25,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 149 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:24:25,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 11:24:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-28 11:24:25,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:25,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:24:25,355 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:24:25,356 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:24:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:25,359 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:24:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:24:25,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:25,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:25,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 43 states. [2022-04-28 11:24:25,361 INFO L87 Difference]: Start difference. First operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 43 states. [2022-04-28 11:24:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:25,365 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:24:25,365 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:24:25,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:25,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:25,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:25,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:24:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-28 11:24:25,369 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 28 [2022-04-28 11:24:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:25,369 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-28 11:24:25,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:24:25,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-28 11:24:25,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 11:24:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 11:24:25,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:25,421 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:25,449 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 11:24:25,643 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 11:24:25,644 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:25,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:25,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1928335320, now seen corresponding path program 1 times [2022-04-28 11:24:25,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:25,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [273660478] [2022-04-28 11:24:25,645 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:24:25,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1928335320, now seen corresponding path program 2 times [2022-04-28 11:24:25,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:25,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168164681] [2022-04-28 11:24:25,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:25,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:25,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:25,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568316162] [2022-04-28 11:24:25,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:25,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:25,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:25,676 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 11:24:25,682 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 11:24:25,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:25,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:25,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 11:24:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:25,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:25,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {686#true} call ULTIMATE.init(); {686#true} is VALID [2022-04-28 11:24:25,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {686#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(14, 2);call #Ultimate.allocInit(12, 3); {686#true} is VALID [2022-04-28 11:24:25,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {686#true} assume true; {686#true} is VALID [2022-04-28 11:24:25,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {686#true} {686#true} #98#return; {686#true} is VALID [2022-04-28 11:24:25,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {686#true} call #t~ret6 := main(); {686#true} is VALID [2022-04-28 11:24:25,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {686#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {686#true} is VALID [2022-04-28 11:24:25,992 INFO L272 TraceCheckUtils]: 6: Hoare triple {686#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {686#true} is VALID [2022-04-28 11:24:25,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#true} ~cond := #in~cond; {686#true} is VALID [2022-04-28 11:24:25,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {686#true} assume !(0 == ~cond); {686#true} is VALID [2022-04-28 11:24:25,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {686#true} assume true; {686#true} is VALID [2022-04-28 11:24:25,994 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {686#true} {686#true} #78#return; {686#true} is VALID [2022-04-28 11:24:25,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {686#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {686#true} is VALID [2022-04-28 11:24:25,995 INFO L272 TraceCheckUtils]: 12: Hoare triple {686#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {686#true} is VALID [2022-04-28 11:24:25,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {686#true} ~cond := #in~cond; {730#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:24:25,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {734#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:25,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {734#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {734#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:25,998 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {734#(not (= |assume_abort_if_not_#in~cond| 0))} {686#true} #80#return; {741#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 11:24:25,999 INFO L272 TraceCheckUtils]: 17: Hoare triple {741#(and (<= 0 main_~y~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {686#true} is VALID [2022-04-28 11:24:25,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {686#true} ~cond := #in~cond; {730#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:24:25,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {730#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {734#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:26,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {734#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {734#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:26,001 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {734#(not (= |assume_abort_if_not_#in~cond| 0))} {741#(and (<= 0 main_~y~0) (<= main_~y~0 1))} #82#return; {757#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 11:24:26,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {757#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 11:24:26,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !false; {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 11:24:26,002 INFO L272 TraceCheckUtils]: 24: Hoare triple {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {686#true} is VALID [2022-04-28 11:24:26,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {686#true} ~cond := #in~cond; {686#true} is VALID [2022-04-28 11:24:26,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {686#true} assume !(0 == ~cond); {686#true} is VALID [2022-04-28 11:24:26,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {686#true} assume true; {686#true} is VALID [2022-04-28 11:24:26,003 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {686#true} {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} #84#return; {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 11:24:26,006 INFO L272 TraceCheckUtils]: 29: Hoare triple {761#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (<= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {783#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:26,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {783#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {787#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:26,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {787#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {687#false} is VALID [2022-04-28 11:24:26,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#false} assume !false; {687#false} is VALID [2022-04-28 11:24:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 11:24:26,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:24:26,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:26,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168164681] [2022-04-28 11:24:26,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:26,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568316162] [2022-04-28 11:24:26,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568316162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:26,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:26,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:24:26,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:26,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [273660478] [2022-04-28 11:24:26,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [273660478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:26,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:26,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:24:26,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91383516] [2022-04-28 11:24:26,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:26,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2022-04-28 11:24:26,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:26,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:24:26,037 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 11:24:26,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:24:26,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:26,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:24:26,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:24:26,039 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:24:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:26,515 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-28 11:24:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:24:26,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2022-04-28 11:24:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:26,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:24:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-28 11:24:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:24:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-28 11:24:26,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-28 11:24:26,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:26,606 INFO L225 Difference]: With dead ends: 57 [2022-04-28 11:24:26,606 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 11:24:26,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:24:26,615 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 29 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:26,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 180 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:24:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 11:24:26,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-28 11:24:26,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:26,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:26,668 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:26,668 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:26,673 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-28 11:24:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-28 11:24:26,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:26,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:26,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 54 states. [2022-04-28 11:24:26,680 INFO L87 Difference]: Start difference. First operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 54 states. [2022-04-28 11:24:26,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:26,687 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-28 11:24:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-28 11:24:26,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:26,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:26,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:26,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-28 11:24:26,694 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 33 [2022-04-28 11:24:26,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:26,694 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-04-28 11:24:26,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:24:26,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 67 transitions. [2022-04-28 11:24:26,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-28 11:24:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 11:24:26,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:26,763 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:26,789 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 11:24:26,983 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 11:24:26,984 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:26,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:26,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1297647068, now seen corresponding path program 1 times [2022-04-28 11:24:26,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:26,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1991091472] [2022-04-28 11:24:26,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:24:26,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1297647068, now seen corresponding path program 2 times [2022-04-28 11:24:26,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:26,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530009268] [2022-04-28 11:24:26,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:27,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:27,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371834547] [2022-04-28 11:24:27,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:27,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:27,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:27,003 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 11:24:27,026 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 11:24:27,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:27,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:27,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:24:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:27,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:27,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2022-04-28 11:24:27,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {1125#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(14, 2);call #Ultimate.allocInit(12, 3); {1125#true} is VALID [2022-04-28 11:24:27,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:24:27,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #98#return; {1125#true} is VALID [2022-04-28 11:24:27,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret6 := main(); {1125#true} is VALID [2022-04-28 11:24:27,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {1125#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1125#true} is VALID [2022-04-28 11:24:27,355 INFO L272 TraceCheckUtils]: 6: Hoare triple {1125#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1125#true} is VALID [2022-04-28 11:24:27,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {1125#true} ~cond := #in~cond; {1151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:24:27,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {1151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:27,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {1155#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:27,358 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1155#(not (= |assume_abort_if_not_#in~cond| 0))} {1125#true} #78#return; {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 11:24:27,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 11:24:27,368 INFO L272 TraceCheckUtils]: 12: Hoare triple {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1125#true} is VALID [2022-04-28 11:24:27,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:24:27,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:24:27,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:24:27,369 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1125#true} {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #80#return; {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 11:24:27,369 INFO L272 TraceCheckUtils]: 17: Hoare triple {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1125#true} is VALID [2022-04-28 11:24:27,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#true} ~cond := #in~cond; {1151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:24:27,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {1151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:27,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {1155#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:27,371 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1155#(not (= |assume_abort_if_not_#in~cond| 0))} {1162#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #82#return; {1196#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:27,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {1196#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:27,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} assume !false; {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:27,372 INFO L272 TraceCheckUtils]: 24: Hoare triple {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1125#true} is VALID [2022-04-28 11:24:27,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:24:27,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:24:27,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:24:27,373 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1125#true} {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} #84#return; {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:27,373 INFO L272 TraceCheckUtils]: 29: Hoare triple {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1125#true} is VALID [2022-04-28 11:24:27,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:24:27,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:24:27,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:24:27,374 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1125#true} {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} #86#return; {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 11:24:27,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {1200#(and (<= main_~r~0 1) (<= 1 main_~y~0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1237#(and (= main_~a~0 1) (= main_~b~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 11:24:27,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {1237#(and (= main_~a~0 1) (= main_~b~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !false; {1237#(and (= main_~a~0 1) (= main_~b~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 11:24:27,376 INFO L272 TraceCheckUtils]: 36: Hoare triple {1237#(and (= main_~a~0 1) (= main_~b~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:27,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:27,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {1248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1126#false} is VALID [2022-04-28 11:24:27,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2022-04-28 11:24:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 11:24:27,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:24:27,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2022-04-28 11:24:27,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {1248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1126#false} is VALID [2022-04-28 11:24:27,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:27,652 INFO L272 TraceCheckUtils]: 36: Hoare triple {1264#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:27,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {1264#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !false; {1264#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:24:27,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {1125#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1264#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:24:27,653 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1125#true} {1125#true} #86#return; {1125#true} is VALID [2022-04-28 11:24:27,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:24:27,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:24:27,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:24:27,653 INFO L272 TraceCheckUtils]: 29: Hoare triple {1125#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1125#true} is VALID [2022-04-28 11:24:27,653 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1125#true} {1125#true} #84#return; {1125#true} is VALID [2022-04-28 11:24:27,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:24:27,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:24:27,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:24:27,654 INFO L272 TraceCheckUtils]: 24: Hoare triple {1125#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1125#true} is VALID [2022-04-28 11:24:27,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {1125#true} assume !false; {1125#true} is VALID [2022-04-28 11:24:27,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {1125#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1125#true} is VALID [2022-04-28 11:24:27,654 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1125#true} {1125#true} #82#return; {1125#true} is VALID [2022-04-28 11:24:27,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:24:27,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:24:27,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:24:27,655 INFO L272 TraceCheckUtils]: 17: Hoare triple {1125#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1125#true} is VALID [2022-04-28 11:24:27,657 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1125#true} {1125#true} #80#return; {1125#true} is VALID [2022-04-28 11:24:27,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:24:27,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:24:27,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:24:27,659 INFO L272 TraceCheckUtils]: 12: Hoare triple {1125#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1125#true} is VALID [2022-04-28 11:24:27,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {1125#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1125#true} is VALID [2022-04-28 11:24:27,659 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1125#true} {1125#true} #78#return; {1125#true} is VALID [2022-04-28 11:24:27,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:24:27,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:24:27,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:24:27,660 INFO L272 TraceCheckUtils]: 6: Hoare triple {1125#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1125#true} is VALID [2022-04-28 11:24:27,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {1125#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1125#true} is VALID [2022-04-28 11:24:27,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret6 := main(); {1125#true} is VALID [2022-04-28 11:24:27,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #98#return; {1125#true} is VALID [2022-04-28 11:24:27,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:24:27,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {1125#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(14, 2);call #Ultimate.allocInit(12, 3); {1125#true} is VALID [2022-04-28 11:24:27,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2022-04-28 11:24:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 11:24:27,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:27,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530009268] [2022-04-28 11:24:27,662 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:27,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371834547] [2022-04-28 11:24:27,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371834547] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 11:24:27,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:24:27,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-28 11:24:27,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:27,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1991091472] [2022-04-28 11:24:27,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1991091472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:27,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:27,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:24:27,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582590370] [2022-04-28 11:24:27,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:27,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-28 11:24:27,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:27,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 11:24:27,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:27,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:24:27,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:27,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:24:27,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:24:27,688 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 11:24:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:27,900 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-04-28 11:24:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:24:27,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-28 11:24:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 11:24:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-28 11:24:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 11:24:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-28 11:24:27,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-28 11:24:27,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:27,950 INFO L225 Difference]: With dead ends: 59 [2022-04-28 11:24:27,950 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 11:24:27,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:24:27,951 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:27,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 102 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:24:27,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 11:24:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 11:24:28,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:28,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:28,012 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:28,013 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:28,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:28,015 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-28 11:24:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-28 11:24:28,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:28,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:28,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 57 states. [2022-04-28 11:24:28,016 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 57 states. [2022-04-28 11:24:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:28,019 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-28 11:24:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-28 11:24:28,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:28,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:28,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:28,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-04-28 11:24:28,022 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 40 [2022-04-28 11:24:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:28,023 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-04-28 11:24:28,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 11:24:28,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 70 transitions. [2022-04-28 11:24:28,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-28 11:24:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:24:28,123 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:28,123 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 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 11:24:28,150 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 11:24:28,331 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 11:24:28,331 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash -391974204, now seen corresponding path program 1 times [2022-04-28 11:24:28,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:28,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [304301063] [2022-04-28 11:24:28,332 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:24:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash -391974204, now seen corresponding path program 2 times [2022-04-28 11:24:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:28,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406287497] [2022-04-28 11:24:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:28,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:28,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137262381] [2022-04-28 11:24:28,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:28,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:28,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:28,354 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 11:24:28,375 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 11:24:28,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:28,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:28,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:24:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:28,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:28,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-28 11:24:28,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#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(14, 2);call #Ultimate.allocInit(12, 3); {1723#true} is VALID [2022-04-28 11:24:28,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-28 11:24:28,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1723#true} {1723#true} #98#return; {1723#true} is VALID [2022-04-28 11:24:28,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {1723#true} call #t~ret6 := main(); {1723#true} is VALID [2022-04-28 11:24:28,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {1723#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1723#true} is VALID [2022-04-28 11:24:28,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {1723#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1723#true} is VALID [2022-04-28 11:24:28,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-28 11:24:28,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-28 11:24:28,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-28 11:24:28,615 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1723#true} {1723#true} #78#return; {1723#true} is VALID [2022-04-28 11:24:28,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {1723#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1723#true} is VALID [2022-04-28 11:24:28,616 INFO L272 TraceCheckUtils]: 12: Hoare triple {1723#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1723#true} is VALID [2022-04-28 11:24:28,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-28 11:24:28,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-28 11:24:28,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-28 11:24:28,616 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1723#true} {1723#true} #80#return; {1723#true} is VALID [2022-04-28 11:24:28,616 INFO L272 TraceCheckUtils]: 17: Hoare triple {1723#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1723#true} is VALID [2022-04-28 11:24:28,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {1723#true} ~cond := #in~cond; {1782#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:24:28,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {1782#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1786#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:28,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {1786#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1786#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:28,621 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1786#(not (= |assume_abort_if_not_#in~cond| 0))} {1723#true} #82#return; {1793#(<= 1 main_~y~0)} is VALID [2022-04-28 11:24:28,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1793#(<= 1 main_~y~0)} is VALID [2022-04-28 11:24:28,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#(<= 1 main_~y~0)} assume !false; {1793#(<= 1 main_~y~0)} is VALID [2022-04-28 11:24:28,622 INFO L272 TraceCheckUtils]: 24: Hoare triple {1793#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1723#true} is VALID [2022-04-28 11:24:28,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-28 11:24:28,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-28 11:24:28,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-28 11:24:28,624 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1723#true} {1793#(<= 1 main_~y~0)} #84#return; {1793#(<= 1 main_~y~0)} is VALID [2022-04-28 11:24:28,624 INFO L272 TraceCheckUtils]: 29: Hoare triple {1793#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1723#true} is VALID [2022-04-28 11:24:28,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-28 11:24:28,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-28 11:24:28,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-28 11:24:28,625 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1723#true} {1793#(<= 1 main_~y~0)} #86#return; {1793#(<= 1 main_~y~0)} is VALID [2022-04-28 11:24:28,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {1793#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1833#(<= 1 main_~r~0)} is VALID [2022-04-28 11:24:28,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {1833#(<= 1 main_~r~0)} assume !false; {1833#(<= 1 main_~r~0)} is VALID [2022-04-28 11:24:28,626 INFO L272 TraceCheckUtils]: 36: Hoare triple {1833#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1723#true} is VALID [2022-04-28 11:24:28,626 INFO L290 TraceCheckUtils]: 37: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-28 11:24:28,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-28 11:24:28,626 INFO L290 TraceCheckUtils]: 39: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-28 11:24:28,626 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1723#true} {1833#(<= 1 main_~r~0)} #88#return; {1833#(<= 1 main_~r~0)} is VALID [2022-04-28 11:24:28,627 INFO L272 TraceCheckUtils]: 41: Hoare triple {1833#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1723#true} is VALID [2022-04-28 11:24:28,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-28 11:24:28,627 INFO L290 TraceCheckUtils]: 43: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-28 11:24:28,627 INFO L290 TraceCheckUtils]: 44: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-28 11:24:28,627 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1723#true} {1833#(<= 1 main_~r~0)} #90#return; {1833#(<= 1 main_~r~0)} is VALID [2022-04-28 11:24:28,628 INFO L272 TraceCheckUtils]: 46: Hoare triple {1833#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {1870#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:28,629 INFO L290 TraceCheckUtils]: 47: Hoare triple {1870#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1874#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:28,629 INFO L290 TraceCheckUtils]: 48: Hoare triple {1874#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1724#false} is VALID [2022-04-28 11:24:28,629 INFO L290 TraceCheckUtils]: 49: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-28 11:24:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 11:24:28,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:24:28,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:28,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406287497] [2022-04-28 11:24:28,630 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:28,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137262381] [2022-04-28 11:24:28,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137262381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:28,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:28,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:24:28,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:28,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [304301063] [2022-04-28 11:24:28,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [304301063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:28,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:28,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:24:28,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026323768] [2022-04-28 11:24:28,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:28,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2022-04-28 11:24:28,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:28,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:24:28,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:28,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:24:28,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:28,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:24:28,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:24:28,665 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:24:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:29,026 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-28 11:24:29,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:24:29,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2022-04-28 11:24:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:24:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 11:24:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:24:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 11:24:29,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-28 11:24:29,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:29,072 INFO L225 Difference]: With dead ends: 63 [2022-04-28 11:24:29,072 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 11:24:29,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:24:29,076 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:29,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 160 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:24:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 11:24:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 11:24:29,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:29,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:29,137 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:29,137 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:29,139 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-28 11:24:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-28 11:24:29,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:29,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:29,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 61 states. [2022-04-28 11:24:29,140 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 61 states. [2022-04-28 11:24:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:29,142 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-28 11:24:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-28 11:24:29,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:29,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:29,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:29,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-04-28 11:24:29,146 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 50 [2022-04-28 11:24:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:29,146 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-04-28 11:24:29,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:24:29,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 73 transitions. [2022-04-28 11:24:29,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-28 11:24:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 11:24:29,235 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:29,235 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:24:29,261 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 11:24:29,457 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 11:24:29,457 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:29,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash 991781023, now seen corresponding path program 1 times [2022-04-28 11:24:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:29,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [333561113] [2022-04-28 11:24:29,458 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:24:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash 991781023, now seen corresponding path program 2 times [2022-04-28 11:24:29,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:29,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586149708] [2022-04-28 11:24:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:29,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:29,476 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:29,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429560646] [2022-04-28 11:24:29,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:29,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:29,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:29,477 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 11:24:29,503 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 11:24:29,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:29,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:29,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:24:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:29,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:29,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {2256#true} call ULTIMATE.init(); {2256#true} is VALID [2022-04-28 11:24:29,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {2256#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(14, 2);call #Ultimate.allocInit(12, 3); {2256#true} is VALID [2022-04-28 11:24:29,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:29,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2256#true} {2256#true} #98#return; {2256#true} is VALID [2022-04-28 11:24:29,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {2256#true} call #t~ret6 := main(); {2256#true} is VALID [2022-04-28 11:24:29,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {2256#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2256#true} is VALID [2022-04-28 11:24:29,756 INFO L272 TraceCheckUtils]: 6: Hoare triple {2256#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:29,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:29,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:29,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:29,757 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2256#true} {2256#true} #78#return; {2256#true} is VALID [2022-04-28 11:24:29,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {2256#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2256#true} is VALID [2022-04-28 11:24:29,757 INFO L272 TraceCheckUtils]: 12: Hoare triple {2256#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:29,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:29,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:29,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:29,757 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2256#true} {2256#true} #80#return; {2256#true} is VALID [2022-04-28 11:24:29,758 INFO L272 TraceCheckUtils]: 17: Hoare triple {2256#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:29,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:29,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:29,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:29,758 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2256#true} {2256#true} #82#return; {2256#true} is VALID [2022-04-28 11:24:29,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {2256#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2256#true} is VALID [2022-04-28 11:24:29,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {2256#true} assume !false; {2256#true} is VALID [2022-04-28 11:24:29,758 INFO L272 TraceCheckUtils]: 24: Hoare triple {2256#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:29,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:29,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:29,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:29,759 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2256#true} {2256#true} #84#return; {2256#true} is VALID [2022-04-28 11:24:29,759 INFO L272 TraceCheckUtils]: 29: Hoare triple {2256#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:29,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:29,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:29,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:29,759 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2256#true} {2256#true} #86#return; {2256#true} is VALID [2022-04-28 11:24:29,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {2256#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2256#true} is VALID [2022-04-28 11:24:29,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {2256#true} assume !false; {2256#true} is VALID [2022-04-28 11:24:29,760 INFO L272 TraceCheckUtils]: 36: Hoare triple {2256#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:29,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {2256#true} ~cond := #in~cond; {2372#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:29,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {2372#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:29,763 INFO L290 TraceCheckUtils]: 39: Hoare triple {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:29,763 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} {2256#true} #88#return; {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:24:29,764 INFO L272 TraceCheckUtils]: 41: Hoare triple {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:29,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:29,764 INFO L290 TraceCheckUtils]: 43: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:29,764 INFO L290 TraceCheckUtils]: 44: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:29,764 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2256#true} {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} #90#return; {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:24:29,765 INFO L272 TraceCheckUtils]: 46: Hoare triple {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:29,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:29,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:29,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:29,765 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2256#true} {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} #92#return; {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 11:24:29,766 INFO L290 TraceCheckUtils]: 51: Hoare triple {2383#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {2417#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 11:24:29,767 INFO L272 TraceCheckUtils]: 52: Hoare triple {2417#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:29,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2425#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:29,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {2425#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2257#false} is VALID [2022-04-28 11:24:29,768 INFO L290 TraceCheckUtils]: 55: Hoare triple {2257#false} assume !false; {2257#false} is VALID [2022-04-28 11:24:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 11:24:29,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:24:34,282 INFO L290 TraceCheckUtils]: 55: Hoare triple {2257#false} assume !false; {2257#false} is VALID [2022-04-28 11:24:34,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {2425#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2257#false} is VALID [2022-04-28 11:24:34,284 INFO L290 TraceCheckUtils]: 53: Hoare triple {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2425#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:34,285 INFO L272 TraceCheckUtils]: 52: Hoare triple {2417#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2421#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:34,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {2417#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 11:24:34,286 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2256#true} {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #92#return; {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:24:34,286 INFO L290 TraceCheckUtils]: 49: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:34,286 INFO L290 TraceCheckUtils]: 48: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:34,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:34,287 INFO L272 TraceCheckUtils]: 46: Hoare triple {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:34,287 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2256#true} {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #90#return; {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:24:34,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:34,288 INFO L290 TraceCheckUtils]: 43: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:34,288 INFO L290 TraceCheckUtils]: 42: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:34,288 INFO L272 TraceCheckUtils]: 41: Hoare triple {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:34,289 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} {2256#true} #88#return; {2444#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 11:24:34,289 INFO L290 TraceCheckUtils]: 39: Hoare triple {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:34,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {2487#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2376#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:24:34,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {2256#true} ~cond := #in~cond; {2487#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:24:34,290 INFO L272 TraceCheckUtils]: 36: Hoare triple {2256#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:34,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {2256#true} assume !false; {2256#true} is VALID [2022-04-28 11:24:34,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {2256#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2256#true} is VALID [2022-04-28 11:24:34,291 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2256#true} {2256#true} #86#return; {2256#true} is VALID [2022-04-28 11:24:34,291 INFO L290 TraceCheckUtils]: 32: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:34,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:34,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:34,291 INFO L272 TraceCheckUtils]: 29: Hoare triple {2256#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:34,291 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2256#true} {2256#true} #84#return; {2256#true} is VALID [2022-04-28 11:24:34,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:34,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:34,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:34,292 INFO L272 TraceCheckUtils]: 24: Hoare triple {2256#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:34,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {2256#true} assume !false; {2256#true} is VALID [2022-04-28 11:24:34,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {2256#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2256#true} is VALID [2022-04-28 11:24:34,292 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2256#true} {2256#true} #82#return; {2256#true} is VALID [2022-04-28 11:24:34,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:34,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:34,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:34,293 INFO L272 TraceCheckUtils]: 17: Hoare triple {2256#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:34,293 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2256#true} {2256#true} #80#return; {2256#true} is VALID [2022-04-28 11:24:34,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:34,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:34,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:34,293 INFO L272 TraceCheckUtils]: 12: Hoare triple {2256#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:34,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {2256#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2256#true} is VALID [2022-04-28 11:24:34,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2256#true} {2256#true} #78#return; {2256#true} is VALID [2022-04-28 11:24:34,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:34,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {2256#true} assume !(0 == ~cond); {2256#true} is VALID [2022-04-28 11:24:34,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {2256#true} ~cond := #in~cond; {2256#true} is VALID [2022-04-28 11:24:34,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {2256#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {2256#true} is VALID [2022-04-28 11:24:34,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {2256#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2256#true} is VALID [2022-04-28 11:24:34,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {2256#true} call #t~ret6 := main(); {2256#true} is VALID [2022-04-28 11:24:34,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2256#true} {2256#true} #98#return; {2256#true} is VALID [2022-04-28 11:24:34,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {2256#true} assume true; {2256#true} is VALID [2022-04-28 11:24:34,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {2256#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(14, 2);call #Ultimate.allocInit(12, 3); {2256#true} is VALID [2022-04-28 11:24:34,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {2256#true} call ULTIMATE.init(); {2256#true} is VALID [2022-04-28 11:24:34,295 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 11:24:34,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:34,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586149708] [2022-04-28 11:24:34,296 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:34,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429560646] [2022-04-28 11:24:34,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429560646] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:24:34,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:24:34,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 11:24:34,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:34,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [333561113] [2022-04-28 11:24:34,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [333561113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:34,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:34,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:24:34,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476517778] [2022-04-28 11:24:34,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:34,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2022-04-28 11:24:34,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:34,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 11:24:34,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:34,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:24:34,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:34,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:24:34,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:24:34,329 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 11:24:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:34,675 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-28 11:24:34,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:24:34,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2022-04-28 11:24:34,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 11:24:34,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 11:24:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 11:24:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 11:24:34,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-28 11:24:34,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:34,721 INFO L225 Difference]: With dead ends: 67 [2022-04-28 11:24:34,721 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 11:24:34,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:24:34,722 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:34,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 121 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:24:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 11:24:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 11:24:34,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:34,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:34,784 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:34,785 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:34,788 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 11:24:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 11:24:34,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:34,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:34,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 65 states. [2022-04-28 11:24:34,789 INFO L87 Difference]: Start difference. First operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 65 states. [2022-04-28 11:24:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:34,791 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 11:24:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 11:24:34,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:34,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:34,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:34,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 11:24:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-04-28 11:24:34,794 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 56 [2022-04-28 11:24:34,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:34,795 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-04-28 11:24:34,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 11:24:34,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 76 transitions. [2022-04-28 11:24:34,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 11:24:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 11:24:34,877 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:34,877 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:34,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 11:24:35,087 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 11:24:35,087 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:35,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2096667334, now seen corresponding path program 1 times [2022-04-28 11:24:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:35,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553844769] [2022-04-28 11:24:35,089 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:24:35,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2096667334, now seen corresponding path program 2 times [2022-04-28 11:24:35,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:35,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588049463] [2022-04-28 11:24:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:35,112 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:35,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [517589891] [2022-04-28 11:24:35,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:24:35,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:35,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:35,119 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 11:24:35,120 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 11:24:35,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:24:35,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:35,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 11:24:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:35,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:35,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {3001#true} call ULTIMATE.init(); {3001#true} is VALID [2022-04-28 11:24:35,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {3001#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(14, 2);call #Ultimate.allocInit(12, 3); {3001#true} is VALID [2022-04-28 11:24:35,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-28 11:24:35,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3001#true} {3001#true} #98#return; {3001#true} is VALID [2022-04-28 11:24:35,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {3001#true} call #t~ret6 := main(); {3001#true} is VALID [2022-04-28 11:24:35,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {3001#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3001#true} is VALID [2022-04-28 11:24:35,913 INFO L272 TraceCheckUtils]: 6: Hoare triple {3001#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {3001#true} is VALID [2022-04-28 11:24:35,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {3001#true} ~cond := #in~cond; {3027#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:24:35,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {3027#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3031#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:35,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {3031#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3031#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:24:35,915 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3031#(not (= |assume_abort_if_not_#in~cond| 0))} {3001#true} #78#return; {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 11:24:35,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 11:24:35,915 INFO L272 TraceCheckUtils]: 12: Hoare triple {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {3001#true} is VALID [2022-04-28 11:24:35,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-28 11:24:35,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-28 11:24:35,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-28 11:24:35,916 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3001#true} {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #80#return; {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 11:24:35,916 INFO L272 TraceCheckUtils]: 17: Hoare triple {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3001#true} is VALID [2022-04-28 11:24:35,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-28 11:24:35,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-28 11:24:35,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-28 11:24:35,917 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3001#true} {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #82#return; {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 11:24:35,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {3038#(and (<= 0 main_~x~0) (<= main_~x~0 1))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} is VALID [2022-04-28 11:24:35,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} assume !false; {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} is VALID [2022-04-28 11:24:35,918 INFO L272 TraceCheckUtils]: 24: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3001#true} is VALID [2022-04-28 11:24:35,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-28 11:24:35,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-28 11:24:35,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-28 11:24:35,920 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3001#true} {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} #84#return; {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} is VALID [2022-04-28 11:24:35,921 INFO L272 TraceCheckUtils]: 29: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3001#true} is VALID [2022-04-28 11:24:35,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-28 11:24:35,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-28 11:24:35,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-28 11:24:35,922 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3001#true} {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} #86#return; {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} is VALID [2022-04-28 11:24:35,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:35,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:35,923 INFO L272 TraceCheckUtils]: 36: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3001#true} is VALID [2022-04-28 11:24:35,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-28 11:24:35,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-28 11:24:35,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-28 11:24:35,927 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3001#true} {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:35,927 INFO L272 TraceCheckUtils]: 41: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3001#true} is VALID [2022-04-28 11:24:35,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-28 11:24:35,927 INFO L290 TraceCheckUtils]: 43: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-28 11:24:35,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-28 11:24:35,928 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3001#true} {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #90#return; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:35,928 INFO L272 TraceCheckUtils]: 46: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3001#true} is VALID [2022-04-28 11:24:35,928 INFO L290 TraceCheckUtils]: 47: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-28 11:24:35,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-28 11:24:35,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-28 11:24:35,932 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3001#true} {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #92#return; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:35,933 INFO L290 TraceCheckUtils]: 51: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {3164#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (< main_~r~0 (* main_~b~0 2)) (<= main_~y~0 main_~r~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 11:24:35,933 INFO L290 TraceCheckUtils]: 52: Hoare triple {3164#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (< main_~r~0 (* main_~b~0 2)) (<= main_~y~0 main_~r~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-28 11:24:35,934 INFO L290 TraceCheckUtils]: 53: Hoare triple {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} assume !false; {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-28 11:24:35,934 INFO L272 TraceCheckUtils]: 54: Hoare triple {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3001#true} is VALID [2022-04-28 11:24:35,934 INFO L290 TraceCheckUtils]: 55: Hoare triple {3001#true} ~cond := #in~cond; {3001#true} is VALID [2022-04-28 11:24:35,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {3001#true} assume !(0 == ~cond); {3001#true} is VALID [2022-04-28 11:24:35,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {3001#true} assume true; {3001#true} is VALID [2022-04-28 11:24:35,935 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {3001#true} {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} #84#return; {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-28 11:24:35,936 INFO L272 TraceCheckUtils]: 59: Hoare triple {3168#(and (<= main_~x~0 1) (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3190#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:35,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {3190#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3194#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:35,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {3194#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3002#false} is VALID [2022-04-28 11:24:35,936 INFO L290 TraceCheckUtils]: 62: Hoare triple {3002#false} assume !false; {3002#false} is VALID [2022-04-28 11:24:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 11:24:35,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:25:02,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:25:02,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588049463] [2022-04-28 11:25:02,537 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:25:02,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517589891] [2022-04-28 11:25:02,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517589891] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:25:02,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:25:02,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 11:25:02,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:25:02,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553844769] [2022-04-28 11:25:02,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553844769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:25:02,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:25:02,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:25:02,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023877607] [2022-04-28 11:25:02,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:25:02,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 63 [2022-04-28 11:25:02,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:25:02,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 11:25:02,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:02,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:25:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:02,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:25:02,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:25:02,578 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 11:25:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:03,464 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2022-04-28 11:25:03,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:25:03,464 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 63 [2022-04-28 11:25:03,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:25:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 11:25:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2022-04-28 11:25:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 11:25:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2022-04-28 11:25:03,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 113 transitions. [2022-04-28 11:25:03,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:03,582 INFO L225 Difference]: With dead ends: 122 [2022-04-28 11:25:03,582 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 11:25:03,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:25:03,583 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:25:03,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 212 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 11:25:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 11:25:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2022-04-28 11:25:03,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:25:03,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 78 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:25:03,710 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 78 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:25:03,710 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 78 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:25:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:03,713 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-28 11:25:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-04-28 11:25:03,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:03,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:03,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 81 states. [2022-04-28 11:25:03,714 INFO L87 Difference]: Start difference. First operand has 78 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 81 states. [2022-04-28 11:25:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:03,717 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-28 11:25:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-04-28 11:25:03,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:03,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:03,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:25:03,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:25:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:25:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2022-04-28 11:25:03,720 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 63 [2022-04-28 11:25:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:25:03,720 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2022-04-28 11:25:03,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 11:25:03,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 90 transitions. [2022-04-28 11:25:03,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2022-04-28 11:25:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 11:25:03,831 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:25:03,831 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:25:03,862 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 11:25:04,039 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 11:25:04,040 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:25:04,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:25:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2105983492, now seen corresponding path program 1 times [2022-04-28 11:25:04,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:04,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1741995769] [2022-04-28 11:25:04,040 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:25:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2105983492, now seen corresponding path program 2 times [2022-04-28 11:25:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:25:04,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147818025] [2022-04-28 11:25:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:25:04,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:25:04,065 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:25:04,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953675010] [2022-04-28 11:25:04,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:25:04,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:25:04,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:25:04,071 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 11:25:04,098 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 11:25:04,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:25:04,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:25:04,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 11:25:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:25:04,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:25:05,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {3860#true} call ULTIMATE.init(); {3860#true} is VALID [2022-04-28 11:25:05,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {3860#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(14, 2);call #Ultimate.allocInit(12, 3); {3860#true} is VALID [2022-04-28 11:25:05,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3860#true} {3860#true} #98#return; {3860#true} is VALID [2022-04-28 11:25:05,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {3860#true} call #t~ret6 := main(); {3860#true} is VALID [2022-04-28 11:25:05,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {3860#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3860#true} is VALID [2022-04-28 11:25:05,433 INFO L272 TraceCheckUtils]: 6: Hoare triple {3860#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {3860#true} ~cond := #in~cond; {3886#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:25:05,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {3886#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3890#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:25:05,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {3890#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3890#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:25:05,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3890#(not (= |assume_abort_if_not_#in~cond| 0))} {3860#true} #78#return; {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 11:25:05,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 11:25:05,435 INFO L272 TraceCheckUtils]: 12: Hoare triple {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,436 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3860#true} {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #80#return; {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 11:25:05,436 INFO L272 TraceCheckUtils]: 17: Hoare triple {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,437 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3860#true} {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #82#return; {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 11:25:05,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {3897#(and (<= 0 main_~x~0) (<= main_~x~0 1))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3934#(<= main_~r~0 1)} is VALID [2022-04-28 11:25:05,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {3934#(<= main_~r~0 1)} assume !false; {3934#(<= main_~r~0 1)} is VALID [2022-04-28 11:25:05,438 INFO L272 TraceCheckUtils]: 24: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,438 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #84#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-28 11:25:05,438 INFO L272 TraceCheckUtils]: 29: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,439 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #86#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-28 11:25:05,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {3934#(<= main_~r~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3934#(<= main_~r~0 1)} is VALID [2022-04-28 11:25:05,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {3934#(<= main_~r~0 1)} assume !false; {3934#(<= main_~r~0 1)} is VALID [2022-04-28 11:25:05,440 INFO L272 TraceCheckUtils]: 36: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,440 INFO L290 TraceCheckUtils]: 37: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,441 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #88#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-28 11:25:05,441 INFO L272 TraceCheckUtils]: 41: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,442 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #90#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-28 11:25:05,442 INFO L272 TraceCheckUtils]: 46: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,443 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #92#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-28 11:25:05,443 INFO L290 TraceCheckUtils]: 51: Hoare triple {3934#(<= main_~r~0 1)} assume !!(~r~0 >= 2 * ~b~0); {4022#(and (<= main_~r~0 1) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-28 11:25:05,443 INFO L272 TraceCheckUtils]: 52: Hoare triple {4022#(and (<= main_~r~0 1) (<= (* main_~b~0 2) main_~r~0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,443 INFO L290 TraceCheckUtils]: 53: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,444 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3860#true} {4022#(and (<= main_~r~0 1) (<= (* main_~b~0 2) main_~r~0))} #94#return; {4022#(and (<= main_~r~0 1) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-28 11:25:05,445 INFO L290 TraceCheckUtils]: 57: Hoare triple {4022#(and (<= main_~r~0 1) (<= (* main_~b~0 2) main_~r~0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} is VALID [2022-04-28 11:25:05,446 INFO L290 TraceCheckUtils]: 58: Hoare triple {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} assume !false; {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} is VALID [2022-04-28 11:25:05,446 INFO L272 TraceCheckUtils]: 59: Hoare triple {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,446 INFO L290 TraceCheckUtils]: 60: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,446 INFO L290 TraceCheckUtils]: 61: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,446 INFO L290 TraceCheckUtils]: 62: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,447 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {3860#true} {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} #88#return; {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} is VALID [2022-04-28 11:25:05,447 INFO L272 TraceCheckUtils]: 64: Hoare triple {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,447 INFO L290 TraceCheckUtils]: 65: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,447 INFO L290 TraceCheckUtils]: 66: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,447 INFO L290 TraceCheckUtils]: 67: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,448 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3860#true} {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} #90#return; {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} is VALID [2022-04-28 11:25:05,448 INFO L272 TraceCheckUtils]: 69: Hoare triple {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,448 INFO L290 TraceCheckUtils]: 70: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,449 INFO L290 TraceCheckUtils]: 71: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,449 INFO L290 TraceCheckUtils]: 72: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,449 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3860#true} {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} #92#return; {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} is VALID [2022-04-28 11:25:05,450 INFO L290 TraceCheckUtils]: 74: Hoare triple {4041#(and (<= main_~r~0 1) (<= (div (- main_~b~0) (- 2)) (div main_~r~0 2)))} assume !(~r~0 >= 2 * ~b~0); {3861#false} is VALID [2022-04-28 11:25:05,450 INFO L290 TraceCheckUtils]: 75: Hoare triple {3861#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {3861#false} is VALID [2022-04-28 11:25:05,450 INFO L290 TraceCheckUtils]: 76: Hoare triple {3861#false} assume !false; {3861#false} is VALID [2022-04-28 11:25:05,450 INFO L272 TraceCheckUtils]: 77: Hoare triple {3861#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3861#false} is VALID [2022-04-28 11:25:05,451 INFO L290 TraceCheckUtils]: 78: Hoare triple {3861#false} ~cond := #in~cond; {3861#false} is VALID [2022-04-28 11:25:05,451 INFO L290 TraceCheckUtils]: 79: Hoare triple {3861#false} assume !(0 == ~cond); {3861#false} is VALID [2022-04-28 11:25:05,451 INFO L290 TraceCheckUtils]: 80: Hoare triple {3861#false} assume true; {3861#false} is VALID [2022-04-28 11:25:05,451 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {3861#false} {3861#false} #84#return; {3861#false} is VALID [2022-04-28 11:25:05,451 INFO L272 TraceCheckUtils]: 82: Hoare triple {3861#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3861#false} is VALID [2022-04-28 11:25:05,451 INFO L290 TraceCheckUtils]: 83: Hoare triple {3861#false} ~cond := #in~cond; {3861#false} is VALID [2022-04-28 11:25:05,451 INFO L290 TraceCheckUtils]: 84: Hoare triple {3861#false} assume 0 == ~cond; {3861#false} is VALID [2022-04-28 11:25:05,451 INFO L290 TraceCheckUtils]: 85: Hoare triple {3861#false} assume !false; {3861#false} is VALID [2022-04-28 11:25:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-04-28 11:25:05,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:25:05,936 INFO L290 TraceCheckUtils]: 85: Hoare triple {3861#false} assume !false; {3861#false} is VALID [2022-04-28 11:25:05,936 INFO L290 TraceCheckUtils]: 84: Hoare triple {3861#false} assume 0 == ~cond; {3861#false} is VALID [2022-04-28 11:25:05,937 INFO L290 TraceCheckUtils]: 83: Hoare triple {3861#false} ~cond := #in~cond; {3861#false} is VALID [2022-04-28 11:25:05,937 INFO L272 TraceCheckUtils]: 82: Hoare triple {3861#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3861#false} is VALID [2022-04-28 11:25:05,937 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {3860#true} {3861#false} #84#return; {3861#false} is VALID [2022-04-28 11:25:05,937 INFO L290 TraceCheckUtils]: 80: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,937 INFO L290 TraceCheckUtils]: 79: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,937 INFO L290 TraceCheckUtils]: 78: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,937 INFO L272 TraceCheckUtils]: 77: Hoare triple {3861#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,937 INFO L290 TraceCheckUtils]: 76: Hoare triple {3861#false} assume !false; {3861#false} is VALID [2022-04-28 11:25:05,937 INFO L290 TraceCheckUtils]: 75: Hoare triple {3861#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {3861#false} is VALID [2022-04-28 11:25:05,943 INFO L290 TraceCheckUtils]: 74: Hoare triple {4159#(<= (* main_~b~0 2) main_~r~0)} assume !(~r~0 >= 2 * ~b~0); {3861#false} is VALID [2022-04-28 11:25:05,944 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3860#true} {4159#(<= (* main_~b~0 2) main_~r~0)} #92#return; {4159#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-28 11:25:05,944 INFO L290 TraceCheckUtils]: 72: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,944 INFO L290 TraceCheckUtils]: 71: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,944 INFO L290 TraceCheckUtils]: 70: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,944 INFO L272 TraceCheckUtils]: 69: Hoare triple {4159#(<= (* main_~b~0 2) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,945 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3860#true} {4159#(<= (* main_~b~0 2) main_~r~0)} #90#return; {4159#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-28 11:25:05,945 INFO L290 TraceCheckUtils]: 67: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,945 INFO L290 TraceCheckUtils]: 66: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,945 INFO L290 TraceCheckUtils]: 65: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,945 INFO L272 TraceCheckUtils]: 64: Hoare triple {4159#(<= (* main_~b~0 2) main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,945 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {3860#true} {4159#(<= (* main_~b~0 2) main_~r~0)} #88#return; {4159#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-28 11:25:05,945 INFO L290 TraceCheckUtils]: 62: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,945 INFO L290 TraceCheckUtils]: 61: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,945 INFO L290 TraceCheckUtils]: 60: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,946 INFO L272 TraceCheckUtils]: 59: Hoare triple {4159#(<= (* main_~b~0 2) main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,946 INFO L290 TraceCheckUtils]: 58: Hoare triple {4159#(<= (* main_~b~0 2) main_~r~0)} assume !false; {4159#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-28 11:25:05,946 INFO L290 TraceCheckUtils]: 57: Hoare triple {4211#(<= (* main_~b~0 2) (div main_~r~0 2))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {4159#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-28 11:25:05,947 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3860#true} {4211#(<= (* main_~b~0 2) (div main_~r~0 2))} #94#return; {4211#(<= (* main_~b~0 2) (div main_~r~0 2))} is VALID [2022-04-28 11:25:05,947 INFO L290 TraceCheckUtils]: 55: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,947 INFO L290 TraceCheckUtils]: 53: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,947 INFO L272 TraceCheckUtils]: 52: Hoare triple {4211#(<= (* main_~b~0 2) (div main_~r~0 2))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,947 INFO L290 TraceCheckUtils]: 51: Hoare triple {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} assume !!(~r~0 >= 2 * ~b~0); {4211#(<= (* main_~b~0 2) (div main_~r~0 2))} is VALID [2022-04-28 11:25:05,948 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3860#true} {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} #92#return; {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-28 11:25:05,948 INFO L290 TraceCheckUtils]: 49: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,948 INFO L272 TraceCheckUtils]: 46: Hoare triple {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,953 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3860#true} {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} #90#return; {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-28 11:25:05,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,953 INFO L272 TraceCheckUtils]: 41: Hoare triple {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,953 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3860#true} {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} #88#return; {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-28 11:25:05,954 INFO L290 TraceCheckUtils]: 39: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,954 INFO L290 TraceCheckUtils]: 38: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,954 INFO L290 TraceCheckUtils]: 37: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,954 INFO L272 TraceCheckUtils]: 36: Hoare triple {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} assume !false; {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-28 11:25:05,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {3934#(<= main_~r~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4230#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-28 11:25:05,955 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #86#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-28 11:25:05,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,955 INFO L272 TraceCheckUtils]: 29: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,956 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3860#true} {3934#(<= main_~r~0 1)} #84#return; {3934#(<= main_~r~0 1)} is VALID [2022-04-28 11:25:05,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,956 INFO L272 TraceCheckUtils]: 24: Hoare triple {3934#(<= main_~r~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {3934#(<= main_~r~0 1)} assume !false; {3934#(<= main_~r~0 1)} is VALID [2022-04-28 11:25:05,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {4318#(<= main_~x~0 1)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3934#(<= main_~r~0 1)} is VALID [2022-04-28 11:25:05,957 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3860#true} {4318#(<= main_~x~0 1)} #82#return; {4318#(<= main_~x~0 1)} is VALID [2022-04-28 11:25:05,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,957 INFO L272 TraceCheckUtils]: 17: Hoare triple {4318#(<= main_~x~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,958 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3860#true} {4318#(<= main_~x~0 1)} #80#return; {4318#(<= main_~x~0 1)} is VALID [2022-04-28 11:25:05,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {3860#true} assume !(0 == ~cond); {3860#true} is VALID [2022-04-28 11:25:05,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {3860#true} ~cond := #in~cond; {3860#true} is VALID [2022-04-28 11:25:05,958 INFO L272 TraceCheckUtils]: 12: Hoare triple {4318#(<= main_~x~0 1)} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {4318#(<= main_~x~0 1)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4318#(<= main_~x~0 1)} is VALID [2022-04-28 11:25:05,959 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3890#(not (= |assume_abort_if_not_#in~cond| 0))} {3860#true} #78#return; {4318#(<= main_~x~0 1)} is VALID [2022-04-28 11:25:05,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {3890#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3890#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:25:05,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {4364#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3890#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:25:05,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {3860#true} ~cond := #in~cond; {4364#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 11:25:05,960 INFO L272 TraceCheckUtils]: 6: Hoare triple {3860#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {3860#true} is VALID [2022-04-28 11:25:05,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {3860#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3860#true} is VALID [2022-04-28 11:25:05,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {3860#true} call #t~ret6 := main(); {3860#true} is VALID [2022-04-28 11:25:05,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3860#true} {3860#true} #98#return; {3860#true} is VALID [2022-04-28 11:25:05,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-28 11:25:05,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {3860#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(14, 2);call #Ultimate.allocInit(12, 3); {3860#true} is VALID [2022-04-28 11:25:05,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {3860#true} call ULTIMATE.init(); {3860#true} is VALID [2022-04-28 11:25:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-04-28 11:25:05,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:25:05,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147818025] [2022-04-28 11:25:05,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:25:05,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953675010] [2022-04-28 11:25:05,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953675010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:25:05,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:25:05,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2022-04-28 11:25:05,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:25:05,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1741995769] [2022-04-28 11:25:05,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1741995769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:25:05,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:25:05,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:25:05,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822239373] [2022-04-28 11:25:05,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:25:05,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 86 [2022-04-28 11:25:05,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:25:05,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:25:06,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:06,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:25:06,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:25:06,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:25:06,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:25:06,008 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:25:06,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:06,424 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2022-04-28 11:25:06,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:25:06,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 86 [2022-04-28 11:25:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:25:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:25:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-28 11:25:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:25:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-28 11:25:06,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 75 transitions. [2022-04-28 11:25:06,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:06,496 INFO L225 Difference]: With dead ends: 88 [2022-04-28 11:25:06,496 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:25:06,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:25:06,497 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:25:06,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 129 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:25:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:25:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:25:06,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:25:06,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:25:06,498 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:25:06,498 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:25:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:06,498 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:25:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:25:06,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:06,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:06,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:25:06,499 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:25:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:25:06,499 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:25:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:25:06,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:06,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:25:06,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:25:06,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:25:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:25:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:25:06,500 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2022-04-28 11:25:06,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:25:06,500 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:25:06,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-28 11:25:06,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:25:06,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:25:06,500 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:25:06,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:25:06,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:25:06,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 11:25:06,723 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 11:25:06,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:25:07,873 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 11:25:07,873 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 11:25:07,873 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 11:25:07,873 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 11:25:07,873 INFO L895 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 11:25:07,873 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:25:07,873 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 11:25:07,873 INFO L902 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2022-04-28 11:25:07,873 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 1)) [2022-04-28 11:25:07,873 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1)) [2022-04-28 11:25:07,873 INFO L895 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1)) [2022-04-28 11:25:07,873 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-28 11:25:07,873 INFO L895 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1)) [2022-04-28 11:25:07,873 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 66) the Hoare annotation is: true [2022-04-28 11:25:07,873 INFO L895 garLoopResultBuilder]: At program point L50(lines 47 59) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= main_~x~0 1)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse6 (<= main_~y~0 1))) (or (and .cse0 .cse1 .cse2 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-04-28 11:25:07,874 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= main_~x~0 1)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse6 (<= main_~y~0 1))) (or (and .cse0 .cse1 .cse2 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-04-28 11:25:07,874 INFO L895 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= main_~x~0 1)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse6 (<= main_~y~0 1))) (or (and .cse0 .cse1 .cse2 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-04-28 11:25:07,874 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 66) the Hoare annotation is: true [2022-04-28 11:25:07,874 INFO L895 garLoopResultBuilder]: At program point L40(lines 38 62) the Hoare annotation is: (let ((.cse0 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse1 (<= main_~y~0 1))) (or (and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse0 .cse1 (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0)) (and (= main_~x~0 main_~r~0) (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0) (<= 1 main_~y~0) .cse0 .cse1))) [2022-04-28 11:25:07,874 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse0 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse1 (<= main_~y~0 1))) (or (and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse0 .cse1 (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0)) (and (= main_~x~0 main_~r~0) (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) (= main_~b~0 0) (<= main_~x~0 1) (= main_~q~0 0) (<= 1 main_~y~0) .cse0 .cse1))) [2022-04-28 11:25:07,874 INFO L895 garLoopResultBuilder]: At program point L38-3(lines 38 62) the Hoare annotation is: (let ((.cse0 (<= main_~y~0 1))) (or (and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (= main_~b~0 (* main_~a~0 main_~y~0)) .cse0 (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) .cse0))) [2022-04-28 11:25:07,874 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 66) the Hoare annotation is: true [2022-04-28 11:25:07,874 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= main_~x~0 main_~r~0) (<= (* 2 .cse0) main_~r~0) (<= main_~x~0 1) (<= 1 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 .cse0) (<= main_~y~0 1))) [2022-04-28 11:25:07,874 INFO L895 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= main_~x~0 main_~r~0) (<= (* 2 .cse0) main_~r~0) (<= main_~x~0 1) (<= 1 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 .cse0) (<= main_~y~0 1))) [2022-04-28 11:25:07,874 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= main_~x~0 1)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse6 (<= main_~y~0 1))) (or (and .cse0 .cse1 .cse2 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-04-28 11:25:07,874 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= main_~x~0 1)) (.cse2 (<= 1 main_~r~0)) (.cse3 (= main_~q~0 0)) (.cse4 (<= 1 main_~y~0)) (.cse5 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse6 (<= main_~y~0 1))) (or (and .cse0 .cse1 .cse2 (= main_~b~0 main_~y~0) .cse3 .cse4 .cse5 .cse6) (and .cse0 (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-04-28 11:25:07,874 INFO L895 garLoopResultBuilder]: At program point L47-3(lines 47 59) the Hoare annotation is: (and (= main_~x~0 main_~r~0) (<= main_~x~0 1) (<= 1 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)) (<= main_~y~0 1)) [2022-04-28 11:25:07,874 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse1 (<= main_~y~0 1))) (or (and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse0 .cse1 (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0)) (and (= main_~x~0 main_~r~0) (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) (= main_~b~0 0) (<= main_~x~0 1) (= main_~q~0 0) (<= 1 main_~y~0) .cse0 .cse1))) [2022-04-28 11:25:07,874 INFO L895 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse0 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse1 (<= main_~y~0 1))) (or (and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse0 .cse1 (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0)) (and (= main_~x~0 main_~r~0) (<= (div (* (- 1) main_~b~0) (- 2)) (div main_~r~0 2)) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~q~0 0) (<= 1 main_~y~0) .cse0 .cse1))) [2022-04-28 11:25:07,875 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:25:07,875 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 11:25:07,875 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:25:07,875 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:25:07,875 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 11:25:07,875 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:25:07,875 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:25:07,875 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:25:07,875 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:25:07,875 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 11:25:07,875 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:25:07,875 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 11:25:07,875 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:25:07,878 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 11:25:07,879 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:25:07,882 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:25:07,883 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:25:07,914 INFO L163 areAnnotationChecker]: CFG has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 11:25:07,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:25:07 BoogieIcfgContainer [2022-04-28 11:25:07,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:25:07,925 INFO L158 Benchmark]: Toolchain (without parser) took 47270.31ms. Allocated memory was 178.3MB in the beginning and 256.9MB in the end (delta: 78.6MB). Free memory was 126.5MB in the beginning and 210.9MB in the end (delta: -84.4MB). Peak memory consumption was 120.0MB. Max. memory is 8.0GB. [2022-04-28 11:25:07,925 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 178.3MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:25:07,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.19ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 126.2MB in the beginning and 189.7MB in the end (delta: -63.5MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-28 11:25:07,926 INFO L158 Benchmark]: Boogie Preprocessor took 22.65ms. Allocated memory is still 213.9MB. Free memory was 189.7MB in the beginning and 188.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 11:25:07,926 INFO L158 Benchmark]: RCFGBuilder took 313.61ms. Allocated memory is still 213.9MB. Free memory was 188.0MB in the beginning and 175.8MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 11:25:07,926 INFO L158 Benchmark]: TraceAbstraction took 46710.48ms. Allocated memory was 213.9MB in the beginning and 256.9MB in the end (delta: 43.0MB). Free memory was 175.4MB in the beginning and 210.9MB in the end (delta: -35.4MB). Peak memory consumption was 132.7MB. Max. memory is 8.0GB. [2022-04-28 11:25:07,927 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.15ms. Allocated memory is still 178.3MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.19ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 126.2MB in the beginning and 189.7MB in the end (delta: -63.5MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.65ms. Allocated memory is still 213.9MB. Free memory was 189.7MB in the beginning and 188.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 313.61ms. Allocated memory is still 213.9MB. Free memory was 188.0MB in the beginning and 175.8MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 46710.48ms. Allocated memory was 213.9MB in the beginning and 256.9MB in the end (delta: 43.0MB). Free memory was 175.4MB in the beginning and 210.9MB in the end (delta: -35.4MB). Peak memory consumption was 132.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.6s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 1094 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 801 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 834 IncrementalHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 293 mSDtfsCounter, 834 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 512 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=7, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 259 PreInvPairs, 341 NumberOfFragments, 780 HoareAnnotationTreeSize, 259 FomulaSimplifications, 56 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 39 FomulaSimplificationsInter, 564 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((x == r && x <= 1) && 1 <= r) && b == y) && q == 0) && 1 <= y) && b == a * y) && y <= 1) || (((((((x == r && -1 * b / -2 <= r / 2) && x <= 1) && 1 <= r) && q == 0) && 1 <= y) && b == a * y) && y <= 1) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((x == y + r && q == 1) && b == a * y) && y <= 1) && y <= x) && r * 2 < x) || (((((((x == r && -1 * b / -2 <= r / 2) && b == 0) && x <= 1) && q == 0) && 1 <= y) && b == a * y) && y <= 1) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 11:25:07,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...