/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/egcd3-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:29:31,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:29:31,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:29:31,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:29:31,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:29:31,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:29:31,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:29:31,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:29:31,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:29:31,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:29:31,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:29:31,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:29:31,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:29:31,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:29:31,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:29:31,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:29:31,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:29:31,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:29:31,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:29:31,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:29:31,088 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:29:31,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:29:31,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:29:31,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:29:31,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:29:31,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:29:31,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:29:31,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:29:31,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:29:31,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:29:31,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:29:31,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:29:31,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:29:31,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:29:31,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:29:31,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:29:31,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:29:31,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:29:31,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:29:31,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:29:31,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:29:31,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:29:31,101 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 12:29:31,109 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:29:31,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:29:31,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:29:31,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:29:31,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:29:31,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:29:31,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:29:31,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:29:31,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:29:31,111 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:29:31,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:29:31,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:29:31,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:29:31,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:29:31,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:29:31,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:29:31,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:29:31,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:29:31,113 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:29:31,113 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:29:31,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:29:31,113 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:29:31,113 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 12:29:31,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:29:31,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:29:31,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:29:31,337 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:29:31,339 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:29:31,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound5.c [2022-04-28 12:29:31,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047fcf512/9188d397aa2f44369f96f3b36e6b5b74/FLAGe3ce38b08 [2022-04-28 12:29:31,704 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:29:31,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound5.c [2022-04-28 12:29:31,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047fcf512/9188d397aa2f44369f96f3b36e6b5b74/FLAGe3ce38b08 [2022-04-28 12:29:32,134 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/047fcf512/9188d397aa2f44369f96f3b36e6b5b74 [2022-04-28 12:29:32,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:29:32,138 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:29:32,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:29:32,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:29:32,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:29:32,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:29:32" (1/1) ... [2022-04-28 12:29:32,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6898d290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:29:32, skipping insertion in model container [2022-04-28 12:29:32,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:29:32" (1/1) ... [2022-04-28 12:29:32,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:29:32,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:29:32,359 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/egcd3-ll_unwindbound5.c[490,503] [2022-04-28 12:29:32,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:29:32,402 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:29:32,420 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/egcd3-ll_unwindbound5.c[490,503] [2022-04-28 12:29:32,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:29:32,451 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:29:32,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:29:32 WrapperNode [2022-04-28 12:29:32,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:29:32,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:29:32,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:29:32,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:29:32,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:29:32" (1/1) ... [2022-04-28 12:29:32,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:29:32" (1/1) ... [2022-04-28 12:29:32,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:29:32" (1/1) ... [2022-04-28 12:29:32,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:29:32" (1/1) ... [2022-04-28 12:29:32,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:29:32" (1/1) ... [2022-04-28 12:29:32,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:29:32" (1/1) ... [2022-04-28 12:29:32,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:29:32" (1/1) ... [2022-04-28 12:29:32,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:29:32,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:29:32,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:29:32,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:29:32,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:29:32" (1/1) ... [2022-04-28 12:29:32,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:29:32,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:32,507 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 12:29:32,509 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 12:29:32,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:29:32,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:29:32,540 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:29:32,541 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:29:32,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:29:32,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:29:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:29:32,541 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:29:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:29:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:29:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 12:29:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:29:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:29:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:29:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:29:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:29:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:29:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:29:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:29:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:29:32,594 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:29:32,596 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:29:32,741 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:29:32,747 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:29:32,747 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 12:29:32,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:29:32 BoogieIcfgContainer [2022-04-28 12:29:32,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:29:32,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:29:32,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:29:32,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:29:32,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:29:32" (1/3) ... [2022-04-28 12:29:32,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@973f15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:29:32, skipping insertion in model container [2022-04-28 12:29:32,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:29:32" (2/3) ... [2022-04-28 12:29:32,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@973f15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:29:32, skipping insertion in model container [2022-04-28 12:29:32,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:29:32" (3/3) ... [2022-04-28 12:29:32,756 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound5.c [2022-04-28 12:29:32,768 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:29:32,768 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:29:32,816 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:29:32,823 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@225be902, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d91efaa [2022-04-28 12:29:32,823 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:29:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 12:29:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 12:29:32,844 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:32,844 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:32,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:32,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:32,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1766263304, now seen corresponding path program 1 times [2022-04-28 12:29:32,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:32,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1162897338] [2022-04-28 12:29:32,888 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1766263304, now seen corresponding path program 2 times [2022-04-28 12:29:32,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:32,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289390736] [2022-04-28 12:29:32,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:33,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 12:29:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:33,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43#true} is VALID [2022-04-28 12:29:33,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 12:29:33,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-28 12:29:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 12:29:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:33,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:29:33,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:29:33,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:29:33,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 12:29:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 12:29:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:33,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:29:33,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:29:33,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:29:33,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 12:29:33,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 12:29:33,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43#true} is VALID [2022-04-28 12:29:33,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 12:29:33,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-28 12:29:33,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret9 := main(); {43#true} is VALID [2022-04-28 12:29:33,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {43#true} is VALID [2022-04-28 12:29:33,107 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 12:29:33,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:29:33,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:29:33,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:29:33,109 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 12:29:33,110 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 12:29:33,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 12:29:33,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 12:29:33,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 12:29:33,112 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 12:29:33,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {44#false} is VALID [2022-04-28 12:29:33,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-28 12:29:33,113 INFO L272 TraceCheckUtils]: 18: Hoare triple {44#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {44#false} is VALID [2022-04-28 12:29:33,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-28 12:29:33,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-28 12:29:33,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-28 12:29:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:33,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:33,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289390736] [2022-04-28 12:29:33,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289390736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:33,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:33,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:29:33,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:33,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1162897338] [2022-04-28 12:29:33,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1162897338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:33,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:33,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 12:29:33,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214684809] [2022-04-28 12:29:33,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:33,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 12:29:33,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:33,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:33,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:33,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 12:29:33,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:33,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 12:29:33,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:29:33,199 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:33,439 INFO L93 Difference]: Finished difference Result 74 states and 111 transitions. [2022-04-28 12:29:33,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 12:29:33,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 12:29:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-28 12:29:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-28 12:29:33,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-28 12:29:33,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:33,608 INFO L225 Difference]: With dead ends: 74 [2022-04-28 12:29:33,608 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 12:29:33,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 12:29:33,617 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:33,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:29:33,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 12:29:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-28 12:29:33,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:33,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:29:33,650 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:29:33,651 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:29:33,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:33,656 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-28 12:29:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-28 12:29:33,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:33,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:33,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 12:29:33,658 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 12:29:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:33,662 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-28 12:29:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-28 12:29:33,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:33,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:33,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:33,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:29:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-28 12:29:33,668 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-04-28 12:29:33,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:33,668 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-28 12:29:33,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:33,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 45 transitions. [2022-04-28 12:29:33,716 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 12:29:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-28 12:29:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:29:33,718 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:33,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:33,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 12:29:33,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:33,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:33,722 INFO L85 PathProgramCache]: Analyzing trace with hash -81203399, now seen corresponding path program 1 times [2022-04-28 12:29:33,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:33,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [302625881] [2022-04-28 12:29:33,725 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:33,726 INFO L85 PathProgramCache]: Analyzing trace with hash -81203399, now seen corresponding path program 2 times [2022-04-28 12:29:33,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:33,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358883483] [2022-04-28 12:29:33,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:33,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:33,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:33,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299016978] [2022-04-28 12:29:33,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:33,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:33,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:33,775 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 12:29:33,793 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 12:29:33,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:29:33,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:33,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:29:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:33,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:34,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2022-04-28 12:29:34,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {349#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#(<= ~counter~0 0)} {349#true} #108#return; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#(<= ~counter~0 0)} call #t~ret9 := main(); {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,054 INFO L272 TraceCheckUtils]: 6: Hoare triple {357#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {357#(<= ~counter~0 0)} ~cond := #in~cond; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {357#(<= ~counter~0 0)} assume !(0 == ~cond); {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,056 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {357#(<= ~counter~0 0)} {357#(<= ~counter~0 0)} #94#return; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,057 INFO L272 TraceCheckUtils]: 11: Hoare triple {357#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {357#(<= ~counter~0 0)} ~cond := #in~cond; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {357#(<= ~counter~0 0)} assume !(0 == ~cond); {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,063 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {357#(<= ~counter~0 0)} {357#(<= ~counter~0 0)} #96#return; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {357#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {357#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:34,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {357#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {406#(<= |main_#t~post6| 0)} is VALID [2022-04-28 12:29:34,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {406#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {350#false} is VALID [2022-04-28 12:29:34,065 INFO L272 TraceCheckUtils]: 19: Hoare triple {350#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {350#false} is VALID [2022-04-28 12:29:34,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {350#false} ~cond := #in~cond; {350#false} is VALID [2022-04-28 12:29:34,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {350#false} assume 0 == ~cond; {350#false} is VALID [2022-04-28 12:29:34,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {350#false} assume !false; {350#false} is VALID [2022-04-28 12:29:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:34,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:29:34,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:34,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358883483] [2022-04-28 12:29:34,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:34,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299016978] [2022-04-28 12:29:34,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299016978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:34,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:34,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:29:34,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:34,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [302625881] [2022-04-28 12:29:34,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [302625881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:34,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:34,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:29:34,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484930314] [2022-04-28 12:29:34,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:34,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 12:29:34,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:34,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:34,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:34,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:29:34,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:34,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:29:34,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:29:34,091 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:34,191 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-28 12:29:34,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:29:34,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 12:29:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-28 12:29:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-28 12:29:34,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-28 12:29:34,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:34,251 INFO L225 Difference]: With dead ends: 44 [2022-04-28 12:29:34,252 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 12:29:34,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:29:34,255 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:34,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:29:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 12:29:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 12:29:34,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:34,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:29:34,284 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:29:34,284 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:29:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:34,291 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-28 12:29:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 12:29:34,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:34,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:34,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-28 12:29:34,294 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-28 12:29:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:34,304 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-28 12:29:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 12:29:34,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:34,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:34,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:34,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 12:29:34,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-28 12:29:34,308 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-04-28 12:29:34,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:34,308 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-28 12:29:34,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:34,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-28 12:29:34,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 12:29:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 12:29:34,358 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:34,358 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:34,384 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 12:29:34,571 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 12:29:34,572 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:34,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:34,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1762644405, now seen corresponding path program 1 times [2022-04-28 12:29:34,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:34,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1041502691] [2022-04-28 12:29:34,573 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:34,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1762644405, now seen corresponding path program 2 times [2022-04-28 12:29:34,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:34,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170569407] [2022-04-28 12:29:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:34,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:34,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:34,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [655293907] [2022-04-28 12:29:34,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:34,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:34,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:34,596 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 12:29:34,597 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 12:29:34,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:29:34,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:34,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 12:29:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:34,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:34,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {657#true} call ULTIMATE.init(); {657#true} is VALID [2022-04-28 12:29:34,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {657#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {657#true} is VALID [2022-04-28 12:29:34,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#true} assume true; {657#true} is VALID [2022-04-28 12:29:34,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {657#true} {657#true} #108#return; {657#true} is VALID [2022-04-28 12:29:34,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {657#true} call #t~ret9 := main(); {657#true} is VALID [2022-04-28 12:29:34,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {657#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {657#true} is VALID [2022-04-28 12:29:34,852 INFO L272 TraceCheckUtils]: 6: Hoare triple {657#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {657#true} is VALID [2022-04-28 12:29:34,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#true} ~cond := #in~cond; {657#true} is VALID [2022-04-28 12:29:34,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#true} assume !(0 == ~cond); {657#true} is VALID [2022-04-28 12:29:34,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#true} assume true; {657#true} is VALID [2022-04-28 12:29:34,853 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {657#true} {657#true} #94#return; {657#true} is VALID [2022-04-28 12:29:34,853 INFO L272 TraceCheckUtils]: 11: Hoare triple {657#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {657#true} is VALID [2022-04-28 12:29:34,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {657#true} ~cond := #in~cond; {657#true} is VALID [2022-04-28 12:29:34,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {657#true} assume !(0 == ~cond); {657#true} is VALID [2022-04-28 12:29:34,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {657#true} assume true; {657#true} is VALID [2022-04-28 12:29:34,853 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {657#true} {657#true} #96#return; {657#true} is VALID [2022-04-28 12:29:34,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {657#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:34,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:34,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:34,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {710#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 != ~b~0); {720#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:34,857 INFO L272 TraceCheckUtils]: 20: Hoare triple {720#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {724#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:29:34,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {724#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {728#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:29:34,858 INFO L290 TraceCheckUtils]: 22: Hoare triple {728#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {658#false} is VALID [2022-04-28 12:29:34,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {658#false} assume !false; {658#false} is VALID [2022-04-28 12:29:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:34,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:29:34,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:34,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170569407] [2022-04-28 12:29:34,860 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:34,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655293907] [2022-04-28 12:29:34,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655293907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:34,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:34,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:29:34,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:34,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1041502691] [2022-04-28 12:29:34,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1041502691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:34,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:34,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:29:34,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811432799] [2022-04-28 12:29:34,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:34,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-28 12:29:34,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:34,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:29:34,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:34,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:29:34,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:34,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:29:34,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:29:34,881 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:29:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:35,213 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-28 12:29:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:29:35,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-28 12:29:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:29:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 12:29:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:29:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 12:29:35,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-28 12:29:35,292 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 12:29:35,294 INFO L225 Difference]: With dead ends: 57 [2022-04-28 12:29:35,295 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 12:29:35,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:29:35,296 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:35,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 169 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:29:35,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 12:29:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-28 12:29:35,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:35,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:29:35,315 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:29:35,316 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:29:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:35,319 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-04-28 12:29:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2022-04-28 12:29:35,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:35,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:35,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 54 states. [2022-04-28 12:29:35,321 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 54 states. [2022-04-28 12:29:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:35,324 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-04-28 12:29:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2022-04-28 12:29:35,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:35,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:35,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:35,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:29:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2022-04-28 12:29:35,328 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 24 [2022-04-28 12:29:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:35,329 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2022-04-28 12:29:35,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:29:35,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 70 transitions. [2022-04-28 12:29:35,411 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 12:29:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-28 12:29:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 12:29:35,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:35,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:35,442 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 12:29:35,627 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 12:29:35,628 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:35,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1090347867, now seen corresponding path program 1 times [2022-04-28 12:29:35,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:35,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [474400597] [2022-04-28 12:29:35,629 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:35,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1090347867, now seen corresponding path program 2 times [2022-04-28 12:29:35,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:35,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53691764] [2022-04-28 12:29:35,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:35,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:35,649 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:35,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [654392596] [2022-04-28 12:29:35,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:35,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:35,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:35,650 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 12:29:35,671 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 12:29:35,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:35,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:35,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:29:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:35,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:35,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2022-04-28 12:29:35,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#(<= ~counter~0 0)} {1066#true} #108#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#(<= ~counter~0 0)} call #t~ret9 := main(); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,868 INFO L272 TraceCheckUtils]: 6: Hoare triple {1074#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,870 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} #94#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,870 INFO L272 TraceCheckUtils]: 11: Hoare triple {1074#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,872 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} #96#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {1074#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:35,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {1074#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1123#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:35,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {1123#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1123#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:35,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {1123#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1123#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:35,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {1123#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1133#(<= |main_#t~post7| 1)} is VALID [2022-04-28 12:29:35,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {1133#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1067#false} is VALID [2022-04-28 12:29:35,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {1067#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1067#false} is VALID [2022-04-28 12:29:35,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {1067#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1067#false} is VALID [2022-04-28 12:29:35,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {1067#false} assume !(#t~post6 < 5);havoc #t~post6; {1067#false} is VALID [2022-04-28 12:29:35,876 INFO L272 TraceCheckUtils]: 25: Hoare triple {1067#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1067#false} is VALID [2022-04-28 12:29:35,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {1067#false} ~cond := #in~cond; {1067#false} is VALID [2022-04-28 12:29:35,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {1067#false} assume 0 == ~cond; {1067#false} is VALID [2022-04-28 12:29:35,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-28 12:29:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:35,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:29:35,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:35,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53691764] [2022-04-28 12:29:35,877 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:35,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654392596] [2022-04-28 12:29:35,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654392596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:35,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:35,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:29:35,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:35,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [474400597] [2022-04-28 12:29:35,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [474400597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:35,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:35,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:29:35,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600199404] [2022-04-28 12:29:35,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:35,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 12:29:35,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:35,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:35,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:35,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:29:35,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:35,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:29:35,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:29:35,899 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:36,026 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2022-04-28 12:29:36,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:29:36,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-28 12:29:36,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 12:29:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 12:29:36,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-28 12:29:36,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:36,095 INFO L225 Difference]: With dead ends: 77 [2022-04-28 12:29:36,095 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 12:29:36,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:29:36,097 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:36,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:29:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 12:29:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 12:29:36,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:36,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:29:36,123 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:29:36,123 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:29:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:36,127 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-04-28 12:29:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-28 12:29:36,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:36,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:36,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 55 states. [2022-04-28 12:29:36,129 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 55 states. [2022-04-28 12:29:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:36,134 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-04-28 12:29:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-28 12:29:36,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:36,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:36,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:36,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:29:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-04-28 12:29:36,140 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-04-28 12:29:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:36,147 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-04-28 12:29:36,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:36,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 72 transitions. [2022-04-28 12:29:36,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-28 12:29:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 12:29:36,212 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:36,212 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:36,239 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 12:29:36,437 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 12:29:36,437 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:36,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:36,438 INFO L85 PathProgramCache]: Analyzing trace with hash 979890972, now seen corresponding path program 1 times [2022-04-28 12:29:36,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:36,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [954266879] [2022-04-28 12:29:36,438 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:36,438 INFO L85 PathProgramCache]: Analyzing trace with hash 979890972, now seen corresponding path program 2 times [2022-04-28 12:29:36,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:36,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610111126] [2022-04-28 12:29:36,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:36,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:36,467 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:36,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116270924] [2022-04-28 12:29:36,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:36,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:36,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:36,479 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 12:29:36,480 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 12:29:36,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:36,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:36,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:29:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:36,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:36,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} call ULTIMATE.init(); {1531#true} is VALID [2022-04-28 12:29:36,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {1539#(<= ~counter~0 0)} assume true; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1539#(<= ~counter~0 0)} {1531#true} #108#return; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {1539#(<= ~counter~0 0)} call #t~ret9 := main(); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {1539#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,701 INFO L272 TraceCheckUtils]: 6: Hoare triple {1539#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {1539#(<= ~counter~0 0)} ~cond := #in~cond; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {1539#(<= ~counter~0 0)} assume !(0 == ~cond); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {1539#(<= ~counter~0 0)} assume true; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,703 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1539#(<= ~counter~0 0)} {1539#(<= ~counter~0 0)} #94#return; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,703 INFO L272 TraceCheckUtils]: 11: Hoare triple {1539#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {1539#(<= ~counter~0 0)} ~cond := #in~cond; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {1539#(<= ~counter~0 0)} assume !(0 == ~cond); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {1539#(<= ~counter~0 0)} assume true; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,705 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1539#(<= ~counter~0 0)} {1539#(<= ~counter~0 0)} #96#return; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {1539#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:36,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {1539#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1588#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:36,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {1588#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1588#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:36,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {1588#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1588#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:36,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {1588#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {1598#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {1598#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {1598#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {1598#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1611#(<= |main_#t~post6| 2)} is VALID [2022-04-28 12:29:36,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {1611#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {1532#false} is VALID [2022-04-28 12:29:36,710 INFO L272 TraceCheckUtils]: 26: Hoare triple {1532#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1532#false} is VALID [2022-04-28 12:29:36,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} ~cond := #in~cond; {1532#false} is VALID [2022-04-28 12:29:36,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} assume 0 == ~cond; {1532#false} is VALID [2022-04-28 12:29:36,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} assume !false; {1532#false} is VALID [2022-04-28 12:29:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:36,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:36,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} assume !false; {1532#false} is VALID [2022-04-28 12:29:36,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} assume 0 == ~cond; {1532#false} is VALID [2022-04-28 12:29:36,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} ~cond := #in~cond; {1532#false} is VALID [2022-04-28 12:29:36,887 INFO L272 TraceCheckUtils]: 26: Hoare triple {1532#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1532#false} is VALID [2022-04-28 12:29:36,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {1639#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1532#false} is VALID [2022-04-28 12:29:36,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {1643#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1639#(< |main_#t~post6| 5)} is VALID [2022-04-28 12:29:36,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {1643#(< ~counter~0 5)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1643#(< ~counter~0 5)} is VALID [2022-04-28 12:29:36,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {1643#(< ~counter~0 5)} assume !(~c~0 >= ~b~0); {1643#(< ~counter~0 5)} is VALID [2022-04-28 12:29:36,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {1643#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {1643#(< ~counter~0 5)} is VALID [2022-04-28 12:29:36,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {1656#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1643#(< ~counter~0 5)} is VALID [2022-04-28 12:29:36,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {1656#(< ~counter~0 4)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1656#(< ~counter~0 4)} is VALID [2022-04-28 12:29:36,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {1656#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {1656#(< ~counter~0 4)} is VALID [2022-04-28 12:29:36,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {1598#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1656#(< ~counter~0 4)} is VALID [2022-04-28 12:29:36,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {1598#(<= ~counter~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,892 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1531#true} {1598#(<= ~counter~0 2)} #96#return; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {1531#true} assume true; {1531#true} is VALID [2022-04-28 12:29:36,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {1531#true} assume !(0 == ~cond); {1531#true} is VALID [2022-04-28 12:29:36,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {1531#true} ~cond := #in~cond; {1531#true} is VALID [2022-04-28 12:29:36,892 INFO L272 TraceCheckUtils]: 11: Hoare triple {1598#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1531#true} is VALID [2022-04-28 12:29:36,893 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1531#true} {1598#(<= ~counter~0 2)} #94#return; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {1531#true} assume true; {1531#true} is VALID [2022-04-28 12:29:36,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {1531#true} assume !(0 == ~cond); {1531#true} is VALID [2022-04-28 12:29:36,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {1531#true} ~cond := #in~cond; {1531#true} is VALID [2022-04-28 12:29:36,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {1598#(<= ~counter~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1531#true} is VALID [2022-04-28 12:29:36,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {1598#(<= ~counter~0 2)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {1598#(<= ~counter~0 2)} call #t~ret9 := main(); {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1598#(<= ~counter~0 2)} {1531#true} #108#return; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {1598#(<= ~counter~0 2)} assume true; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {1531#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:36,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} call ULTIMATE.init(); {1531#true} is VALID [2022-04-28 12:29:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:36,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:36,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610111126] [2022-04-28 12:29:36,897 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:36,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116270924] [2022-04-28 12:29:36,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116270924] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:36,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:36,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 12:29:36,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:36,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [954266879] [2022-04-28 12:29:36,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [954266879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:36,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:36,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:29:36,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536263019] [2022-04-28 12:29:36,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:36,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-04-28 12:29:36,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:36,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:36,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:36,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:29:36,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:36,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:29:36,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:29:36,918 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:37,079 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2022-04-28 12:29:37,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:29:37,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-04-28 12:29:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 12:29:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 12:29:37,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-28 12:29:37,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:37,142 INFO L225 Difference]: With dead ends: 67 [2022-04-28 12:29:37,143 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 12:29:37,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:29:37,144 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:37,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 165 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:29:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 12:29:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-28 12:29:37,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:37,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:29:37,165 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:29:37,165 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:29:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:37,167 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-28 12:29:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2022-04-28 12:29:37,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:37,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:37,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 60 states. [2022-04-28 12:29:37,168 INFO L87 Difference]: Start difference. First operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 60 states. [2022-04-28 12:29:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:37,171 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-28 12:29:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2022-04-28 12:29:37,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:37,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:37,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:37,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 12:29:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2022-04-28 12:29:37,174 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 30 [2022-04-28 12:29:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:37,174 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2022-04-28 12:29:37,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:37,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 77 transitions. [2022-04-28 12:29:37,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-28 12:29:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 12:29:37,255 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:37,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:37,272 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 12:29:37,459 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 12:29:37,459 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:37,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:37,460 INFO L85 PathProgramCache]: Analyzing trace with hash 296831538, now seen corresponding path program 1 times [2022-04-28 12:29:37,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:37,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [533271532] [2022-04-28 12:29:37,461 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash 296831538, now seen corresponding path program 2 times [2022-04-28 12:29:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:37,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328069951] [2022-04-28 12:29:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:37,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:37,491 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:37,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1536958279] [2022-04-28 12:29:37,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:37,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:37,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:37,497 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 12:29:37,498 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 12:29:37,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:37,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:37,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:29:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:37,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:37,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {2093#true} call ULTIMATE.init(); {2093#true} is VALID [2022-04-28 12:29:37,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {2093#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2093#true} is VALID [2022-04-28 12:29:37,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {2093#true} assume true; {2093#true} is VALID [2022-04-28 12:29:37,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2093#true} {2093#true} #108#return; {2093#true} is VALID [2022-04-28 12:29:37,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {2093#true} call #t~ret9 := main(); {2093#true} is VALID [2022-04-28 12:29:37,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {2093#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2093#true} is VALID [2022-04-28 12:29:37,703 INFO L272 TraceCheckUtils]: 6: Hoare triple {2093#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2093#true} is VALID [2022-04-28 12:29:37,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {2093#true} ~cond := #in~cond; {2119#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:29:37,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {2119#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2123#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:37,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {2123#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2123#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:37,705 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2123#(not (= |assume_abort_if_not_#in~cond| 0))} {2093#true} #94#return; {2130#(<= 1 main_~x~0)} is VALID [2022-04-28 12:29:37,705 INFO L272 TraceCheckUtils]: 11: Hoare triple {2130#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2093#true} is VALID [2022-04-28 12:29:37,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {2093#true} ~cond := #in~cond; {2093#true} is VALID [2022-04-28 12:29:37,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {2093#true} assume !(0 == ~cond); {2093#true} is VALID [2022-04-28 12:29:37,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {2093#true} assume true; {2093#true} is VALID [2022-04-28 12:29:37,706 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2093#true} {2130#(<= 1 main_~x~0)} #96#return; {2130#(<= 1 main_~x~0)} is VALID [2022-04-28 12:29:37,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {2130#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2149#(<= 1 main_~a~0)} is VALID [2022-04-28 12:29:37,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {2149#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2149#(<= 1 main_~a~0)} is VALID [2022-04-28 12:29:37,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {2149#(<= 1 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {2149#(<= 1 main_~a~0)} is VALID [2022-04-28 12:29:37,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {2149#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2159#(<= 1 main_~c~0)} is VALID [2022-04-28 12:29:37,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {2159#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2159#(<= 1 main_~c~0)} is VALID [2022-04-28 12:29:37,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {2159#(<= 1 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {2159#(<= 1 main_~c~0)} is VALID [2022-04-28 12:29:37,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {2159#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2159#(<= 1 main_~c~0)} is VALID [2022-04-28 12:29:37,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {2159#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {2172#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:37,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {2172#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2172#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:37,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {2172#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {2172#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:37,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {2172#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2094#false} is VALID [2022-04-28 12:29:37,715 INFO L272 TraceCheckUtils]: 27: Hoare triple {2094#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {2094#false} is VALID [2022-04-28 12:29:37,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {2094#false} ~cond := #in~cond; {2094#false} is VALID [2022-04-28 12:29:37,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {2094#false} assume 0 == ~cond; {2094#false} is VALID [2022-04-28 12:29:37,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {2094#false} assume !false; {2094#false} is VALID [2022-04-28 12:29:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 12:29:37,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:37,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {2094#false} assume !false; {2094#false} is VALID [2022-04-28 12:29:37,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {2094#false} assume 0 == ~cond; {2094#false} is VALID [2022-04-28 12:29:37,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {2094#false} ~cond := #in~cond; {2094#false} is VALID [2022-04-28 12:29:37,936 INFO L272 TraceCheckUtils]: 27: Hoare triple {2094#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {2094#false} is VALID [2022-04-28 12:29:37,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {2172#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2094#false} is VALID [2022-04-28 12:29:37,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {2172#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {2172#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:37,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {2172#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2172#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:37,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {2159#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {2172#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:37,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {2159#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2159#(<= 1 main_~c~0)} is VALID [2022-04-28 12:29:37,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {2159#(<= 1 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {2159#(<= 1 main_~c~0)} is VALID [2022-04-28 12:29:37,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {2159#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2159#(<= 1 main_~c~0)} is VALID [2022-04-28 12:29:37,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {2149#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2159#(<= 1 main_~c~0)} is VALID [2022-04-28 12:29:37,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {2149#(<= 1 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {2149#(<= 1 main_~a~0)} is VALID [2022-04-28 12:29:37,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {2149#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2149#(<= 1 main_~a~0)} is VALID [2022-04-28 12:29:37,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {2130#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2149#(<= 1 main_~a~0)} is VALID [2022-04-28 12:29:37,941 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2093#true} {2130#(<= 1 main_~x~0)} #96#return; {2130#(<= 1 main_~x~0)} is VALID [2022-04-28 12:29:37,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {2093#true} assume true; {2093#true} is VALID [2022-04-28 12:29:37,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {2093#true} assume !(0 == ~cond); {2093#true} is VALID [2022-04-28 12:29:37,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {2093#true} ~cond := #in~cond; {2093#true} is VALID [2022-04-28 12:29:37,942 INFO L272 TraceCheckUtils]: 11: Hoare triple {2130#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2093#true} is VALID [2022-04-28 12:29:37,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2123#(not (= |assume_abort_if_not_#in~cond| 0))} {2093#true} #94#return; {2130#(<= 1 main_~x~0)} is VALID [2022-04-28 12:29:37,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {2123#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2123#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:37,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {2263#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2123#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:37,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {2093#true} ~cond := #in~cond; {2263#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 12:29:37,944 INFO L272 TraceCheckUtils]: 6: Hoare triple {2093#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2093#true} is VALID [2022-04-28 12:29:37,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {2093#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2093#true} is VALID [2022-04-28 12:29:37,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {2093#true} call #t~ret9 := main(); {2093#true} is VALID [2022-04-28 12:29:37,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2093#true} {2093#true} #108#return; {2093#true} is VALID [2022-04-28 12:29:37,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {2093#true} assume true; {2093#true} is VALID [2022-04-28 12:29:37,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {2093#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2093#true} is VALID [2022-04-28 12:29:37,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {2093#true} call ULTIMATE.init(); {2093#true} is VALID [2022-04-28 12:29:37,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 12:29:37,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:37,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328069951] [2022-04-28 12:29:37,945 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:37,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536958279] [2022-04-28 12:29:37,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536958279] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:37,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:37,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 12:29:37,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:37,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [533271532] [2022-04-28 12:29:37,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [533271532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:37,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:37,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:29:37,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473717108] [2022-04-28 12:29:37,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:37,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-28 12:29:37,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:37,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:37,967 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 12:29:37,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:29:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:37,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:29:37,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:29:37,968 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:38,782 INFO L93 Difference]: Finished difference Result 138 states and 201 transitions. [2022-04-28 12:29:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 12:29:38,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-28 12:29:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-28 12:29:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-28 12:29:38,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 155 transitions. [2022-04-28 12:29:38,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:38,942 INFO L225 Difference]: With dead ends: 138 [2022-04-28 12:29:38,942 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 12:29:38,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-28 12:29:38,943 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 117 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:38,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 300 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:29:38,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 12:29:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2022-04-28 12:29:39,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:39,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:29:39,061 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:29:39,061 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:29:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:39,067 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2022-04-28 12:29:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2022-04-28 12:29:39,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:39,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:39,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 131 states. [2022-04-28 12:29:39,069 INFO L87 Difference]: Start difference. First operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 131 states. [2022-04-28 12:29:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:39,074 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2022-04-28 12:29:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2022-04-28 12:29:39,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:39,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:39,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:39,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 67 states have internal predecessors, (90), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:29:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2022-04-28 12:29:39,079 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 31 [2022-04-28 12:29:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:39,080 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2022-04-28 12:29:39,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:39,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 122 transitions. [2022-04-28 12:29:39,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2022-04-28 12:29:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 12:29:39,209 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:39,209 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-04-28 12:29:39,235 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 12:29:39,409 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 12:29:39,410 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:39,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:39,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1911367052, now seen corresponding path program 1 times [2022-04-28 12:29:39,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:39,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1415528258] [2022-04-28 12:29:39,410 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:39,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1911367052, now seen corresponding path program 2 times [2022-04-28 12:29:39,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:39,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070859626] [2022-04-28 12:29:39,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:39,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:39,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:39,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481722295] [2022-04-28 12:29:39,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:39,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:39,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:39,430 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 12:29:39,456 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 12:29:39,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:39,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:39,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:29:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:39,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:39,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {3015#true} call ULTIMATE.init(); {3015#true} is VALID [2022-04-28 12:29:39,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {3015#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {3023#(<= ~counter~0 0)} assume true; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3023#(<= ~counter~0 0)} {3015#true} #108#return; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {3023#(<= ~counter~0 0)} call #t~ret9 := main(); {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {3023#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,687 INFO L272 TraceCheckUtils]: 6: Hoare triple {3023#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {3023#(<= ~counter~0 0)} ~cond := #in~cond; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {3023#(<= ~counter~0 0)} assume !(0 == ~cond); {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {3023#(<= ~counter~0 0)} assume true; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,689 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3023#(<= ~counter~0 0)} {3023#(<= ~counter~0 0)} #94#return; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,690 INFO L272 TraceCheckUtils]: 11: Hoare triple {3023#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {3023#(<= ~counter~0 0)} ~cond := #in~cond; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {3023#(<= ~counter~0 0)} assume !(0 == ~cond); {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {3023#(<= ~counter~0 0)} assume true; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,691 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3023#(<= ~counter~0 0)} {3023#(<= ~counter~0 0)} #96#return; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {3023#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:39,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {3023#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3072#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:39,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {3072#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {3072#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:39,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {3072#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3072#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:39,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {3072#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3082#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:39,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {3082#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {3082#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:39,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {3082#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3082#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:39,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {3082#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3092#(<= |main_#t~post8| 2)} is VALID [2022-04-28 12:29:39,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {3092#(<= |main_#t~post8| 2)} assume !(#t~post8 < 5);havoc #t~post8; {3016#false} is VALID [2022-04-28 12:29:39,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {3016#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {3016#false} is VALID [2022-04-28 12:29:39,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {3016#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3016#false} is VALID [2022-04-28 12:29:39,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {3016#false} assume !(#t~post7 < 5);havoc #t~post7; {3016#false} is VALID [2022-04-28 12:29:39,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {3016#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3016#false} is VALID [2022-04-28 12:29:39,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {3016#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3016#false} is VALID [2022-04-28 12:29:39,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {3016#false} assume !(#t~post6 < 5);havoc #t~post6; {3016#false} is VALID [2022-04-28 12:29:39,708 INFO L272 TraceCheckUtils]: 31: Hoare triple {3016#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {3016#false} is VALID [2022-04-28 12:29:39,708 INFO L290 TraceCheckUtils]: 32: Hoare triple {3016#false} ~cond := #in~cond; {3016#false} is VALID [2022-04-28 12:29:39,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {3016#false} assume 0 == ~cond; {3016#false} is VALID [2022-04-28 12:29:39,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {3016#false} assume !false; {3016#false} is VALID [2022-04-28 12:29:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:39,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:29:39,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:39,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070859626] [2022-04-28 12:29:39,709 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:39,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481722295] [2022-04-28 12:29:39,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481722295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:39,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:39,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:29:39,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:39,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1415528258] [2022-04-28 12:29:39,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1415528258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:39,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:39,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:29:39,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492362300] [2022-04-28 12:29:39,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:39,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-04-28 12:29:39,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:39,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:39,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:39,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:29:39,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:39,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:29:39,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:29:39,733 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:39,971 INFO L93 Difference]: Finished difference Result 127 states and 178 transitions. [2022-04-28 12:29:39,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:29:39,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-04-28 12:29:39,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-28 12:29:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:39,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-28 12:29:39,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2022-04-28 12:29:40,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:40,047 INFO L225 Difference]: With dead ends: 127 [2022-04-28 12:29:40,047 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 12:29:40,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:29:40,048 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:40,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 115 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:29:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 12:29:40,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-04-28 12:29:40,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:40,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:29:40,187 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:29:40,187 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:29:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:40,190 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-04-28 12:29:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-28 12:29:40,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:40,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:40,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 90 states. [2022-04-28 12:29:40,192 INFO L87 Difference]: Start difference. First operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 90 states. [2022-04-28 12:29:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:40,195 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-04-28 12:29:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-28 12:29:40,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:40,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:40,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:40,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 69 states have internal predecessors, (92), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 12:29:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2022-04-28 12:29:40,199 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 35 [2022-04-28 12:29:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:40,199 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2022-04-28 12:29:40,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:40,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 124 transitions. [2022-04-28 12:29:40,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-28 12:29:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 12:29:40,328 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:40,328 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-04-28 12:29:40,352 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 12:29:40,528 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 12:29:40,529 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:40,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash -304485816, now seen corresponding path program 1 times [2022-04-28 12:29:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:40,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1834539638] [2022-04-28 12:29:40,529 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:40,530 INFO L85 PathProgramCache]: Analyzing trace with hash -304485816, now seen corresponding path program 2 times [2022-04-28 12:29:40,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:40,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804252044] [2022-04-28 12:29:40,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:40,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:40,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:40,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2085126771] [2022-04-28 12:29:40,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:40,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:40,554 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 12:29:40,562 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 12:29:40,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:40,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:40,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:29:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:40,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:40,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {3739#true} call ULTIMATE.init(); {3739#true} is VALID [2022-04-28 12:29:40,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {3739#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {3747#(<= ~counter~0 0)} assume true; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3747#(<= ~counter~0 0)} {3739#true} #108#return; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {3747#(<= ~counter~0 0)} call #t~ret9 := main(); {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {3747#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,848 INFO L272 TraceCheckUtils]: 6: Hoare triple {3747#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {3747#(<= ~counter~0 0)} ~cond := #in~cond; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {3747#(<= ~counter~0 0)} assume !(0 == ~cond); {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {3747#(<= ~counter~0 0)} assume true; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,850 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3747#(<= ~counter~0 0)} {3747#(<= ~counter~0 0)} #94#return; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,851 INFO L272 TraceCheckUtils]: 11: Hoare triple {3747#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {3747#(<= ~counter~0 0)} ~cond := #in~cond; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {3747#(<= ~counter~0 0)} assume !(0 == ~cond); {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {3747#(<= ~counter~0 0)} assume true; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,853 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3747#(<= ~counter~0 0)} {3747#(<= ~counter~0 0)} #96#return; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {3747#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:40,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {3747#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:40,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {3796#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:40,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {3796#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:40,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {3796#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3806#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:40,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {3806#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {3806#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:40,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {3806#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {3806#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:40,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {3806#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3806#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:40,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {3806#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3819#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:40,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {3819#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {3819#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:40,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {3819#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3819#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:40,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {3819#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3829#(<= |main_#t~post7| 3)} is VALID [2022-04-28 12:29:40,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {3829#(<= |main_#t~post7| 3)} assume !(#t~post7 < 5);havoc #t~post7; {3740#false} is VALID [2022-04-28 12:29:40,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {3740#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3740#false} is VALID [2022-04-28 12:29:40,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {3740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3740#false} is VALID [2022-04-28 12:29:40,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {3740#false} assume !(#t~post6 < 5);havoc #t~post6; {3740#false} is VALID [2022-04-28 12:29:40,860 INFO L272 TraceCheckUtils]: 32: Hoare triple {3740#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {3740#false} is VALID [2022-04-28 12:29:40,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {3740#false} ~cond := #in~cond; {3740#false} is VALID [2022-04-28 12:29:40,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {3740#false} assume 0 == ~cond; {3740#false} is VALID [2022-04-28 12:29:40,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {3740#false} assume !false; {3740#false} is VALID [2022-04-28 12:29:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:40,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:41,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {3740#false} assume !false; {3740#false} is VALID [2022-04-28 12:29:41,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {3740#false} assume 0 == ~cond; {3740#false} is VALID [2022-04-28 12:29:41,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {3740#false} ~cond := #in~cond; {3740#false} is VALID [2022-04-28 12:29:41,105 INFO L272 TraceCheckUtils]: 32: Hoare triple {3740#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {3740#false} is VALID [2022-04-28 12:29:41,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {3740#false} assume !(#t~post6 < 5);havoc #t~post6; {3740#false} is VALID [2022-04-28 12:29:41,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {3740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3740#false} is VALID [2022-04-28 12:29:41,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {3740#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3740#false} is VALID [2022-04-28 12:29:41,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {3875#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {3740#false} is VALID [2022-04-28 12:29:41,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3875#(< |main_#t~post7| 5)} is VALID [2022-04-28 12:29:41,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {3879#(< ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3879#(< ~counter~0 5)} is VALID [2022-04-28 12:29:41,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {3879#(< ~counter~0 5)} is VALID [2022-04-28 12:29:41,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {3819#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#(< ~counter~0 5)} is VALID [2022-04-28 12:29:41,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {3819#(<= ~counter~0 3)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3819#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:41,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {3819#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {3819#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:41,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {3819#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {3819#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:41,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {3806#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3819#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:41,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {3806#(<= ~counter~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3806#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:41,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {3806#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {3806#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:41,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {3796#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3806#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:41,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {3796#(<= ~counter~0 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:41,113 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3739#true} {3796#(<= ~counter~0 1)} #96#return; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:41,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {3739#true} assume true; {3739#true} is VALID [2022-04-28 12:29:41,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {3739#true} assume !(0 == ~cond); {3739#true} is VALID [2022-04-28 12:29:41,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {3739#true} ~cond := #in~cond; {3739#true} is VALID [2022-04-28 12:29:41,114 INFO L272 TraceCheckUtils]: 11: Hoare triple {3796#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3739#true} is VALID [2022-04-28 12:29:41,115 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3739#true} {3796#(<= ~counter~0 1)} #94#return; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:41,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {3739#true} assume true; {3739#true} is VALID [2022-04-28 12:29:41,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {3739#true} assume !(0 == ~cond); {3739#true} is VALID [2022-04-28 12:29:41,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {3739#true} ~cond := #in~cond; {3739#true} is VALID [2022-04-28 12:29:41,115 INFO L272 TraceCheckUtils]: 6: Hoare triple {3796#(<= ~counter~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3739#true} is VALID [2022-04-28 12:29:41,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {3796#(<= ~counter~0 1)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:41,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {3796#(<= ~counter~0 1)} call #t~ret9 := main(); {3796#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:41,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3796#(<= ~counter~0 1)} {3739#true} #108#return; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:41,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {3796#(<= ~counter~0 1)} assume true; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:41,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {3739#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:41,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {3739#true} call ULTIMATE.init(); {3739#true} is VALID [2022-04-28 12:29:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:41,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:41,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804252044] [2022-04-28 12:29:41,118 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:41,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085126771] [2022-04-28 12:29:41,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085126771] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:41,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:41,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 12:29:41,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:41,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1834539638] [2022-04-28 12:29:41,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1834539638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:41,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:41,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:29:41,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875079208] [2022-04-28 12:29:41,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:41,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-28 12:29:41,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:41,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:41,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:41,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:29:41,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:41,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:29:41,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:29:41,144 INFO L87 Difference]: Start difference. First operand 90 states and 124 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:41,519 INFO L93 Difference]: Finished difference Result 163 states and 227 transitions. [2022-04-28 12:29:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:29:41,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-28 12:29:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-04-28 12:29:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-04-28 12:29:41,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 109 transitions. [2022-04-28 12:29:41,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:41,609 INFO L225 Difference]: With dead ends: 163 [2022-04-28 12:29:41,609 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 12:29:41,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:29:41,611 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 35 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:41,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 175 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:29:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 12:29:41,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-28 12:29:41,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:41,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:29:41,768 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:29:41,769 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:29:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:41,772 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2022-04-28 12:29:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 149 transitions. [2022-04-28 12:29:41,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:41,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:41,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-28 12:29:41,774 INFO L87 Difference]: Start difference. First operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-28 12:29:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:41,777 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2022-04-28 12:29:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 149 transitions. [2022-04-28 12:29:41,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:41,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:41,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:41,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:41,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 12:29:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2022-04-28 12:29:41,782 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 36 [2022-04-28 12:29:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:41,782 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2022-04-28 12:29:41,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:41,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 147 transitions. [2022-04-28 12:29:41,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2022-04-28 12:29:41,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 12:29:41,934 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:41,934 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:41,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:42,155 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 12:29:42,156 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:42,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1581560821, now seen corresponding path program 1 times [2022-04-28 12:29:42,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:42,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [538958639] [2022-04-28 12:29:42,156 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1581560821, now seen corresponding path program 2 times [2022-04-28 12:29:42,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:42,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845650278] [2022-04-28 12:29:42,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:42,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:42,170 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:42,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176317919] [2022-04-28 12:29:42,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:42,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:42,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:42,171 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:42,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 12:29:42,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:42,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:42,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 12:29:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:42,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:42,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {4733#true} call ULTIMATE.init(); {4733#true} is VALID [2022-04-28 12:29:42,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {4733#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4733#true} is VALID [2022-04-28 12:29:42,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-28 12:29:42,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4733#true} {4733#true} #108#return; {4733#true} is VALID [2022-04-28 12:29:42,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {4733#true} call #t~ret9 := main(); {4733#true} is VALID [2022-04-28 12:29:42,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {4733#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4733#true} is VALID [2022-04-28 12:29:42,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {4733#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4733#true} is VALID [2022-04-28 12:29:42,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {4733#true} ~cond := #in~cond; {4759#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:29:42,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {4759#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4763#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:42,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {4763#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4763#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:42,602 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4763#(not (= |assume_abort_if_not_#in~cond| 0))} {4733#true} #94#return; {4770#(<= 1 main_~x~0)} is VALID [2022-04-28 12:29:42,602 INFO L272 TraceCheckUtils]: 11: Hoare triple {4770#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4733#true} is VALID [2022-04-28 12:29:42,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-28 12:29:42,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-28 12:29:42,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-28 12:29:42,615 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4733#true} {4770#(<= 1 main_~x~0)} #96#return; {4770#(<= 1 main_~x~0)} is VALID [2022-04-28 12:29:42,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {4770#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:29:42,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:29:42,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:29:42,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:29:42,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:29:42,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:29:42,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 12:29:42,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {4789#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:29:42,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:29:42,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post6 < 5);havoc #t~post6; {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:29:42,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:29:42,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:29:42,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post7 < 5);havoc #t~post7; {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:29:42,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:29:42,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:29:42,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post8 < 5);havoc #t~post8; {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-28 12:29:42,625 INFO L272 TraceCheckUtils]: 32: Hoare triple {4811#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4839#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:29:42,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {4839#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4843#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:29:42,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {4843#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4734#false} is VALID [2022-04-28 12:29:42,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {4734#false} assume !false; {4734#false} is VALID [2022-04-28 12:29:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 12:29:42,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:42,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {4734#false} assume !false; {4734#false} is VALID [2022-04-28 12:29:42,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {4843#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4734#false} is VALID [2022-04-28 12:29:42,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {4839#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4843#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:29:42,875 INFO L272 TraceCheckUtils]: 32: Hoare triple {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4839#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:29:42,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post8 < 5);havoc #t~post8; {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:29:42,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:29:42,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:29:42,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:29:42,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:29:42,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:29:42,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:29:42,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:29:42,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4859#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:29:42,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:42,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:42,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:42,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:42,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:42,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:42,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {4733#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4887#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:42,885 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4733#true} {4733#true} #96#return; {4733#true} is VALID [2022-04-28 12:29:42,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-28 12:29:42,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-28 12:29:42,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-28 12:29:42,886 INFO L272 TraceCheckUtils]: 11: Hoare triple {4733#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4733#true} is VALID [2022-04-28 12:29:42,886 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4733#true} {4733#true} #94#return; {4733#true} is VALID [2022-04-28 12:29:42,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-28 12:29:42,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-28 12:29:42,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-28 12:29:42,886 INFO L272 TraceCheckUtils]: 6: Hoare triple {4733#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4733#true} is VALID [2022-04-28 12:29:42,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {4733#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4733#true} is VALID [2022-04-28 12:29:42,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {4733#true} call #t~ret9 := main(); {4733#true} is VALID [2022-04-28 12:29:42,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4733#true} {4733#true} #108#return; {4733#true} is VALID [2022-04-28 12:29:42,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-28 12:29:42,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {4733#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4733#true} is VALID [2022-04-28 12:29:42,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {4733#true} call ULTIMATE.init(); {4733#true} is VALID [2022-04-28 12:29:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:42,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:42,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845650278] [2022-04-28 12:29:42,887 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:42,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176317919] [2022-04-28 12:29:42,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176317919] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:42,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:42,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-28 12:29:42,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:42,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [538958639] [2022-04-28 12:29:42,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [538958639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:42,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:42,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:29:42,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668959474] [2022-04-28 12:29:42,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:42,889 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-28 12:29:42,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:42,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:42,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:42,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:29:42,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:42,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:29:42,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:29:42,920 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:43,698 INFO L93 Difference]: Finished difference Result 154 states and 208 transitions. [2022-04-28 12:29:43,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:29:43,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-28 12:29:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-28 12:29:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-28 12:29:43,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2022-04-28 12:29:43,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:43,788 INFO L225 Difference]: With dead ends: 154 [2022-04-28 12:29:43,788 INFO L226 Difference]: Without dead ends: 152 [2022-04-28 12:29:43,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-28 12:29:43,789 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 55 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:43,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 340 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:29:43,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-28 12:29:44,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2022-04-28 12:29:44,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:44,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:29:44,012 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:29:44,013 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:29:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:44,018 INFO L93 Difference]: Finished difference Result 152 states and 206 transitions. [2022-04-28 12:29:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 206 transitions. [2022-04-28 12:29:44,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:44,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:44,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 152 states. [2022-04-28 12:29:44,019 INFO L87 Difference]: Start difference. First operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 152 states. [2022-04-28 12:29:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:44,024 INFO L93 Difference]: Finished difference Result 152 states and 206 transitions. [2022-04-28 12:29:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 206 transitions. [2022-04-28 12:29:44,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:44,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:44,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:44,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:29:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 202 transitions. [2022-04-28 12:29:44,030 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 202 transitions. Word has length 36 [2022-04-28 12:29:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:44,030 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 202 transitions. [2022-04-28 12:29:44,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:44,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 202 transitions. [2022-04-28 12:29:44,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:44,235 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 202 transitions. [2022-04-28 12:29:44,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 12:29:44,235 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:44,235 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-04-28 12:29:44,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:44,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 12:29:44,440 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:44,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash -428189223, now seen corresponding path program 3 times [2022-04-28 12:29:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:44,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1548269812] [2022-04-28 12:29:44,440 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash -428189223, now seen corresponding path program 4 times [2022-04-28 12:29:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:44,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51386739] [2022-04-28 12:29:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:44,458 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:44,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645872790] [2022-04-28 12:29:44,459 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:29:44,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:44,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:44,460 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:44,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 12:29:44,496 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:29:44,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:44,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:29:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:44,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:44,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {5871#true} call ULTIMATE.init(); {5871#true} is VALID [2022-04-28 12:29:44,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {5871#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5871#true} is VALID [2022-04-28 12:29:44,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#true} assume true; {5871#true} is VALID [2022-04-28 12:29:44,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#true} {5871#true} #108#return; {5871#true} is VALID [2022-04-28 12:29:44,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {5871#true} call #t~ret9 := main(); {5871#true} is VALID [2022-04-28 12:29:44,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {5871#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5871#true} is VALID [2022-04-28 12:29:44,619 INFO L272 TraceCheckUtils]: 6: Hoare triple {5871#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5871#true} is VALID [2022-04-28 12:29:44,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {5871#true} ~cond := #in~cond; {5871#true} is VALID [2022-04-28 12:29:44,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {5871#true} assume !(0 == ~cond); {5871#true} is VALID [2022-04-28 12:29:44,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {5871#true} assume true; {5871#true} is VALID [2022-04-28 12:29:44,619 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5871#true} {5871#true} #94#return; {5871#true} is VALID [2022-04-28 12:29:44,619 INFO L272 TraceCheckUtils]: 11: Hoare triple {5871#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5871#true} is VALID [2022-04-28 12:29:44,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {5871#true} ~cond := #in~cond; {5871#true} is VALID [2022-04-28 12:29:44,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {5871#true} assume !(0 == ~cond); {5871#true} is VALID [2022-04-28 12:29:44,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {5871#true} assume true; {5871#true} is VALID [2022-04-28 12:29:44,619 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5871#true} {5871#true} #96#return; {5871#true} is VALID [2022-04-28 12:29:44,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {5871#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5871#true} is VALID [2022-04-28 12:29:44,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {5871#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5871#true} is VALID [2022-04-28 12:29:44,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {5871#true} assume !!(#t~post6 < 5);havoc #t~post6; {5871#true} is VALID [2022-04-28 12:29:44,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {5871#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5871#true} is VALID [2022-04-28 12:29:44,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {5871#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5871#true} is VALID [2022-04-28 12:29:44,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {5871#true} assume !!(#t~post7 < 5);havoc #t~post7; {5871#true} is VALID [2022-04-28 12:29:44,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {5871#true} assume !(~c~0 >= ~b~0); {5942#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 12:29:44,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {5942#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {5946#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:29:44,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {5946#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5946#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:29:44,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {5946#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {5946#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 12:29:44,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {5946#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5956#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:29:44,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {5956#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5956#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:29:44,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {5956#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {5956#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 12:29:44,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {5956#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {5872#false} is VALID [2022-04-28 12:29:44,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {5872#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {5872#false} is VALID [2022-04-28 12:29:44,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {5872#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5872#false} is VALID [2022-04-28 12:29:44,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {5872#false} assume !(#t~post6 < 5);havoc #t~post6; {5872#false} is VALID [2022-04-28 12:29:44,626 INFO L272 TraceCheckUtils]: 33: Hoare triple {5872#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {5872#false} is VALID [2022-04-28 12:29:44,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {5872#false} ~cond := #in~cond; {5872#false} is VALID [2022-04-28 12:29:44,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {5872#false} assume 0 == ~cond; {5872#false} is VALID [2022-04-28 12:29:44,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {5872#false} assume !false; {5872#false} is VALID [2022-04-28 12:29:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:44,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:29:44,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:44,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51386739] [2022-04-28 12:29:44,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:44,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645872790] [2022-04-28 12:29:44,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645872790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:44,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:44,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:29:44,627 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:44,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1548269812] [2022-04-28 12:29:44,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1548269812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:44,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:44,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:29:44,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195512611] [2022-04-28 12:29:44,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:44,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-04-28 12:29:44,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:44,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:29:44,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:44,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:29:44,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:44,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:29:44,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:29:44,649 INFO L87 Difference]: Start difference. First operand 148 states and 202 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:29:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:45,325 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2022-04-28 12:29:45,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:29:45,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-04-28 12:29:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:29:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-28 12:29:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:29:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-28 12:29:45,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2022-04-28 12:29:45,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:45,430 INFO L225 Difference]: With dead ends: 300 [2022-04-28 12:29:45,430 INFO L226 Difference]: Without dead ends: 249 [2022-04-28 12:29:45,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 12:29:45,431 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 29 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:45,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 176 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:29:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-28 12:29:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 175. [2022-04-28 12:29:45,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:45,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:29:45,761 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:29:45,761 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:29:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:45,768 INFO L93 Difference]: Finished difference Result 249 states and 361 transitions. [2022-04-28 12:29:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2022-04-28 12:29:45,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:45,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:45,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 249 states. [2022-04-28 12:29:45,770 INFO L87 Difference]: Start difference. First operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 249 states. [2022-04-28 12:29:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:45,778 INFO L93 Difference]: Finished difference Result 249 states and 361 transitions. [2022-04-28 12:29:45,778 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2022-04-28 12:29:45,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:45,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:45,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:45,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 137 states have internal predecessors, (183), 29 states have call successors, (29), 10 states have call predecessors, (29), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-28 12:29:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 239 transitions. [2022-04-28 12:29:45,785 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 239 transitions. Word has length 37 [2022-04-28 12:29:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:45,785 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 239 transitions. [2022-04-28 12:29:45,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:29:45,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 239 transitions. [2022-04-28 12:29:46,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 239 transitions. [2022-04-28 12:29:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 12:29:46,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:46,021 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:46,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:46,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 12:29:46,222 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash -957710478, now seen corresponding path program 1 times [2022-04-28 12:29:46,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:46,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913553494] [2022-04-28 12:29:46,223 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:46,223 INFO L85 PathProgramCache]: Analyzing trace with hash -957710478, now seen corresponding path program 2 times [2022-04-28 12:29:46,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:46,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616359030] [2022-04-28 12:29:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:46,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:46,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:46,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [157536195] [2022-04-28 12:29:46,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:46,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:46,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:46,240 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:46,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 12:29:46,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:46,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:46,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:29:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:46,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:46,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {7439#true} call ULTIMATE.init(); {7439#true} is VALID [2022-04-28 12:29:46,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {7439#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7439#true} is VALID [2022-04-28 12:29:46,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {7439#true} assume true; {7439#true} is VALID [2022-04-28 12:29:46,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7439#true} {7439#true} #108#return; {7439#true} is VALID [2022-04-28 12:29:46,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {7439#true} call #t~ret9 := main(); {7439#true} is VALID [2022-04-28 12:29:46,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {7439#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7439#true} is VALID [2022-04-28 12:29:46,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {7439#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7439#true} is VALID [2022-04-28 12:29:46,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {7439#true} ~cond := #in~cond; {7439#true} is VALID [2022-04-28 12:29:46,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {7439#true} assume !(0 == ~cond); {7439#true} is VALID [2022-04-28 12:29:46,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {7439#true} assume true; {7439#true} is VALID [2022-04-28 12:29:46,522 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7439#true} {7439#true} #94#return; {7439#true} is VALID [2022-04-28 12:29:46,523 INFO L272 TraceCheckUtils]: 11: Hoare triple {7439#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7439#true} is VALID [2022-04-28 12:29:46,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {7439#true} ~cond := #in~cond; {7480#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:29:46,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {7480#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7484#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:46,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {7484#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7484#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:46,524 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7484#(not (= |assume_abort_if_not_#in~cond| 0))} {7439#true} #96#return; {7491#(<= 1 main_~y~0)} is VALID [2022-04-28 12:29:46,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {7491#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7495#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:46,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {7495#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7495#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:46,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {7495#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {7495#(<= 1 main_~b~0)} is VALID [2022-04-28 12:29:46,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {7495#(<= 1 main_~b~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:46,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:46,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post7 < 5);havoc #t~post7; {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:46,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:46,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:46,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post8 < 5);havoc #t~post8; {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:46,528 INFO L272 TraceCheckUtils]: 25: Hoare triple {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7439#true} is VALID [2022-04-28 12:29:46,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {7439#true} ~cond := #in~cond; {7439#true} is VALID [2022-04-28 12:29:46,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {7439#true} assume !(0 == ~cond); {7439#true} is VALID [2022-04-28 12:29:46,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {7439#true} assume true; {7439#true} is VALID [2022-04-28 12:29:46,529 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {7439#true} {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #98#return; {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:46,529 INFO L272 TraceCheckUtils]: 30: Hoare triple {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7439#true} is VALID [2022-04-28 12:29:46,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {7439#true} ~cond := #in~cond; {7439#true} is VALID [2022-04-28 12:29:46,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {7439#true} assume !(0 == ~cond); {7439#true} is VALID [2022-04-28 12:29:46,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {7439#true} assume true; {7439#true} is VALID [2022-04-28 12:29:46,530 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7439#true} {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #100#return; {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 12:29:46,531 INFO L272 TraceCheckUtils]: 35: Hoare triple {7505#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7554#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:29:46,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {7554#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7558#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:29:46,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {7558#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7440#false} is VALID [2022-04-28 12:29:46,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {7440#false} assume !false; {7440#false} is VALID [2022-04-28 12:29:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 12:29:46,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:29:46,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:46,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616359030] [2022-04-28 12:29:46,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:46,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157536195] [2022-04-28 12:29:46,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157536195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:46,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:46,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:29:46,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:46,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913553494] [2022-04-28 12:29:46,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913553494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:46,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:46,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 12:29:46,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796367730] [2022-04-28 12:29:46,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:46,533 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-28 12:29:46,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:46,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:29:46,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:46,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 12:29:46,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:46,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 12:29:46,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:29:46,559 INFO L87 Difference]: Start difference. First operand 175 states and 239 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:29:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:47,279 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2022-04-28 12:29:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:29:47,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-28 12:29:47,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:29:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-04-28 12:29:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:29:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-04-28 12:29:47,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 92 transitions. [2022-04-28 12:29:47,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:47,368 INFO L225 Difference]: With dead ends: 193 [2022-04-28 12:29:47,368 INFO L226 Difference]: Without dead ends: 191 [2022-04-28 12:29:47,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-28 12:29:47,369 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 61 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:47,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 244 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:29:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-28 12:29:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2022-04-28 12:29:47,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:47,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:29:47,723 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:29:47,724 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:29:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:47,728 INFO L93 Difference]: Finished difference Result 191 states and 259 transitions. [2022-04-28 12:29:47,728 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2022-04-28 12:29:47,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:47,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:47,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 191 states. [2022-04-28 12:29:47,729 INFO L87 Difference]: Start difference. First operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 191 states. [2022-04-28 12:29:47,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:47,734 INFO L93 Difference]: Finished difference Result 191 states and 259 transitions. [2022-04-28 12:29:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2022-04-28 12:29:47,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:47,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:47,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:47,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 145 states have (on average 1.3379310344827586) internal successors, (194), 146 states have internal predecessors, (194), 33 states have call successors, (33), 12 states have call predecessors, (33), 11 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:29:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 258 transitions. [2022-04-28 12:29:47,740 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 258 transitions. Word has length 39 [2022-04-28 12:29:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:47,740 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 258 transitions. [2022-04-28 12:29:47,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:29:47,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 258 transitions. [2022-04-28 12:29:47,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 258 transitions. [2022-04-28 12:29:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 12:29:47,989 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:47,989 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 12:29:48,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:48,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 12:29:48,189 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:48,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:48,190 INFO L85 PathProgramCache]: Analyzing trace with hash 409018142, now seen corresponding path program 1 times [2022-04-28 12:29:48,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:48,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [116862670] [2022-04-28 12:29:48,190 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:48,190 INFO L85 PathProgramCache]: Analyzing trace with hash 409018142, now seen corresponding path program 2 times [2022-04-28 12:29:48,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:48,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323645391] [2022-04-28 12:29:48,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:48,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:48,206 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:48,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324653251] [2022-04-28 12:29:48,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:48,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:48,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:48,208 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:48,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 12:29:48,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:48,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:48,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 12:29:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:48,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:48,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {8720#true} call ULTIMATE.init(); {8720#true} is VALID [2022-04-28 12:29:48,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {8720#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8720#true} is VALID [2022-04-28 12:29:48,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 12:29:48,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8720#true} {8720#true} #108#return; {8720#true} is VALID [2022-04-28 12:29:48,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {8720#true} call #t~ret9 := main(); {8720#true} is VALID [2022-04-28 12:29:48,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {8720#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8720#true} is VALID [2022-04-28 12:29:48,813 INFO L272 TraceCheckUtils]: 6: Hoare triple {8720#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8720#true} is VALID [2022-04-28 12:29:48,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {8720#true} ~cond := #in~cond; {8746#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:29:48,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {8746#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8750#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:48,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {8750#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8750#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:48,815 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8750#(not (= |assume_abort_if_not_#in~cond| 0))} {8720#true} #94#return; {8757#(<= 1 main_~x~0)} is VALID [2022-04-28 12:29:48,815 INFO L272 TraceCheckUtils]: 11: Hoare triple {8757#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8720#true} is VALID [2022-04-28 12:29:48,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {8720#true} ~cond := #in~cond; {8746#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 12:29:48,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {8746#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8750#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:48,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {8750#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8750#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 12:29:48,826 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8750#(not (= |assume_abort_if_not_#in~cond| 0))} {8757#(<= 1 main_~x~0)} #96#return; {8773#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-28 12:29:48,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {8773#(and (<= 1 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8777#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:48,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {8777#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8777#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:48,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {8777#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {8777#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:48,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {8777#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8787#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:48,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {8787#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8787#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:48,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {8787#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {8787#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:48,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {8787#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {8787#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:29:48,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {8787#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:29:48,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:29:48,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(#t~post6 < 5);havoc #t~post6; {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:29:48,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:29:48,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:29:48,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(#t~post7 < 5);havoc #t~post7; {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:29:48,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:29:48,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:29:48,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(#t~post8 < 5);havoc #t~post8; {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:29:48,836 INFO L272 TraceCheckUtils]: 32: Hoare triple {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8720#true} is VALID [2022-04-28 12:29:48,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 12:29:48,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 12:29:48,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 12:29:48,838 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8720#true} {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #98#return; {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-28 12:29:48,839 INFO L272 TraceCheckUtils]: 37: Hoare triple {8800#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:29:48,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {8843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:29:48,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {8847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8721#false} is VALID [2022-04-28 12:29:48,840 INFO L290 TraceCheckUtils]: 40: Hoare triple {8721#false} assume !false; {8721#false} is VALID [2022-04-28 12:29:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:48,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:49,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {8721#false} assume !false; {8721#false} is VALID [2022-04-28 12:29:49,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {8847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8721#false} is VALID [2022-04-28 12:29:49,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {8843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:29:49,177 INFO L272 TraceCheckUtils]: 37: Hoare triple {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:29:49,178 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8720#true} {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #98#return; {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:49,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 12:29:49,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 12:29:49,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 12:29:49,178 INFO L272 TraceCheckUtils]: 32: Hoare triple {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8720#true} is VALID [2022-04-28 12:29:49,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post8 < 5);havoc #t~post8; {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:49,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:49,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:49,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:49,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:49,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:49,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:49,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:49,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {8906#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8863#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 12:29:49,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {8906#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !(~c~0 >= ~b~0); {8906#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 12:29:49,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {8906#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {8906#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 12:29:49,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {8906#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8906#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 12:29:49,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {8919#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8906#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 12:29:49,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {8919#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {8919#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:29:49,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {8919#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8919#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:29:49,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {8720#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8919#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:29:49,688 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8720#true} {8720#true} #96#return; {8720#true} is VALID [2022-04-28 12:29:49,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 12:29:49,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 12:29:49,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 12:29:49,688 INFO L272 TraceCheckUtils]: 11: Hoare triple {8720#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8720#true} is VALID [2022-04-28 12:29:49,688 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8720#true} {8720#true} #94#return; {8720#true} is VALID [2022-04-28 12:29:49,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 12:29:49,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 12:29:49,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 12:29:49,689 INFO L272 TraceCheckUtils]: 6: Hoare triple {8720#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8720#true} is VALID [2022-04-28 12:29:49,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {8720#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8720#true} is VALID [2022-04-28 12:29:49,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {8720#true} call #t~ret9 := main(); {8720#true} is VALID [2022-04-28 12:29:49,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8720#true} {8720#true} #108#return; {8720#true} is VALID [2022-04-28 12:29:49,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 12:29:49,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {8720#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8720#true} is VALID [2022-04-28 12:29:49,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {8720#true} call ULTIMATE.init(); {8720#true} is VALID [2022-04-28 12:29:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:49,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:49,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323645391] [2022-04-28 12:29:49,690 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:49,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324653251] [2022-04-28 12:29:49,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324653251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:49,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:49,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-04-28 12:29:49,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:49,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [116862670] [2022-04-28 12:29:49,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [116862670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:49,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:49,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 12:29:49,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972872230] [2022-04-28 12:29:49,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:49,691 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2022-04-28 12:29:49,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:49,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 12:29:49,719 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 12:29:49,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 12:29:49,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:49,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 12:29:49,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 12:29:49,719 INFO L87 Difference]: Start difference. First operand 190 states and 258 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 12:29:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:50,830 INFO L93 Difference]: Finished difference Result 199 states and 266 transitions. [2022-04-28 12:29:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 12:29:50,831 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2022-04-28 12:29:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 12:29:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 12:29:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 12:29:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 12:29:50,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-28 12:29:50,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:50,968 INFO L225 Difference]: With dead ends: 199 [2022-04-28 12:29:50,968 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 12:29:50,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-28 12:29:50,969 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 105 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:50,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 299 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 12:29:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 12:29:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2022-04-28 12:29:51,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:51,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:29:51,337 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:29:51,338 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:29:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:51,342 INFO L93 Difference]: Finished difference Result 197 states and 264 transitions. [2022-04-28 12:29:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2022-04-28 12:29:51,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:51,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:51,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 197 states. [2022-04-28 12:29:51,344 INFO L87 Difference]: Start difference. First operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 197 states. [2022-04-28 12:29:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:51,349 INFO L93 Difference]: Finished difference Result 197 states and 264 transitions. [2022-04-28 12:29:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2022-04-28 12:29:51,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:51,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:51,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:51,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 149 states have internal predecessors, (197), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 12:29:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 261 transitions. [2022-04-28 12:29:51,355 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 261 transitions. Word has length 41 [2022-04-28 12:29:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:51,355 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 261 transitions. [2022-04-28 12:29:51,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 12:29:51,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 261 transitions. [2022-04-28 12:29:51,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 261 transitions. [2022-04-28 12:29:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 12:29:51,605 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:51,605 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:29:51,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:51,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 12:29:51,828 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:51,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1943393983, now seen corresponding path program 1 times [2022-04-28 12:29:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:51,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1306344124] [2022-04-28 12:29:51,829 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:51,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1943393983, now seen corresponding path program 2 times [2022-04-28 12:29:51,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:51,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463678525] [2022-04-28 12:29:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:51,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:51,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:51,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313440759] [2022-04-28 12:29:51,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:51,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:51,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:51,847 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:51,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 12:29:51,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:51,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:51,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:29:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:51,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:52,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {10165#true} call ULTIMATE.init(); {10165#true} is VALID [2022-04-28 12:29:52,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {10165#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10165#true} is VALID [2022-04-28 12:29:52,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {10165#true} assume true; {10165#true} is VALID [2022-04-28 12:29:52,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10165#true} {10165#true} #108#return; {10165#true} is VALID [2022-04-28 12:29:52,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {10165#true} call #t~ret9 := main(); {10165#true} is VALID [2022-04-28 12:29:52,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {10165#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10165#true} is VALID [2022-04-28 12:29:52,014 INFO L272 TraceCheckUtils]: 6: Hoare triple {10165#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10165#true} is VALID [2022-04-28 12:29:52,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {10165#true} ~cond := #in~cond; {10165#true} is VALID [2022-04-28 12:29:52,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {10165#true} assume !(0 == ~cond); {10165#true} is VALID [2022-04-28 12:29:52,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {10165#true} assume true; {10165#true} is VALID [2022-04-28 12:29:52,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10165#true} {10165#true} #94#return; {10165#true} is VALID [2022-04-28 12:29:52,014 INFO L272 TraceCheckUtils]: 11: Hoare triple {10165#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10165#true} is VALID [2022-04-28 12:29:52,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {10165#true} ~cond := #in~cond; {10165#true} is VALID [2022-04-28 12:29:52,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {10165#true} assume !(0 == ~cond); {10165#true} is VALID [2022-04-28 12:29:52,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {10165#true} assume true; {10165#true} is VALID [2022-04-28 12:29:52,015 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10165#true} {10165#true} #96#return; {10165#true} is VALID [2022-04-28 12:29:52,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {10165#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {10165#true} is VALID [2022-04-28 12:29:52,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {10165#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10165#true} is VALID [2022-04-28 12:29:52,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {10165#true} assume !!(#t~post6 < 5);havoc #t~post6; {10165#true} is VALID [2022-04-28 12:29:52,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {10165#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {10165#true} is VALID [2022-04-28 12:29:52,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {10165#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10165#true} is VALID [2022-04-28 12:29:52,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {10165#true} assume !!(#t~post7 < 5);havoc #t~post7; {10165#true} is VALID [2022-04-28 12:29:52,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {10165#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:29:52,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:29:52,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !!(#t~post8 < 5);havoc #t~post8; {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:29:52,016 INFO L272 TraceCheckUtils]: 25: Hoare triple {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10165#true} is VALID [2022-04-28 12:29:52,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {10165#true} ~cond := #in~cond; {10165#true} is VALID [2022-04-28 12:29:52,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {10165#true} assume !(0 == ~cond); {10165#true} is VALID [2022-04-28 12:29:52,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {10165#true} assume true; {10165#true} is VALID [2022-04-28 12:29:52,017 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {10165#true} {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #98#return; {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:29:52,017 INFO L272 TraceCheckUtils]: 30: Hoare triple {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10165#true} is VALID [2022-04-28 12:29:52,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {10165#true} ~cond := #in~cond; {10165#true} is VALID [2022-04-28 12:29:52,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {10165#true} assume !(0 == ~cond); {10165#true} is VALID [2022-04-28 12:29:52,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {10165#true} assume true; {10165#true} is VALID [2022-04-28 12:29:52,018 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10165#true} {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #100#return; {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:29:52,018 INFO L272 TraceCheckUtils]: 35: Hoare triple {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10165#true} is VALID [2022-04-28 12:29:52,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {10165#true} ~cond := #in~cond; {10165#true} is VALID [2022-04-28 12:29:52,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {10165#true} assume !(0 == ~cond); {10165#true} is VALID [2022-04-28 12:29:52,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {10165#true} assume true; {10165#true} is VALID [2022-04-28 12:29:52,019 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10165#true} {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-28 12:29:52,019 INFO L272 TraceCheckUtils]: 40: Hoare triple {10236#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:29:52,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {10291#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:29:52,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {10295#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10166#false} is VALID [2022-04-28 12:29:52,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {10166#false} assume !false; {10166#false} is VALID [2022-04-28 12:29:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 12:29:52,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:29:52,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:52,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463678525] [2022-04-28 12:29:52,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:52,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313440759] [2022-04-28 12:29:52,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313440759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:52,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:52,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:29:52,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:52,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1306344124] [2022-04-28 12:29:52,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1306344124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:52,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:52,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:29:52,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904961974] [2022-04-28 12:29:52,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:52,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-28 12:29:52,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:52,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 12:29:52,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:52,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:29:52,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:52,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:29:52,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:29:52,048 INFO L87 Difference]: Start difference. First operand 194 states and 261 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 12:29:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:52,734 INFO L93 Difference]: Finished difference Result 261 states and 367 transitions. [2022-04-28 12:29:52,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:29:52,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-28 12:29:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 12:29:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 12:29:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 12:29:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 12:29:52,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 12:29:52,788 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 12:29:52,794 INFO L225 Difference]: With dead ends: 261 [2022-04-28 12:29:52,794 INFO L226 Difference]: Without dead ends: 259 [2022-04-28 12:29:52,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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 12:29:52,795 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:52,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 163 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:29:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-28 12:29:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 228. [2022-04-28 12:29:53,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:53,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 12:29:53,251 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 12:29:53,251 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 12:29:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:53,258 INFO L93 Difference]: Finished difference Result 259 states and 364 transitions. [2022-04-28 12:29:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 364 transitions. [2022-04-28 12:29:53,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:53,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:53,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) Second operand 259 states. [2022-04-28 12:29:53,260 INFO L87 Difference]: Start difference. First operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) Second operand 259 states. [2022-04-28 12:29:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:53,268 INFO L93 Difference]: Finished difference Result 259 states and 364 transitions. [2022-04-28 12:29:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 364 transitions. [2022-04-28 12:29:53,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:53,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:53,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:53,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 161 states have (on average 1.329192546583851) internal successors, (214), 167 states have internal predecessors, (214), 53 states have call successors, (53), 14 states have call predecessors, (53), 13 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-28 12:29:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 318 transitions. [2022-04-28 12:29:53,277 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 318 transitions. Word has length 44 [2022-04-28 12:29:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:53,277 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 318 transitions. [2022-04-28 12:29:53,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 12:29:53,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 228 states and 318 transitions. [2022-04-28 12:29:53,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 318 transitions. [2022-04-28 12:29:53,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 12:29:53,699 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:53,699 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-04-28 12:29:53,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 12:29:53,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 12:29:53,900 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:53,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash -772903697, now seen corresponding path program 1 times [2022-04-28 12:29:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:53,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [992725975] [2022-04-28 12:29:53,901 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash -772903697, now seen corresponding path program 2 times [2022-04-28 12:29:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:53,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051223198] [2022-04-28 12:29:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:53,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:53,912 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:53,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2076111865] [2022-04-28 12:29:53,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:53,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:53,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:53,914 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:53,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 12:29:53,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:53,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:53,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:29:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:53,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:29:54,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {11799#true} call ULTIMATE.init(); {11799#true} is VALID [2022-04-28 12:29:54,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {11799#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {11807#(<= ~counter~0 0)} assume true; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11807#(<= ~counter~0 0)} {11799#true} #108#return; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {11807#(<= ~counter~0 0)} call #t~ret9 := main(); {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {11807#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,176 INFO L272 TraceCheckUtils]: 6: Hoare triple {11807#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {11807#(<= ~counter~0 0)} ~cond := #in~cond; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {11807#(<= ~counter~0 0)} assume !(0 == ~cond); {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {11807#(<= ~counter~0 0)} assume true; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,177 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11807#(<= ~counter~0 0)} {11807#(<= ~counter~0 0)} #94#return; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,178 INFO L272 TraceCheckUtils]: 11: Hoare triple {11807#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {11807#(<= ~counter~0 0)} ~cond := #in~cond; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {11807#(<= ~counter~0 0)} assume !(0 == ~cond); {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {11807#(<= ~counter~0 0)} assume true; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,179 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11807#(<= ~counter~0 0)} {11807#(<= ~counter~0 0)} #96#return; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {11807#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {11807#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11856#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:54,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {11856#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {11856#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:54,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {11856#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11856#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:54,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {11856#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11866#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:54,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {11866#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {11866#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:54,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {11866#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {11866#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:54,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {11866#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11866#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:54,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {11866#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11879#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:54,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {11879#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {11879#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:54,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {11879#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11879#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:54,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {11879#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:54,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {11889#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:54,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {11889#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:54,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {11889#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11899#(<= |main_#t~post8| 4)} is VALID [2022-04-28 12:29:54,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {11899#(<= |main_#t~post8| 4)} assume !(#t~post8 < 5);havoc #t~post8; {11800#false} is VALID [2022-04-28 12:29:54,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {11800#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11800#false} is VALID [2022-04-28 12:29:54,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {11800#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11800#false} is VALID [2022-04-28 12:29:54,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {11800#false} assume !(#t~post7 < 5);havoc #t~post7; {11800#false} is VALID [2022-04-28 12:29:54,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {11800#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11800#false} is VALID [2022-04-28 12:29:54,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {11800#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11800#false} is VALID [2022-04-28 12:29:54,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {11800#false} assume !(#t~post6 < 5);havoc #t~post6; {11800#false} is VALID [2022-04-28 12:29:54,185 INFO L272 TraceCheckUtils]: 38: Hoare triple {11800#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {11800#false} is VALID [2022-04-28 12:29:54,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {11800#false} ~cond := #in~cond; {11800#false} is VALID [2022-04-28 12:29:54,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {11800#false} assume 0 == ~cond; {11800#false} is VALID [2022-04-28 12:29:54,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {11800#false} assume !false; {11800#false} is VALID [2022-04-28 12:29:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:54,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:29:54,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {11800#false} assume !false; {11800#false} is VALID [2022-04-28 12:29:54,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {11800#false} assume 0 == ~cond; {11800#false} is VALID [2022-04-28 12:29:54,398 INFO L290 TraceCheckUtils]: 39: Hoare triple {11800#false} ~cond := #in~cond; {11800#false} is VALID [2022-04-28 12:29:54,398 INFO L272 TraceCheckUtils]: 38: Hoare triple {11800#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {11800#false} is VALID [2022-04-28 12:29:54,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {11800#false} assume !(#t~post6 < 5);havoc #t~post6; {11800#false} is VALID [2022-04-28 12:29:54,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {11800#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11800#false} is VALID [2022-04-28 12:29:54,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {11800#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11800#false} is VALID [2022-04-28 12:29:54,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {11800#false} assume !(#t~post7 < 5);havoc #t~post7; {11800#false} is VALID [2022-04-28 12:29:54,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {11800#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11800#false} is VALID [2022-04-28 12:29:54,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {11800#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {11800#false} is VALID [2022-04-28 12:29:54,399 INFO L290 TraceCheckUtils]: 31: Hoare triple {11899#(<= |main_#t~post8| 4)} assume !(#t~post8 < 5);havoc #t~post8; {11800#false} is VALID [2022-04-28 12:29:54,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {11889#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11899#(<= |main_#t~post8| 4)} is VALID [2022-04-28 12:29:54,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {11889#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:54,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {11889#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:54,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {11879#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11889#(<= ~counter~0 4)} is VALID [2022-04-28 12:29:54,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {11879#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11879#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:54,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {11879#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {11879#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:54,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {11866#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11879#(<= ~counter~0 3)} is VALID [2022-04-28 12:29:54,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {11866#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11866#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:54,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {11866#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {11866#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:54,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {11866#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {11866#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:54,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {11856#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11866#(<= ~counter~0 2)} is VALID [2022-04-28 12:29:54,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {11856#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {11856#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:54,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {11856#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {11856#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:54,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {11807#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11856#(<= ~counter~0 1)} is VALID [2022-04-28 12:29:54,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {11807#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,404 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11799#true} {11807#(<= ~counter~0 0)} #96#return; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {11799#true} assume true; {11799#true} is VALID [2022-04-28 12:29:54,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {11799#true} assume !(0 == ~cond); {11799#true} is VALID [2022-04-28 12:29:54,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {11799#true} ~cond := #in~cond; {11799#true} is VALID [2022-04-28 12:29:54,405 INFO L272 TraceCheckUtils]: 11: Hoare triple {11807#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11799#true} is VALID [2022-04-28 12:29:54,405 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11799#true} {11807#(<= ~counter~0 0)} #94#return; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {11799#true} assume true; {11799#true} is VALID [2022-04-28 12:29:54,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {11799#true} assume !(0 == ~cond); {11799#true} is VALID [2022-04-28 12:29:54,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {11799#true} ~cond := #in~cond; {11799#true} is VALID [2022-04-28 12:29:54,405 INFO L272 TraceCheckUtils]: 6: Hoare triple {11807#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11799#true} is VALID [2022-04-28 12:29:54,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {11807#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {11807#(<= ~counter~0 0)} call #t~ret9 := main(); {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11807#(<= ~counter~0 0)} {11799#true} #108#return; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {11807#(<= ~counter~0 0)} assume true; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {11799#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 12:29:54,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {11799#true} call ULTIMATE.init(); {11799#true} is VALID [2022-04-28 12:29:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:29:54,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:29:54,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051223198] [2022-04-28 12:29:54,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:29:54,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076111865] [2022-04-28 12:29:54,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076111865] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:29:54,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:29:54,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 12:29:54,408 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:29:54,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [992725975] [2022-04-28 12:29:54,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [992725975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:29:54,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:29:54,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:29:54,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419059041] [2022-04-28 12:29:54,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:29:54,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-04-28 12:29:54,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:29:54,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:54,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:54,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:29:54,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:54,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:29:54,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:29:54,436 INFO L87 Difference]: Start difference. First operand 228 states and 318 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:55,337 INFO L93 Difference]: Finished difference Result 429 states and 607 transitions. [2022-04-28 12:29:55,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 12:29:55,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-04-28 12:29:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:29:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2022-04-28 12:29:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2022-04-28 12:29:55,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 132 transitions. [2022-04-28 12:29:55,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:55,466 INFO L225 Difference]: With dead ends: 429 [2022-04-28 12:29:55,466 INFO L226 Difference]: Without dead ends: 264 [2022-04-28 12:29:55,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:29:55,467 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 54 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:29:55,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 195 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:29:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-28 12:29:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 258. [2022-04-28 12:29:56,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:29:56,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 12:29:56,087 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 12:29:56,088 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 12:29:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:56,098 INFO L93 Difference]: Finished difference Result 264 states and 356 transitions. [2022-04-28 12:29:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2022-04-28 12:29:56,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:56,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:56,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 264 states. [2022-04-28 12:29:56,100 INFO L87 Difference]: Start difference. First operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) Second operand 264 states. [2022-04-28 12:29:56,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:29:56,110 INFO L93 Difference]: Finished difference Result 264 states and 356 transitions. [2022-04-28 12:29:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2022-04-28 12:29:56,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:29:56,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:29:56,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:29:56,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:29:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 189 states have internal predecessors, (239), 57 states have call successors, (57), 18 states have call predecessors, (57), 17 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2022-04-28 12:29:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 351 transitions. [2022-04-28 12:29:56,122 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 351 transitions. Word has length 42 [2022-04-28 12:29:56,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:29:56,122 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 351 transitions. [2022-04-28 12:29:56,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 12:29:56,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 351 transitions. [2022-04-28 12:29:56,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 351 edges. 351 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:29:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 351 transitions. [2022-04-28 12:29:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 12:29:56,578 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:29:56,578 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-04-28 12:29:56,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 12:29:56,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 12:29:56,779 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:29:56,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:29:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash 744709461, now seen corresponding path program 1 times [2022-04-28 12:29:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:29:56,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [460090488] [2022-04-28 12:29:56,780 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:29:56,780 INFO L85 PathProgramCache]: Analyzing trace with hash 744709461, now seen corresponding path program 2 times [2022-04-28 12:29:56,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:29:56,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972195523] [2022-04-28 12:29:56,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:29:56,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:29:56,790 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:29:56,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1774191720] [2022-04-28 12:29:56,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:29:56,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:29:56,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:29:56,791 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:29:56,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 12:29:56,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:29:56,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:29:56,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:29:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:29:56,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:01,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {13964#true} call ULTIMATE.init(); {13964#true} is VALID [2022-04-28 12:30:01,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {13964#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13964#true} is VALID [2022-04-28 12:30:01,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {13964#true} assume true; {13964#true} is VALID [2022-04-28 12:30:01,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13964#true} {13964#true} #108#return; {13964#true} is VALID [2022-04-28 12:30:01,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {13964#true} call #t~ret9 := main(); {13964#true} is VALID [2022-04-28 12:30:01,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {13964#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13964#true} is VALID [2022-04-28 12:30:01,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {13964#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13964#true} is VALID [2022-04-28 12:30:01,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {13964#true} ~cond := #in~cond; {13964#true} is VALID [2022-04-28 12:30:01,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {13964#true} assume !(0 == ~cond); {13964#true} is VALID [2022-04-28 12:30:01,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {13964#true} assume true; {13964#true} is VALID [2022-04-28 12:30:01,005 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13964#true} {13964#true} #94#return; {13964#true} is VALID [2022-04-28 12:30:01,005 INFO L272 TraceCheckUtils]: 11: Hoare triple {13964#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13964#true} is VALID [2022-04-28 12:30:01,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {13964#true} ~cond := #in~cond; {13964#true} is VALID [2022-04-28 12:30:01,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {13964#true} assume !(0 == ~cond); {13964#true} is VALID [2022-04-28 12:30:01,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {13964#true} assume true; {13964#true} is VALID [2022-04-28 12:30:01,005 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13964#true} {13964#true} #96#return; {13964#true} is VALID [2022-04-28 12:30:01,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {13964#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {13964#true} is VALID [2022-04-28 12:30:01,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {13964#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13964#true} is VALID [2022-04-28 12:30:01,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {13964#true} assume !!(#t~post6 < 5);havoc #t~post6; {13964#true} is VALID [2022-04-28 12:30:01,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {13964#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {13964#true} is VALID [2022-04-28 12:30:01,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {13964#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13964#true} is VALID [2022-04-28 12:30:01,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {13964#true} assume !!(#t~post7 < 5);havoc #t~post7; {13964#true} is VALID [2022-04-28 12:30:01,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {13964#true} assume !(~c~0 >= ~b~0); {13964#true} is VALID [2022-04-28 12:30:01,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {13964#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13964#true} is VALID [2022-04-28 12:30:01,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {13964#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13964#true} is VALID [2022-04-28 12:30:01,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {13964#true} assume !!(#t~post6 < 5);havoc #t~post6; {13964#true} is VALID [2022-04-28 12:30:01,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {13964#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:30:01,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:30:01,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:30:01,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:30:01,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:30:01,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post8 < 5);havoc #t~post8; {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:30:01,008 INFO L272 TraceCheckUtils]: 32: Hoare triple {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {13964#true} is VALID [2022-04-28 12:30:01,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {13964#true} ~cond := #in~cond; {13964#true} is VALID [2022-04-28 12:30:01,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {13964#true} assume !(0 == ~cond); {13964#true} is VALID [2022-04-28 12:30:01,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {13964#true} assume true; {13964#true} is VALID [2022-04-28 12:30:01,009 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13964#true} {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #98#return; {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:30:01,009 INFO L272 TraceCheckUtils]: 37: Hoare triple {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {13964#true} is VALID [2022-04-28 12:30:01,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {13964#true} ~cond := #in~cond; {13964#true} is VALID [2022-04-28 12:30:01,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {13964#true} assume !(0 == ~cond); {13964#true} is VALID [2022-04-28 12:30:01,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {13964#true} assume true; {13964#true} is VALID [2022-04-28 12:30:01,010 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13964#true} {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #100#return; {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 12:30:01,011 INFO L272 TraceCheckUtils]: 42: Hoare triple {14047#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14096#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:01,011 INFO L290 TraceCheckUtils]: 43: Hoare triple {14096#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:01,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {14100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13965#false} is VALID [2022-04-28 12:30:01,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {13965#false} assume !false; {13965#false} is VALID [2022-04-28 12:30:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 12:30:01,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:30:01,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:30:01,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972195523] [2022-04-28 12:30:01,012 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:30:01,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774191720] [2022-04-28 12:30:01,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774191720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:01,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:01,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:30:01,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:30:01,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [460090488] [2022-04-28 12:30:01,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [460090488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:01,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:01,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:30:01,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218427470] [2022-04-28 12:30:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:30:01,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-28 12:30:01,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:30:01,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:30:01,042 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 12:30:01,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:30:01,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:01,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:30:01,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:30:01,043 INFO L87 Difference]: Start difference. First operand 258 states and 351 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:30:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:02,009 INFO L93 Difference]: Finished difference Result 332 states and 473 transitions. [2022-04-28 12:30:02,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:30:02,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-28 12:30:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:30:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:30:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 12:30:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:30:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 12:30:02,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 12:30:02,066 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 12:30:02,076 INFO L225 Difference]: With dead ends: 332 [2022-04-28 12:30:02,076 INFO L226 Difference]: Without dead ends: 330 [2022-04-28 12:30:02,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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 12:30:02,077 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:30:02,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:30:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-04-28 12:30:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 321. [2022-04-28 12:30:02,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:30:02,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:30:02,857 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:30:02,857 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:30:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:02,869 INFO L93 Difference]: Finished difference Result 330 states and 471 transitions. [2022-04-28 12:30:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 471 transitions. [2022-04-28 12:30:02,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:02,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:02,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) Second operand 330 states. [2022-04-28 12:30:02,872 INFO L87 Difference]: Start difference. First operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) Second operand 330 states. [2022-04-28 12:30:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:02,883 INFO L93 Difference]: Finished difference Result 330 states and 471 transitions. [2022-04-28 12:30:02,883 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 471 transitions. [2022-04-28 12:30:02,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:02,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:02,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:30:02,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:30:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 213 states have (on average 1.3427230046948357) internal successors, (286), 223 states have internal predecessors, (286), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:30:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 462 transitions. [2022-04-28 12:30:02,899 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 462 transitions. Word has length 46 [2022-04-28 12:30:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:30:02,900 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 462 transitions. [2022-04-28 12:30:02,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 12:30:02,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 321 states and 462 transitions. [2022-04-28 12:30:03,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:03,488 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 462 transitions. [2022-04-28 12:30:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 12:30:03,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:03,490 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:30:03,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 12:30:03,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:03,699 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -522797827, now seen corresponding path program 1 times [2022-04-28 12:30:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:03,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1298159952] [2022-04-28 12:30:03,700 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -522797827, now seen corresponding path program 2 times [2022-04-28 12:30:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:03,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989829676] [2022-04-28 12:30:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:03,712 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:30:03,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [308767988] [2022-04-28 12:30:03,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:30:03,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:03,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:03,713 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:30:03,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 12:30:03,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:30:03,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:30:03,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:30:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:03,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:04,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {16074#true} call ULTIMATE.init(); {16074#true} is VALID [2022-04-28 12:30:04,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {16074#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {16082#(<= ~counter~0 0)} assume true; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16082#(<= ~counter~0 0)} {16074#true} #108#return; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {16082#(<= ~counter~0 0)} call #t~ret9 := main(); {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {16082#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,043 INFO L272 TraceCheckUtils]: 6: Hoare triple {16082#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {16082#(<= ~counter~0 0)} ~cond := #in~cond; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {16082#(<= ~counter~0 0)} assume !(0 == ~cond); {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {16082#(<= ~counter~0 0)} assume true; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16082#(<= ~counter~0 0)} {16082#(<= ~counter~0 0)} #94#return; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,044 INFO L272 TraceCheckUtils]: 11: Hoare triple {16082#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {16082#(<= ~counter~0 0)} ~cond := #in~cond; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {16082#(<= ~counter~0 0)} assume !(0 == ~cond); {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {16082#(<= ~counter~0 0)} assume true; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,046 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16082#(<= ~counter~0 0)} {16082#(<= ~counter~0 0)} #96#return; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {16082#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {16082#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16131#(<= ~counter~0 1)} is VALID [2022-04-28 12:30:04,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {16131#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {16131#(<= ~counter~0 1)} is VALID [2022-04-28 12:30:04,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {16131#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {16131#(<= ~counter~0 1)} is VALID [2022-04-28 12:30:04,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {16131#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16141#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:04,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {16141#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {16141#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:04,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {16141#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16141#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:04,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {16141#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {16151#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,050 INFO L272 TraceCheckUtils]: 25: Hoare triple {16151#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {16151#(<= ~counter~0 3)} ~cond := #in~cond; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {16151#(<= ~counter~0 3)} assume !(0 == ~cond); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {16151#(<= ~counter~0 3)} assume true; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,065 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16151#(<= ~counter~0 3)} {16151#(<= ~counter~0 3)} #98#return; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,066 INFO L272 TraceCheckUtils]: 30: Hoare triple {16151#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {16151#(<= ~counter~0 3)} ~cond := #in~cond; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {16151#(<= ~counter~0 3)} assume !(0 == ~cond); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {16151#(<= ~counter~0 3)} assume true; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,069 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16151#(<= ~counter~0 3)} {16151#(<= ~counter~0 3)} #100#return; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,070 INFO L272 TraceCheckUtils]: 35: Hoare triple {16151#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,070 INFO L290 TraceCheckUtils]: 36: Hoare triple {16151#(<= ~counter~0 3)} ~cond := #in~cond; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {16151#(<= ~counter~0 3)} assume !(0 == ~cond); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {16151#(<= ~counter~0 3)} assume true; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,072 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16151#(<= ~counter~0 3)} {16151#(<= ~counter~0 3)} #102#return; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,073 INFO L272 TraceCheckUtils]: 40: Hoare triple {16151#(<= ~counter~0 3)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {16151#(<= ~counter~0 3)} ~cond := #in~cond; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {16151#(<= ~counter~0 3)} assume !(0 == ~cond); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {16151#(<= ~counter~0 3)} assume true; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,076 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16151#(<= ~counter~0 3)} {16151#(<= ~counter~0 3)} #104#return; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {16151#(<= ~counter~0 3)} assume !(~c~0 >= 2 * ~v~0); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,077 INFO L290 TraceCheckUtils]: 46: Hoare triple {16151#(<= ~counter~0 3)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,078 INFO L290 TraceCheckUtils]: 47: Hoare triple {16151#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16224#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,078 INFO L290 TraceCheckUtils]: 48: Hoare triple {16224#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {16224#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,079 INFO L290 TraceCheckUtils]: 49: Hoare triple {16224#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {16224#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,079 INFO L290 TraceCheckUtils]: 50: Hoare triple {16224#(<= ~counter~0 4)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16224#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,080 INFO L290 TraceCheckUtils]: 51: Hoare triple {16224#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16237#(<= |main_#t~post6| 4)} is VALID [2022-04-28 12:30:04,080 INFO L290 TraceCheckUtils]: 52: Hoare triple {16237#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {16075#false} is VALID [2022-04-28 12:30:04,080 INFO L272 TraceCheckUtils]: 53: Hoare triple {16075#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {16075#false} is VALID [2022-04-28 12:30:04,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {16075#false} ~cond := #in~cond; {16075#false} is VALID [2022-04-28 12:30:04,081 INFO L290 TraceCheckUtils]: 55: Hoare triple {16075#false} assume 0 == ~cond; {16075#false} is VALID [2022-04-28 12:30:04,081 INFO L290 TraceCheckUtils]: 56: Hoare triple {16075#false} assume !false; {16075#false} is VALID [2022-04-28 12:30:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:30:04,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:30:04,331 INFO L290 TraceCheckUtils]: 56: Hoare triple {16075#false} assume !false; {16075#false} is VALID [2022-04-28 12:30:04,331 INFO L290 TraceCheckUtils]: 55: Hoare triple {16075#false} assume 0 == ~cond; {16075#false} is VALID [2022-04-28 12:30:04,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {16075#false} ~cond := #in~cond; {16075#false} is VALID [2022-04-28 12:30:04,332 INFO L272 TraceCheckUtils]: 53: Hoare triple {16075#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {16075#false} is VALID [2022-04-28 12:30:04,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {16237#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {16075#false} is VALID [2022-04-28 12:30:04,332 INFO L290 TraceCheckUtils]: 51: Hoare triple {16224#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16237#(<= |main_#t~post6| 4)} is VALID [2022-04-28 12:30:04,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {16224#(<= ~counter~0 4)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16224#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {16224#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {16224#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {16224#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {16224#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {16151#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16224#(<= ~counter~0 4)} is VALID [2022-04-28 12:30:04,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {16151#(<= ~counter~0 3)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {16151#(<= ~counter~0 3)} assume !(~c~0 >= 2 * ~v~0); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,335 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16074#true} {16151#(<= ~counter~0 3)} #104#return; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {16074#true} assume true; {16074#true} is VALID [2022-04-28 12:30:04,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {16074#true} assume !(0 == ~cond); {16074#true} is VALID [2022-04-28 12:30:04,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {16074#true} ~cond := #in~cond; {16074#true} is VALID [2022-04-28 12:30:04,335 INFO L272 TraceCheckUtils]: 40: Hoare triple {16151#(<= ~counter~0 3)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {16074#true} is VALID [2022-04-28 12:30:04,336 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16074#true} {16151#(<= ~counter~0 3)} #102#return; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {16074#true} assume true; {16074#true} is VALID [2022-04-28 12:30:04,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {16074#true} assume !(0 == ~cond); {16074#true} is VALID [2022-04-28 12:30:04,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {16074#true} ~cond := #in~cond; {16074#true} is VALID [2022-04-28 12:30:04,336 INFO L272 TraceCheckUtils]: 35: Hoare triple {16151#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16074#true} is VALID [2022-04-28 12:30:04,337 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16074#true} {16151#(<= ~counter~0 3)} #100#return; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {16074#true} assume true; {16074#true} is VALID [2022-04-28 12:30:04,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {16074#true} assume !(0 == ~cond); {16074#true} is VALID [2022-04-28 12:30:04,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {16074#true} ~cond := #in~cond; {16074#true} is VALID [2022-04-28 12:30:04,337 INFO L272 TraceCheckUtils]: 30: Hoare triple {16151#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16074#true} is VALID [2022-04-28 12:30:04,337 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16074#true} {16151#(<= ~counter~0 3)} #98#return; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {16074#true} assume true; {16074#true} is VALID [2022-04-28 12:30:04,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {16074#true} assume !(0 == ~cond); {16074#true} is VALID [2022-04-28 12:30:04,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {16074#true} ~cond := #in~cond; {16074#true} is VALID [2022-04-28 12:30:04,338 INFO L272 TraceCheckUtils]: 25: Hoare triple {16151#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16074#true} is VALID [2022-04-28 12:30:04,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {16151#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {16141#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 12:30:04,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {16141#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16141#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:04,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {16141#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {16141#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:04,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {16131#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16141#(<= ~counter~0 2)} is VALID [2022-04-28 12:30:04,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {16131#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {16131#(<= ~counter~0 1)} is VALID [2022-04-28 12:30:04,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {16131#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {16131#(<= ~counter~0 1)} is VALID [2022-04-28 12:30:04,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {16082#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16131#(<= ~counter~0 1)} is VALID [2022-04-28 12:30:04,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {16082#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,349 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16074#true} {16082#(<= ~counter~0 0)} #96#return; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {16074#true} assume true; {16074#true} is VALID [2022-04-28 12:30:04,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {16074#true} assume !(0 == ~cond); {16074#true} is VALID [2022-04-28 12:30:04,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {16074#true} ~cond := #in~cond; {16074#true} is VALID [2022-04-28 12:30:04,349 INFO L272 TraceCheckUtils]: 11: Hoare triple {16082#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16074#true} is VALID [2022-04-28 12:30:04,350 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16074#true} {16082#(<= ~counter~0 0)} #94#return; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {16074#true} assume true; {16074#true} is VALID [2022-04-28 12:30:04,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {16074#true} assume !(0 == ~cond); {16074#true} is VALID [2022-04-28 12:30:04,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {16074#true} ~cond := #in~cond; {16074#true} is VALID [2022-04-28 12:30:04,350 INFO L272 TraceCheckUtils]: 6: Hoare triple {16082#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16074#true} is VALID [2022-04-28 12:30:04,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {16082#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {16082#(<= ~counter~0 0)} call #t~ret9 := main(); {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16082#(<= ~counter~0 0)} {16074#true} #108#return; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {16082#(<= ~counter~0 0)} assume true; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {16074#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 12:30:04,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {16074#true} call ULTIMATE.init(); {16074#true} is VALID [2022-04-28 12:30:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 12:30:04,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:30:04,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989829676] [2022-04-28 12:30:04,353 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:30:04,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308767988] [2022-04-28 12:30:04,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308767988] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:30:04,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:30:04,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 12:30:04,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:30:04,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1298159952] [2022-04-28 12:30:04,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1298159952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:04,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:04,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:30:04,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199185405] [2022-04-28 12:30:04,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:30:04,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2022-04-28 12:30:04,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:30:04,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:04,396 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 12:30:04,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:30:04,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:04,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:30:04,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:30:04,396 INFO L87 Difference]: Start difference. First operand 321 states and 462 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:05,407 INFO L93 Difference]: Finished difference Result 335 states and 475 transitions. [2022-04-28 12:30:05,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 12:30:05,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2022-04-28 12:30:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:30:05,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-28 12:30:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-28 12:30:05,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2022-04-28 12:30:05,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:05,505 INFO L225 Difference]: With dead ends: 335 [2022-04-28 12:30:05,505 INFO L226 Difference]: Without dead ends: 328 [2022-04-28 12:30:05,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:30:05,506 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 40 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:30:05,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 226 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:30:05,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-04-28 12:30:06,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2022-04-28 12:30:06,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:30:06,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 328 states. Second operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:30:06,246 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:30:06,247 INFO L87 Difference]: Start difference. First operand 328 states. Second operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:30:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:06,256 INFO L93 Difference]: Finished difference Result 328 states and 468 transitions. [2022-04-28 12:30:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 468 transitions. [2022-04-28 12:30:06,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:06,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:06,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) Second operand 328 states. [2022-04-28 12:30:06,258 INFO L87 Difference]: Start difference. First operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) Second operand 328 states. [2022-04-28 12:30:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:06,267 INFO L93 Difference]: Finished difference Result 328 states and 468 transitions. [2022-04-28 12:30:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 468 transitions. [2022-04-28 12:30:06,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:06,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:06,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:30:06,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:30:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 216 states have (on average 1.337962962962963) internal successors, (289), 226 states have internal predecessors, (289), 89 states have call successors, (89), 19 states have call predecessors, (89), 18 states have return successors, (87), 78 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-28 12:30:06,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 465 transitions. [2022-04-28 12:30:06,280 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 465 transitions. Word has length 57 [2022-04-28 12:30:06,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:30:06,280 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 465 transitions. [2022-04-28 12:30:06,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:06,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 324 states and 465 transitions. [2022-04-28 12:30:06,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 465 transitions. [2022-04-28 12:30:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 12:30:06,900 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:06,900 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:30:06,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 12:30:07,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 12:30:07,101 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:07,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:07,101 INFO L85 PathProgramCache]: Analyzing trace with hash 958119025, now seen corresponding path program 1 times [2022-04-28 12:30:07,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:07,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [510679343] [2022-04-28 12:30:07,102 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:07,102 INFO L85 PathProgramCache]: Analyzing trace with hash 958119025, now seen corresponding path program 2 times [2022-04-28 12:30:07,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:07,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398441563] [2022-04-28 12:30:07,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:07,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:07,126 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:30:07,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1026101292] [2022-04-28 12:30:07,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:30:07,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:07,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:07,135 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:30:07,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 12:30:07,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:30:07,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:30:07,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 12:30:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:30:07,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:30:08,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {18401#true} call ULTIMATE.init(); {18401#true} is VALID [2022-04-28 12:30:08,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {18401#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18401#true} is VALID [2022-04-28 12:30:08,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 12:30:08,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18401#true} {18401#true} #108#return; {18401#true} is VALID [2022-04-28 12:30:08,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {18401#true} call #t~ret9 := main(); {18401#true} is VALID [2022-04-28 12:30:08,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {18401#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18401#true} is VALID [2022-04-28 12:30:08,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {18401#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18401#true} is VALID [2022-04-28 12:30:08,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 12:30:08,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 12:30:08,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 12:30:08,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18401#true} {18401#true} #94#return; {18401#true} is VALID [2022-04-28 12:30:08,044 INFO L272 TraceCheckUtils]: 11: Hoare triple {18401#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18401#true} is VALID [2022-04-28 12:30:08,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 12:30:08,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 12:30:08,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 12:30:08,044 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18401#true} {18401#true} #96#return; {18401#true} is VALID [2022-04-28 12:30:08,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {18401#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {18454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {18454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {18454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {18454#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18464#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {18464#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18464#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {18464#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {18464#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {18464#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18474#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {18474#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18474#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {18474#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 5);havoc #t~post8; {18474#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,048 INFO L272 TraceCheckUtils]: 25: Hoare triple {18474#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18401#true} is VALID [2022-04-28 12:30:08,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {18401#true} ~cond := #in~cond; {18487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:08,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {18487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:08,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {18491#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:08,050 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18491#(not (= |__VERIFIER_assert_#in~cond| 0))} {18474#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #98#return; {18498#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,050 INFO L272 TraceCheckUtils]: 30: Hoare triple {18498#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18401#true} is VALID [2022-04-28 12:30:08,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 12:30:08,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 12:30:08,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 12:30:08,051 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18401#true} {18498#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #100#return; {18498#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,051 INFO L272 TraceCheckUtils]: 35: Hoare triple {18498#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18401#true} is VALID [2022-04-28 12:30:08,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 12:30:08,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 12:30:08,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 12:30:08,052 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18401#true} {18498#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {18498#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,052 INFO L272 TraceCheckUtils]: 40: Hoare triple {18498#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18401#true} is VALID [2022-04-28 12:30:08,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 12:30:08,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 12:30:08,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 12:30:08,053 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18401#true} {18498#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {18498#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {18498#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {18498#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {18498#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18550#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {18550#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18550#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {18550#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {18550#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {18550#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {18550#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 12:30:08,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {18550#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18563#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:30:08,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {18563#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18563#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:30:08,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {18563#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} assume !!(#t~post6 < 5);havoc #t~post6; {18563#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:30:08,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {18563#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {18573#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 12:30:08,059 INFO L272 TraceCheckUtils]: 54: Hoare triple {18573#(and (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18577#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:08,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {18577#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18581#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:08,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {18581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18402#false} is VALID [2022-04-28 12:30:08,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {18402#false} assume !false; {18402#false} is VALID [2022-04-28 12:30:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 12:30:08,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:30:19,116 INFO L290 TraceCheckUtils]: 57: Hoare triple {18402#false} assume !false; {18402#false} is VALID [2022-04-28 12:30:19,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {18581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18402#false} is VALID [2022-04-28 12:30:19,118 INFO L290 TraceCheckUtils]: 55: Hoare triple {18577#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18581#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:30:19,119 INFO L272 TraceCheckUtils]: 54: Hoare triple {18597#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {18577#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:30:19,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {18601#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {18597#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 12:30:19,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {18601#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !!(#t~post6 < 5);havoc #t~post6; {18601#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:30:19,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {18601#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18601#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:30:19,364 INFO L290 TraceCheckUtils]: 50: Hoare triple {18611#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {18601#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-28 12:30:19,365 INFO L290 TraceCheckUtils]: 49: Hoare triple {18611#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {18611#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:19,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {18611#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post7 < 5);havoc #t~post7; {18611#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:19,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {18611#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18611#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:19,445 INFO L290 TraceCheckUtils]: 46: Hoare triple {18624#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {18611#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:19,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {18624#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {18624#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:19,447 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18401#true} {18624#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {18624#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:19,447 INFO L290 TraceCheckUtils]: 43: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 12:30:19,447 INFO L290 TraceCheckUtils]: 42: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 12:30:19,447 INFO L290 TraceCheckUtils]: 41: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 12:30:19,447 INFO L272 TraceCheckUtils]: 40: Hoare triple {18624#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {18401#true} is VALID [2022-04-28 12:30:19,448 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18401#true} {18624#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {18624#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:19,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 12:30:19,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 12:30:19,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 12:30:19,448 INFO L272 TraceCheckUtils]: 35: Hoare triple {18624#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18401#true} is VALID [2022-04-28 12:30:19,449 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18401#true} {18624#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #100#return; {18624#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:19,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 12:30:19,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 12:30:19,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 12:30:19,449 INFO L272 TraceCheckUtils]: 30: Hoare triple {18624#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18401#true} is VALID [2022-04-28 12:30:19,451 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18491#(not (= |__VERIFIER_assert_#in~cond| 0))} {18676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #98#return; {18624#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:19,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {18491#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:19,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {18686#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:30:19,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {18401#true} ~cond := #in~cond; {18686#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:30:19,452 INFO L272 TraceCheckUtils]: 25: Hoare triple {18676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18401#true} is VALID [2022-04-28 12:30:19,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {18676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post8 < 5);havoc #t~post8; {18676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:19,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {18676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:19,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {18699#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {18676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-28 12:30:19,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {18699#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post7 < 5);havoc #t~post7; {18699#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:30:19,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {18699#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18699#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:30:19,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {18709#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {18699#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:30:19,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {18709#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post6 < 5);havoc #t~post6; {18709#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:30:19,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {18709#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18709#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:30:19,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {18401#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {18709#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 12:30:19,457 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18401#true} {18401#true} #96#return; {18401#true} is VALID [2022-04-28 12:30:19,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 12:30:19,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 12:30:19,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 12:30:19,457 INFO L272 TraceCheckUtils]: 11: Hoare triple {18401#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18401#true} is VALID [2022-04-28 12:30:19,457 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18401#true} {18401#true} #94#return; {18401#true} is VALID [2022-04-28 12:30:19,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 12:30:19,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 12:30:19,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 12:30:19,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {18401#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18401#true} is VALID [2022-04-28 12:30:19,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {18401#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18401#true} is VALID [2022-04-28 12:30:19,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {18401#true} call #t~ret9 := main(); {18401#true} is VALID [2022-04-28 12:30:19,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18401#true} {18401#true} #108#return; {18401#true} is VALID [2022-04-28 12:30:19,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 12:30:19,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {18401#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18401#true} is VALID [2022-04-28 12:30:19,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {18401#true} call ULTIMATE.init(); {18401#true} is VALID [2022-04-28 12:30:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 12:30:19,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:30:19,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398441563] [2022-04-28 12:30:19,459 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:30:19,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026101292] [2022-04-28 12:30:19,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026101292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:30:19,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:30:19,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-28 12:30:19,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:30:19,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [510679343] [2022-04-28 12:30:19,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [510679343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:30:19,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:30:19,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 12:30:19,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917508157] [2022-04-28 12:30:19,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:30:19,461 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-04-28 12:30:19,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:30:19,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:19,502 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 12:30:19,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 12:30:19,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:19,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 12:30:19,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-28 12:30:19,503 INFO L87 Difference]: Start difference. First operand 324 states and 465 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:22,163 INFO L93 Difference]: Finished difference Result 384 states and 559 transitions. [2022-04-28 12:30:22,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 12:30:22,164 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2022-04-28 12:30:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:30:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2022-04-28 12:30:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2022-04-28 12:30:22,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 149 transitions. [2022-04-28 12:30:22,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:22,347 INFO L225 Difference]: With dead ends: 384 [2022-04-28 12:30:22,347 INFO L226 Difference]: Without dead ends: 381 [2022-04-28 12:30:22,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-04-28 12:30:22,348 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 65 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 12:30:22,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 442 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 12:30:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-04-28 12:30:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2022-04-28 12:30:23,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:30:23,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 381 states. Second operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-28 12:30:23,142 INFO L74 IsIncluded]: Start isIncluded. First operand 381 states. Second operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-28 12:30:23,143 INFO L87 Difference]: Start difference. First operand 381 states. Second operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-28 12:30:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:23,164 INFO L93 Difference]: Finished difference Result 381 states and 555 transitions. [2022-04-28 12:30:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 555 transitions. [2022-04-28 12:30:23,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:23,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:23,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) Second operand 381 states. [2022-04-28 12:30:23,166 INFO L87 Difference]: Start difference. First operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) Second operand 381 states. [2022-04-28 12:30:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:30:23,178 INFO L93 Difference]: Finished difference Result 381 states and 555 transitions. [2022-04-28 12:30:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 555 transitions. [2022-04-28 12:30:23,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:30:23,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:30:23,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:30:23,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:30:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 243 states have (on average 1.345679012345679) internal successors, (327), 256 states have internal predecessors, (327), 113 states have call successors, (113), 21 states have call predecessors, (113), 20 states have return successors, (111), 99 states have call predecessors, (111), 111 states have call successors, (111) [2022-04-28 12:30:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 551 transitions. [2022-04-28 12:30:23,194 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 551 transitions. Word has length 58 [2022-04-28 12:30:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:30:23,194 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 551 transitions. [2022-04-28 12:30:23,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 12:30:23,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 551 transitions. [2022-04-28 12:30:23,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 551 edges. 551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:30:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 551 transitions. [2022-04-28 12:30:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 12:30:23,877 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:30:23,877 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-04-28 12:30:23,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 12:30:24,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 12:30:24,078 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:30:24,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:30:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash 27973409, now seen corresponding path program 1 times [2022-04-28 12:30:24,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:30:24,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [169442604] [2022-04-28 12:30:24,079 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:30:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash 27973409, now seen corresponding path program 2 times [2022-04-28 12:30:24,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:30:24,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541769250] [2022-04-28 12:30:24,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:30:24,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:30:24,091 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:30:24,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [541217799] [2022-04-28 12:30:24,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:30:24,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:30:24,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:30:24,092 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:30:24,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 12:30:24,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:30:24,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 12:30:24,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 12:30:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 12:30:24,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 12:30:24,201 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 12:30:24,202 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 12:30:24,204 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 12:30:24,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 12:30:24,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 12:30:24,427 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 12:30:24,429 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 12:30:24,441 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 12:30:24,441 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 12:30:24,442 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-28 12:30:24,443 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-28 12:30:24,444 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-28 12:30:24,444 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 12:30:24,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:30:24 BoogieIcfgContainer [2022-04-28 12:30:24,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 12:30:24,446 INFO L158 Benchmark]: Toolchain (without parser) took 52307.86ms. Allocated memory was 177.2MB in the beginning and 256.9MB in the end (delta: 79.7MB). Free memory was 126.1MB in the beginning and 111.8MB in the end (delta: 14.4MB). Peak memory consumption was 94.9MB. Max. memory is 8.0GB. [2022-04-28 12:30:24,446 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 177.2MB. Free memory was 142.2MB in the beginning and 142.1MB in the end (delta: 91.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 12:30:24,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.10ms. Allocated memory is still 177.2MB. Free memory was 126.0MB in the beginning and 151.8MB in the end (delta: -25.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 12:30:24,446 INFO L158 Benchmark]: Boogie Preprocessor took 26.71ms. Allocated memory is still 177.2MB. Free memory was 151.8MB in the beginning and 150.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 12:30:24,447 INFO L158 Benchmark]: RCFGBuilder took 269.82ms. Allocated memory is still 177.2MB. Free memory was 150.2MB in the beginning and 137.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 12:30:24,447 INFO L158 Benchmark]: TraceAbstraction took 51694.56ms. Allocated memory was 177.2MB in the beginning and 256.9MB in the end (delta: 79.7MB). Free memory was 136.6MB in the beginning and 111.8MB in the end (delta: 24.8MB). Peak memory consumption was 105.4MB. Max. memory is 8.0GB. [2022-04-28 12:30:24,448 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.17ms. Allocated memory is still 177.2MB. Free memory was 142.2MB in the beginning and 142.1MB in the end (delta: 91.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 308.10ms. Allocated memory is still 177.2MB. Free memory was 126.0MB in the beginning and 151.8MB in the end (delta: -25.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.71ms. Allocated memory is still 177.2MB. Free memory was 151.8MB in the beginning and 150.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 269.82ms. Allocated memory is still 177.2MB. Free memory was 150.2MB in the beginning and 137.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 51694.56ms. Allocated memory was 177.2MB in the beginning and 256.9MB in the end (delta: 79.7MB). Free memory was 136.6MB in the beginning and 111.8MB in the end (delta: 24.8MB). Peak memory consumption was 105.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; [L20] int x, y; [L21] long long a, b, p, q, r, s; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) [L8] COND FALSE !(!cond) [L24] RET assume_abort_if_not(x >= 1) [L25] CALL assume_abort_if_not(y >= 1) [L8] COND FALSE !(!cond) [L25] RET assume_abort_if_not(y >= 1) [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L34] EXPR counter++ [L34] COND TRUE counter++<5 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 [L41] EXPR counter++ [L41] COND TRUE counter++<5 [L42] COND TRUE !(c >= b) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k [L34] EXPR counter++ [L34] COND TRUE counter++<5 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 [L41] EXPR counter++ [L41] COND TRUE counter++<5 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b [L48] EXPR counter++ [L48] COND TRUE counter++<5 [L49] CALL __VERIFIER_assert(a == y * r + x * p) [L11] COND FALSE !(!(cond)) [L49] RET __VERIFIER_assert(a == y * r + x * p) [L50] CALL __VERIFIER_assert(b == x * q + y * s) [L11] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(b == x * q + y * s) [L51] CALL __VERIFIER_assert(a == k * b + c) [L11] COND FALSE !(!(cond)) [L51] RET __VERIFIER_assert(a == k * b + c) [L52] CALL __VERIFIER_assert(v == b * d) [L11] COND FALSE !(!(cond)) [L52] RET __VERIFIER_assert(v == b * d) [L54] COND TRUE !(c >= 2 * v) [L59] c = c - v [L60] k = k + d [L41] EXPR counter++ [L41] COND FALSE !(counter++<5) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k [L34] EXPR counter++ [L34] COND FALSE !(counter++<5) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) [L11] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.6s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 702 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 641 mSDsluCounter, 3465 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2620 mSDsCounter, 263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1819 IncrementalHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 263 mSolverCounterUnsat, 845 mSDtfsCounter, 1819 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 966 GetRequests, 823 SyntacticMatches, 8 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=377occurred in iteration=17, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 185 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-28 12:30:24,465 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...