/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 05:50:45,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 05:50:45,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 05:50:45,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 05:50:45,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 05:50:45,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 05:50:45,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 05:50:45,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 05:50:45,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 05:50:45,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 05:50:45,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 05:50:45,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 05:50:45,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 05:50:45,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 05:50:45,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 05:50:45,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 05:50:45,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 05:50:45,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 05:50:45,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 05:50:45,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 05:50:45,824 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 05:50:45,825 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 05:50:45,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 05:50:45,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 05:50:45,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 05:50:45,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 05:50:45,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 05:50:45,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 05:50:45,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 05:50:45,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 05:50:45,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 05:50:45,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 05:50:45,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 05:50:45,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 05:50:45,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 05:50:45,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 05:50:45,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 05:50:45,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 05:50:45,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 05:50:45,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 05:50:45,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 05:50:45,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 05:50:45,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 05:50:45,847 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 05:50:45,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 05:50:45,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 05:50:45,848 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 05:50:45,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 05:50:45,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 05:50:45,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 05:50:45,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 05:50:45,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 05:50:45,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 05:50:45,849 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 05:50:45,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 05:50:45,849 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 05:50:45,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 05:50:45,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 05:50:45,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 05:50:45,850 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 05:50:45,850 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 05:50:45,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:50:45,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 05:50:45,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 05:50:45,850 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 05:50:45,850 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 05:50:45,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 05:50:45,851 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 05:50:45,851 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 05:50:46,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 05:50:46,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 05:50:46,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 05:50:46,041 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 05:50:46,049 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 05:50:46,049 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 05:50:46,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0220a23a3/f505ac000d8b4a08a6c8b779af4bce54/FLAG0326e142c [2022-04-28 05:50:46,425 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 05:50:46,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound5.c [2022-04-28 05:50:46,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0220a23a3/f505ac000d8b4a08a6c8b779af4bce54/FLAG0326e142c [2022-04-28 05:50:46,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0220a23a3/f505ac000d8b4a08a6c8b779af4bce54 [2022-04-28 05:50:46,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 05:50:46,442 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 05:50:46,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 05:50:46,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 05:50:46,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 05:50:46,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:50:46" (1/1) ... [2022-04-28 05:50:46,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6a80e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:50:46, skipping insertion in model container [2022-04-28 05:50:46,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:50:46" (1/1) ... [2022-04-28 05:50:46,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 05:50:46,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 05:50:46,571 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 05:50:46,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:50:46,591 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 05:50:46,598 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 05:50:46,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:50:46,613 INFO L208 MainTranslator]: Completed translation [2022-04-28 05:50:46,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:50:46 WrapperNode [2022-04-28 05:50:46,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 05:50:46,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 05:50:46,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 05:50:46,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 05:50:46,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:50:46" (1/1) ... [2022-04-28 05:50:46,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:50:46" (1/1) ... [2022-04-28 05:50:46,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:50:46" (1/1) ... [2022-04-28 05:50:46,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:50:46" (1/1) ... [2022-04-28 05:50:46,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:50:46" (1/1) ... [2022-04-28 05:50:46,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:50:46" (1/1) ... [2022-04-28 05:50:46,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:50:46" (1/1) ... [2022-04-28 05:50:46,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 05:50:46,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 05:50:46,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 05:50:46,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 05:50:46,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:50:46" (1/1) ... [2022-04-28 05:50:46,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:50:46,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:46,665 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 05:50:46,674 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 05:50:46,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 05:50:46,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 05:50:46,699 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 05:50:46,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 05:50:46,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 05:50:46,699 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 05:50:46,699 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 05:50:46,699 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 05:50:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 05:50:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 05:50:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 05:50:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 05:50:46,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 05:50:46,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 05:50:46,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 05:50:46,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 05:50:46,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 05:50:46,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 05:50:46,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 05:50:46,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 05:50:46,759 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 05:50:46,763 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 05:50:46,926 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 05:50:46,930 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 05:50:46,930 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 05:50:46,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:50:46 BoogieIcfgContainer [2022-04-28 05:50:46,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 05:50:46,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 05:50:46,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 05:50:46,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 05:50:46,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 05:50:46" (1/3) ... [2022-04-28 05:50:46,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681ef06c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:50:46, skipping insertion in model container [2022-04-28 05:50:46,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:50:46" (2/3) ... [2022-04-28 05:50:46,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681ef06c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:50:46, skipping insertion in model container [2022-04-28 05:50:46,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:50:46" (3/3) ... [2022-04-28 05:50:46,937 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound5.c [2022-04-28 05:50:46,945 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 05:50:46,945 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 05:50:46,973 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 05:50:46,977 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@3b6d2d82, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@acc2e3d [2022-04-28 05:50:46,977 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 05:50:46,982 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 05:50:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 05:50:46,986 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:46,987 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 05:50:46,987 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1766263304, now seen corresponding path program 1 times [2022-04-28 05:50:46,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:46,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [831319436] [2022-04-28 05:50:47,002 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1766263304, now seen corresponding path program 2 times [2022-04-28 05:50:47,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:47,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010147433] [2022-04-28 05:50:47,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:47,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 05:50:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:47,140 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 05:50:47,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 05:50:47,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-28 05:50:47,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 05:50:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:47,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:50:47,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:50:47,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:50:47,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 05:50:47,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 05:50:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:47,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:50:47,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:50:47,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:50:47,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 05:50:47,172 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 05:50:47,172 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 05:50:47,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 05:50:47,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-28 05:50:47,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret9 := main(); {43#true} is VALID [2022-04-28 05:50:47,173 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 05:50:47,173 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 05:50:47,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:50:47,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:50:47,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:50:47,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-28 05:50:47,175 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 05:50:47,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:50:47,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:50:47,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:50:47,176 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-28 05:50:47,177 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 05:50:47,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-28 05:50:47,177 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 05:50:47,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-28 05:50:47,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-28 05:50:47,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-28 05:50:47,178 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 05:50:47,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:47,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010147433] [2022-04-28 05:50:47,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010147433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:47,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:47,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:50:47,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:47,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [831319436] [2022-04-28 05:50:47,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [831319436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:47,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:47,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:50:47,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116328313] [2022-04-28 05:50:47,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:47,188 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 05:50:47,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:47,192 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 05:50:47,214 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 05:50:47,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 05:50:47,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:47,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 05:50:47,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:50:47,240 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 05:50:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:47,426 INFO L93 Difference]: Finished difference Result 74 states and 111 transitions. [2022-04-28 05:50:47,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 05:50:47,426 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 05:50:47,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:47,427 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 05:50:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-28 05:50:47,434 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 05:50:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-28 05:50:47,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-28 05:50:47,535 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 05:50:47,545 INFO L225 Difference]: With dead ends: 74 [2022-04-28 05:50:47,545 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 05:50:47,548 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 05:50:47,551 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:47,553 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.0s Time] [2022-04-28 05:50:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 05:50:47,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-28 05:50:47,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:47,584 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 05:50:47,586 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 05:50:47,594 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 05:50:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:47,600 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-28 05:50:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-28 05:50:47,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:47,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:47,603 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 05:50:47,604 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 05:50:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:47,614 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-28 05:50:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-28 05:50:47,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:47,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:47,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:47,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:47,616 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 05:50:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-28 05:50:47,619 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-04-28 05:50:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:47,620 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-28 05:50:47,620 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 05:50:47,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 45 transitions. [2022-04-28 05:50:47,667 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 05:50:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-28 05:50:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 05:50:47,671 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:47,671 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 05:50:47,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 05:50:47,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:47,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:47,672 INFO L85 PathProgramCache]: Analyzing trace with hash -81203399, now seen corresponding path program 1 times [2022-04-28 05:50:47,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:47,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [843814987] [2022-04-28 05:50:47,673 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash -81203399, now seen corresponding path program 2 times [2022-04-28 05:50:47,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:47,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793002476] [2022-04-28 05:50:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:47,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:47,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:47,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202175828] [2022-04-28 05:50:47,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:47,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:47,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:47,723 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 05:50:47,729 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 05:50:47,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:50:47,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:47,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:50:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:47,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:48,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2022-04-28 05:50:48,009 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 05:50:48,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:48,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#(<= ~counter~0 0)} {349#true} #108#return; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:48,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#(<= ~counter~0 0)} call #t~ret9 := main(); {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:48,029 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 05:50:48,029 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 05:50:48,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {357#(<= ~counter~0 0)} ~cond := #in~cond; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:48,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {357#(<= ~counter~0 0)} assume !(0 == ~cond); {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:48,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:48,031 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 05:50:48,032 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 05:50:48,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {357#(<= ~counter~0 0)} ~cond := #in~cond; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:48,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {357#(<= ~counter~0 0)} assume !(0 == ~cond); {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:48,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {357#(<= ~counter~0 0)} assume true; {357#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:48,033 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 05:50:48,034 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 05:50:48,034 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 05:50:48,035 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 05:50:48,035 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 05:50:48,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {350#false} ~cond := #in~cond; {350#false} is VALID [2022-04-28 05:50:48,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {350#false} assume 0 == ~cond; {350#false} is VALID [2022-04-28 05:50:48,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {350#false} assume !false; {350#false} is VALID [2022-04-28 05:50:48,035 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 05:50:48,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:50:48,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:48,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793002476] [2022-04-28 05:50:48,036 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:48,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202175828] [2022-04-28 05:50:48,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202175828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:48,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:48,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:50:48,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:48,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [843814987] [2022-04-28 05:50:48,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [843814987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:48,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:48,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:50:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706314729] [2022-04-28 05:50:48,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:48,038 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 05:50:48,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:48,039 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 05:50:48,052 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 05:50:48,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:50:48,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:48,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:50:48,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:50:48,054 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 05:50:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:48,137 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-28 05:50:48,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:50:48,138 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 05:50:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:48,139 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 05:50:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-28 05:50:48,141 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 05:50:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-28 05:50:48,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-28 05:50:48,182 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 05:50:48,184 INFO L225 Difference]: With dead ends: 44 [2022-04-28 05:50:48,184 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 05:50:48,185 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 05:50:48,186 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 05:50:48,189 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 05:50:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 05:50:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 05:50:48,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:48,208 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 05:50:48,209 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 05:50:48,209 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 05:50:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:48,215 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-28 05:50:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 05:50:48,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:48,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:48,219 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 05:50:48,219 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 05:50:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:48,228 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-28 05:50:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 05:50:48,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:48,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:48,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:48,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:48,229 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 05:50:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-28 05:50:48,231 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-04-28 05:50:48,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:48,231 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-28 05:50:48,231 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 05:50:48,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-28 05:50:48,269 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 05:50:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 05:50:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 05:50:48,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:48,271 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 05:50:48,293 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 05:50:48,483 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 05:50:48,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:48,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:48,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1762644405, now seen corresponding path program 1 times [2022-04-28 05:50:48,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:48,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [591957010] [2022-04-28 05:50:48,485 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:48,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1762644405, now seen corresponding path program 2 times [2022-04-28 05:50:48,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:48,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662481594] [2022-04-28 05:50:48,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:48,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:48,499 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:48,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363338628] [2022-04-28 05:50:48,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:48,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:48,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:48,501 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 05:50:48,502 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 05:50:48,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:50:48,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:48,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:50:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:48,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:48,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {657#true} call ULTIMATE.init(); {657#true} is VALID [2022-04-28 05:50:48,722 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 05:50:48,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#true} assume true; {657#true} is VALID [2022-04-28 05:50:48,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {657#true} {657#true} #108#return; {657#true} is VALID [2022-04-28 05:50:48,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {657#true} call #t~ret9 := main(); {657#true} is VALID [2022-04-28 05:50:48,723 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 05:50:48,723 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 05:50:48,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#true} ~cond := #in~cond; {657#true} is VALID [2022-04-28 05:50:48,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#true} assume !(0 == ~cond); {657#true} is VALID [2022-04-28 05:50:48,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#true} assume true; {657#true} is VALID [2022-04-28 05:50:48,724 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {657#true} {657#true} #94#return; {657#true} is VALID [2022-04-28 05:50:48,724 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 05:50:48,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {657#true} ~cond := #in~cond; {657#true} is VALID [2022-04-28 05:50:48,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {657#true} assume !(0 == ~cond); {657#true} is VALID [2022-04-28 05:50:48,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {657#true} assume true; {657#true} is VALID [2022-04-28 05:50:48,724 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {657#true} {657#true} #96#return; {657#true} is VALID [2022-04-28 05:50:48,725 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 05:50:48,725 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 05:50:48,728 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 05:50:48,728 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 05:50:48,729 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 05:50:48,729 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 05:50:48,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {728#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {658#false} is VALID [2022-04-28 05:50:48,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {658#false} assume !false; {658#false} is VALID [2022-04-28 05:50:48,730 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 05:50:48,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:50:48,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:48,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662481594] [2022-04-28 05:50:48,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:48,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363338628] [2022-04-28 05:50:48,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363338628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:48,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:48,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:50:48,731 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:48,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [591957010] [2022-04-28 05:50:48,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [591957010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:48,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:48,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:50:48,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026467362] [2022-04-28 05:50:48,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:48,732 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 05:50:48,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:48,732 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 05:50:48,746 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 05:50:48,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:50:48,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:48,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:50:48,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:50:48,747 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 05:50:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:49,003 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-28 05:50:49,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:50:49,003 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 05:50:49,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:49,003 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 05:50:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 05:50:49,005 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 05:50:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 05:50:49,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-28 05:50:49,060 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 05:50:49,062 INFO L225 Difference]: With dead ends: 57 [2022-04-28 05:50:49,062 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 05:50:49,062 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 05:50:49,063 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 05:50:49,063 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 05:50:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 05:50:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-28 05:50:49,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:49,077 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 05:50:49,078 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 05:50:49,078 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 05:50:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:49,080 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-04-28 05:50:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2022-04-28 05:50:49,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:49,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:49,081 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 05:50:49,081 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 05:50:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:49,083 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-04-28 05:50:49,083 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2022-04-28 05:50:49,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:49,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:49,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:49,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:49,084 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 05:50:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2022-04-28 05:50:49,086 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 24 [2022-04-28 05:50:49,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:49,086 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2022-04-28 05:50:49,086 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 05:50:49,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 70 transitions. [2022-04-28 05:50:49,134 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 05:50:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-28 05:50:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 05:50:49,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:49,135 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 05:50:49,160 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 05:50:49,351 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 05:50:49,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:49,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1090347867, now seen corresponding path program 1 times [2022-04-28 05:50:49,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:49,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1730827583] [2022-04-28 05:50:49,353 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1090347867, now seen corresponding path program 2 times [2022-04-28 05:50:49,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:49,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619895555] [2022-04-28 05:50:49,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:49,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:49,364 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:49,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [320525926] [2022-04-28 05:50:49,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:49,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:49,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:49,366 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 05:50:49,367 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 05:50:49,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:50:49,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:49,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:50:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:49,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:49,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2022-04-28 05:50:49,534 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 05:50:49,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:49,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#(<= ~counter~0 0)} {1066#true} #108#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:49,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#(<= ~counter~0 0)} call #t~ret9 := main(); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:49,535 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 05:50:49,535 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 05:50:49,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:49,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:49,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:49,538 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 05:50:49,538 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 05:50:49,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:49,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:49,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:49,539 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 05:50:49,540 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 05:50:49,540 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 05:50:49,540 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 05:50:49,541 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 05:50:49,541 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 05:50:49,541 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 05:50:49,542 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 05:50:49,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {1067#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1067#false} is VALID [2022-04-28 05:50:49,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {1067#false} assume !(#t~post6 < 5);havoc #t~post6; {1067#false} is VALID [2022-04-28 05:50:49,542 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 05:50:49,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {1067#false} ~cond := #in~cond; {1067#false} is VALID [2022-04-28 05:50:49,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {1067#false} assume 0 == ~cond; {1067#false} is VALID [2022-04-28 05:50:49,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-28 05:50:49,543 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 05:50:49,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:50:49,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:49,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619895555] [2022-04-28 05:50:49,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:49,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320525926] [2022-04-28 05:50:49,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320525926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:49,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:49,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:50:49,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:49,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1730827583] [2022-04-28 05:50:49,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1730827583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:49,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:49,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:50:49,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463378701] [2022-04-28 05:50:49,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:49,544 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 05:50:49,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:49,544 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 05:50:49,559 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 05:50:49,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:50:49,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:49,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:50:49,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:50:49,560 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 05:50:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:49,660 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2022-04-28 05:50:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:50:49,660 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 05:50:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:49,660 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 05:50:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 05:50:49,662 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 05:50:49,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-28 05:50:49,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-28 05:50:49,717 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 05:50:49,718 INFO L225 Difference]: With dead ends: 77 [2022-04-28 05:50:49,718 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 05:50:49,718 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 05:50:49,719 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 05:50:49,719 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 05:50:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 05:50:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 05:50:49,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:49,736 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 05:50:49,736 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 05:50:49,737 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 05:50:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:49,738 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-04-28 05:50:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-28 05:50:49,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:49,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:49,739 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 05:50:49,739 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 05:50:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:49,741 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-04-28 05:50:49,741 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-28 05:50:49,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:49,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:49,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:49,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:49,742 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 05:50:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-04-28 05:50:49,744 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-04-28 05:50:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:49,744 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-04-28 05:50:49,744 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 05:50:49,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 72 transitions. [2022-04-28 05:50:49,793 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 05:50:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-28 05:50:49,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 05:50:49,793 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:49,793 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 05:50:49,809 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 05:50:50,007 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 05:50:50,007 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:50,008 INFO L85 PathProgramCache]: Analyzing trace with hash 979890972, now seen corresponding path program 1 times [2022-04-28 05:50:50,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:50,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [413291804] [2022-04-28 05:50:50,008 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash 979890972, now seen corresponding path program 2 times [2022-04-28 05:50:50,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:50,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923035083] [2022-04-28 05:50:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:50,029 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:50,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1867165483] [2022-04-28 05:50:50,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:50,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:50,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:50,030 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 05:50:50,031 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 05:50:50,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:50:50,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:50,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:50:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:50,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:50,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} call ULTIMATE.init(); {1531#true} is VALID [2022-04-28 05:50:50,207 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 05:50:50,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {1539#(<= ~counter~0 0)} assume true; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:50,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1539#(<= ~counter~0 0)} {1531#true} #108#return; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:50,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {1539#(<= ~counter~0 0)} call #t~ret9 := main(); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:50,209 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 05:50:50,210 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 05:50:50,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {1539#(<= ~counter~0 0)} ~cond := #in~cond; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:50,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {1539#(<= ~counter~0 0)} assume !(0 == ~cond); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:50,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {1539#(<= ~counter~0 0)} assume true; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:50,212 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 05:50:50,218 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 05:50:50,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {1539#(<= ~counter~0 0)} ~cond := #in~cond; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:50,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {1539#(<= ~counter~0 0)} assume !(0 == ~cond); {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:50,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {1539#(<= ~counter~0 0)} assume true; {1539#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:50,230 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 05:50:50,230 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 05:50:50,231 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 05:50:50,231 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 05:50:50,231 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 05:50:50,232 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 05:50:50,232 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 05:50:50,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {1598#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {1598#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:50,232 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 05:50:50,233 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 05:50:50,233 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 05:50:50,233 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 05:50:50,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} ~cond := #in~cond; {1532#false} is VALID [2022-04-28 05:50:50,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} assume 0 == ~cond; {1532#false} is VALID [2022-04-28 05:50:50,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} assume !false; {1532#false} is VALID [2022-04-28 05:50:50,234 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 05:50:50,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:50:50,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {1532#false} assume !false; {1532#false} is VALID [2022-04-28 05:50:50,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {1532#false} assume 0 == ~cond; {1532#false} is VALID [2022-04-28 05:50:50,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {1532#false} ~cond := #in~cond; {1532#false} is VALID [2022-04-28 05:50:50,365 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 05:50:50,365 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 05:50:50,365 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 05:50:50,365 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 05:50:50,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {1643#(< ~counter~0 5)} assume !(~c~0 >= ~b~0); {1643#(< ~counter~0 5)} is VALID [2022-04-28 05:50:50,366 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 05:50:50,366 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 05:50:50,367 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 05:50:50,367 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 05:50:50,367 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 05:50:50,367 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 05:50:50,368 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1531#true} {1598#(<= ~counter~0 2)} #96#return; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:50,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {1531#true} assume true; {1531#true} is VALID [2022-04-28 05:50:50,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {1531#true} assume !(0 == ~cond); {1531#true} is VALID [2022-04-28 05:50:50,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {1531#true} ~cond := #in~cond; {1531#true} is VALID [2022-04-28 05:50:50,368 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 05:50:50,369 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1531#true} {1598#(<= ~counter~0 2)} #94#return; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:50,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {1531#true} assume true; {1531#true} is VALID [2022-04-28 05:50:50,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {1531#true} assume !(0 == ~cond); {1531#true} is VALID [2022-04-28 05:50:50,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {1531#true} ~cond := #in~cond; {1531#true} is VALID [2022-04-28 05:50:50,369 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 05:50:50,369 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 05:50:50,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {1598#(<= ~counter~0 2)} call #t~ret9 := main(); {1598#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:50,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1598#(<= ~counter~0 2)} {1531#true} #108#return; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:50,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {1598#(<= ~counter~0 2)} assume true; {1598#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:50,370 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 05:50:50,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {1531#true} call ULTIMATE.init(); {1531#true} is VALID [2022-04-28 05:50:50,371 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 05:50:50,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:50,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923035083] [2022-04-28 05:50:50,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:50,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867165483] [2022-04-28 05:50:50,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867165483] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:50:50,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:50:50,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 05:50:50,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:50,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [413291804] [2022-04-28 05:50:50,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [413291804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:50,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:50,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:50:50,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081246926] [2022-04-28 05:50:50,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:50,372 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 05:50:50,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:50,373 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 05:50:50,387 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 05:50:50,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:50:50,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:50,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:50:50,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:50:50,387 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 05:50:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:50,497 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2022-04-28 05:50:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:50:50,497 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 05:50:50,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:50,497 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 05:50:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 05:50:50,498 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 05:50:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 05:50:50,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-28 05:50:50,539 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 05:50:50,540 INFO L225 Difference]: With dead ends: 67 [2022-04-28 05:50:50,540 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 05:50:50,540 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 05:50:50,541 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 05:50:50,541 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 05:50:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 05:50:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-28 05:50:50,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:50,559 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 05:50:50,559 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 05:50:50,559 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 05:50:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:50,561 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-28 05:50:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2022-04-28 05:50:50,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:50,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:50,561 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 05:50:50,562 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 05:50:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:50,563 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-28 05:50:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2022-04-28 05:50:50,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:50,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:50,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:50,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:50,564 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 05:50:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2022-04-28 05:50:50,565 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 30 [2022-04-28 05:50:50,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:50,566 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2022-04-28 05:50:50,566 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 05:50:50,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 77 transitions. [2022-04-28 05:50:50,618 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 05:50:50,619 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-28 05:50:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 05:50:50,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:50,619 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 05:50:50,635 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 05:50:50,835 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 05:50:50,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash 296831538, now seen corresponding path program 1 times [2022-04-28 05:50:50,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:50,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1936038563] [2022-04-28 05:50:50,836 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash 296831538, now seen corresponding path program 2 times [2022-04-28 05:50:50,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:50,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179991988] [2022-04-28 05:50:50,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:50,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:50,852 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:50,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [268542807] [2022-04-28 05:50:50,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:50,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:50,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:50,853 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 05:50:50,854 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 05:50:50,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:50:50,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:50,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:50:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:50,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:51,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {2093#true} call ULTIMATE.init(); {2093#true} is VALID [2022-04-28 05:50:51,048 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 05:50:51,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {2093#true} assume true; {2093#true} is VALID [2022-04-28 05:50:51,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2093#true} {2093#true} #108#return; {2093#true} is VALID [2022-04-28 05:50:51,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {2093#true} call #t~ret9 := main(); {2093#true} is VALID [2022-04-28 05:50:51,049 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 05:50:51,049 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 05:50:51,049 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 05:50:51,050 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 05:50:51,050 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 05:50:51,051 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 05:50:51,051 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 05:50:51,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {2093#true} ~cond := #in~cond; {2093#true} is VALID [2022-04-28 05:50:51,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {2093#true} assume !(0 == ~cond); {2093#true} is VALID [2022-04-28 05:50:51,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {2093#true} assume true; {2093#true} is VALID [2022-04-28 05:50:51,051 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 05:50:51,054 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 05:50:51,054 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 05:50:51,054 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 05:50:51,055 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 05:50:51,055 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 05:50:51,055 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 05:50:51,055 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 05:50:51,056 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 05:50:51,056 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 05:50:51,056 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 05:50:51,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {2172#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2094#false} is VALID [2022-04-28 05:50:51,057 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 05:50:51,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {2094#false} ~cond := #in~cond; {2094#false} is VALID [2022-04-28 05:50:51,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {2094#false} assume 0 == ~cond; {2094#false} is VALID [2022-04-28 05:50:51,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {2094#false} assume !false; {2094#false} is VALID [2022-04-28 05:50:51,057 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 05:50:51,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:50:51,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {2094#false} assume !false; {2094#false} is VALID [2022-04-28 05:50:51,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {2094#false} assume 0 == ~cond; {2094#false} is VALID [2022-04-28 05:50:51,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {2094#false} ~cond := #in~cond; {2094#false} is VALID [2022-04-28 05:50:51,245 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 05:50:51,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {2172#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2094#false} is VALID [2022-04-28 05:50:51,246 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 05:50:51,247 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 05:50:51,247 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 05:50:51,247 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 05:50:51,248 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 05:50:51,248 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 05:50:51,248 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 05:50:51,248 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 05:50:51,249 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 05:50:51,249 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 05:50:51,249 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 05:50:51,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {2093#true} assume true; {2093#true} is VALID [2022-04-28 05:50:51,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {2093#true} assume !(0 == ~cond); {2093#true} is VALID [2022-04-28 05:50:51,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {2093#true} ~cond := #in~cond; {2093#true} is VALID [2022-04-28 05:50:51,250 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 05:50:51,250 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 05:50:51,251 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 05:50:51,251 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 05:50:51,251 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 05:50:51,251 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 05:50:51,251 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 05:50:51,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {2093#true} call #t~ret9 := main(); {2093#true} is VALID [2022-04-28 05:50:51,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2093#true} {2093#true} #108#return; {2093#true} is VALID [2022-04-28 05:50:51,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {2093#true} assume true; {2093#true} is VALID [2022-04-28 05:50:51,252 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 05:50:51,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {2093#true} call ULTIMATE.init(); {2093#true} is VALID [2022-04-28 05:50:51,252 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 05:50:51,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:51,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179991988] [2022-04-28 05:50:51,252 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:51,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268542807] [2022-04-28 05:50:51,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268542807] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:50:51,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:50:51,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 05:50:51,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:51,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1936038563] [2022-04-28 05:50:51,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1936038563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:51,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:51,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:50:51,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648799088] [2022-04-28 05:50:51,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:51,253 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 05:50:51,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:51,254 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 05:50:51,271 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 05:50:51,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:50:51,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:51,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:50:51,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:50:51,272 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 05:50:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:51,934 INFO L93 Difference]: Finished difference Result 138 states and 201 transitions. [2022-04-28 05:50:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:50:51,934 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 05:50:51,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:51,934 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 05:50:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-28 05:50:51,937 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 05:50:51,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-28 05:50:51,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 155 transitions. [2022-04-28 05:50:52,045 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 05:50:52,047 INFO L225 Difference]: With dead ends: 138 [2022-04-28 05:50:52,047 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 05:50:52,048 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 05:50:52,048 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 05:50:52,048 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 05:50:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 05:50:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2022-04-28 05:50:52,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:52,183 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 05:50:52,183 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 05:50:52,183 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 05:50:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:52,187 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2022-04-28 05:50:52,188 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2022-04-28 05:50:52,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:52,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:52,188 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 05:50:52,189 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 05:50:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:52,192 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2022-04-28 05:50:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 193 transitions. [2022-04-28 05:50:52,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:52,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:52,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:52,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:52,193 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 05:50:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2022-04-28 05:50:52,196 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 31 [2022-04-28 05:50:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:52,196 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2022-04-28 05:50:52,196 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 05:50:52,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 122 transitions. [2022-04-28 05:50:52,294 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 05:50:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2022-04-28 05:50:52,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 05:50:52,294 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:52,294 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 05:50:52,321 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 05:50:52,507 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 05:50:52,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:52,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:52,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1911367052, now seen corresponding path program 1 times [2022-04-28 05:50:52,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:52,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1676511258] [2022-04-28 05:50:52,508 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:52,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1911367052, now seen corresponding path program 2 times [2022-04-28 05:50:52,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:52,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854926344] [2022-04-28 05:50:52,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:52,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:52,521 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:52,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081510530] [2022-04-28 05:50:52,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:52,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:52,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:52,523 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 05:50:52,524 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 05:50:52,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:50:52,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:52,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:50:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:52,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:52,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {3015#true} call ULTIMATE.init(); {3015#true} is VALID [2022-04-28 05:50:52,706 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 05:50:52,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {3023#(<= ~counter~0 0)} assume true; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:52,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3023#(<= ~counter~0 0)} {3015#true} #108#return; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:52,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {3023#(<= ~counter~0 0)} call #t~ret9 := main(); {3023#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:52,708 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 05:50:52,708 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 05:50:52,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {3023#(<= ~counter~0 0)} ~cond := #in~cond; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:52,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {3023#(<= ~counter~0 0)} assume !(0 == ~cond); {3023#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:52,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {3023#(<= ~counter~0 0)} assume true; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:52,710 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 05:50:52,711 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 05:50:52,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {3023#(<= ~counter~0 0)} ~cond := #in~cond; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:52,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {3023#(<= ~counter~0 0)} assume !(0 == ~cond); {3023#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:52,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {3023#(<= ~counter~0 0)} assume true; {3023#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:52,717 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 05:50:52,717 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 05:50:52,717 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 05:50:52,718 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 05:50:52,718 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 05:50:52,718 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 05:50:52,719 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 05:50:52,719 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 05:50:52,719 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 05:50:52,720 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 05:50:52,720 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 05:50:52,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {3016#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3016#false} is VALID [2022-04-28 05:50:52,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {3016#false} assume !(#t~post7 < 5);havoc #t~post7; {3016#false} is VALID [2022-04-28 05:50:52,720 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 05:50:52,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {3016#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3016#false} is VALID [2022-04-28 05:50:52,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {3016#false} assume !(#t~post6 < 5);havoc #t~post6; {3016#false} is VALID [2022-04-28 05:50:52,720 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 05:50:52,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {3016#false} ~cond := #in~cond; {3016#false} is VALID [2022-04-28 05:50:52,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {3016#false} assume 0 == ~cond; {3016#false} is VALID [2022-04-28 05:50:52,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {3016#false} assume !false; {3016#false} is VALID [2022-04-28 05:50:52,721 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 05:50:52,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:50:52,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:52,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854926344] [2022-04-28 05:50:52,721 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:52,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081510530] [2022-04-28 05:50:52,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081510530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:52,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:52,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:50:52,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:52,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1676511258] [2022-04-28 05:50:52,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1676511258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:52,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:52,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:50:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916745731] [2022-04-28 05:50:52,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:52,722 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 05:50:52,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:52,723 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 05:50:52,742 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 05:50:52,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:50:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:52,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:50:52,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:50:52,742 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 05:50:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:52,943 INFO L93 Difference]: Finished difference Result 127 states and 178 transitions. [2022-04-28 05:50:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:50:52,943 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 05:50:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:52,943 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 05:50:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-28 05:50:52,944 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 05:50:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-28 05:50:52,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2022-04-28 05:50:53,000 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 05:50:53,001 INFO L225 Difference]: With dead ends: 127 [2022-04-28 05:50:53,001 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 05:50:53,002 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 05:50:53,002 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 05:50:53,002 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 05:50:53,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 05:50:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-04-28 05:50:53,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:53,113 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 05:50:53,113 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 05:50:53,113 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 05:50:53,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:53,116 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-04-28 05:50:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-28 05:50:53,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:53,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:53,116 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 05:50:53,117 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 05:50:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:53,119 INFO L93 Difference]: Finished difference Result 90 states and 124 transitions. [2022-04-28 05:50:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-28 05:50:53,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:53,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:53,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:53,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:53,119 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 05:50:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2022-04-28 05:50:53,121 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 35 [2022-04-28 05:50:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:53,121 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2022-04-28 05:50:53,122 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 05:50:53,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 124 transitions. [2022-04-28 05:50:53,233 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 05:50:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2022-04-28 05:50:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 05:50:53,234 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:53,234 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 05:50:53,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 05:50:53,434 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 05:50:53,434 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:53,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash -304485816, now seen corresponding path program 1 times [2022-04-28 05:50:53,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:53,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1844006135] [2022-04-28 05:50:53,435 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash -304485816, now seen corresponding path program 2 times [2022-04-28 05:50:53,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:53,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119050290] [2022-04-28 05:50:53,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:53,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:53,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:53,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [168365215] [2022-04-28 05:50:53,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:53,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:53,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:53,457 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 05:50:53,458 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 05:50:53,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:50:53,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:53,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:50:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:53,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:53,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {3739#true} call ULTIMATE.init(); {3739#true} is VALID [2022-04-28 05:50:53,706 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 05:50:53,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {3747#(<= ~counter~0 0)} assume true; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:53,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3747#(<= ~counter~0 0)} {3739#true} #108#return; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:53,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {3747#(<= ~counter~0 0)} call #t~ret9 := main(); {3747#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:53,707 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 05:50:53,708 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 05:50:53,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {3747#(<= ~counter~0 0)} ~cond := #in~cond; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:53,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {3747#(<= ~counter~0 0)} assume !(0 == ~cond); {3747#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:53,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {3747#(<= ~counter~0 0)} assume true; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:53,709 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 05:50:53,710 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 05:50:53,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {3747#(<= ~counter~0 0)} ~cond := #in~cond; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:53,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {3747#(<= ~counter~0 0)} assume !(0 == ~cond); {3747#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:53,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {3747#(<= ~counter~0 0)} assume true; {3747#(<= ~counter~0 0)} is VALID [2022-04-28 05:50:53,718 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 05:50:53,718 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 05:50:53,718 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 05:50:53,719 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 05:50:53,719 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 05:50:53,719 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 05:50:53,720 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 05:50:53,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {3806#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {3806#(<= ~counter~0 2)} is VALID [2022-04-28 05:50:53,723 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 05:50:53,724 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 05:50:53,724 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 05:50:53,725 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 05:50:53,725 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 05:50:53,725 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 05:50:53,725 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 05:50:53,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {3740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3740#false} is VALID [2022-04-28 05:50:53,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {3740#false} assume !(#t~post6 < 5);havoc #t~post6; {3740#false} is VALID [2022-04-28 05:50:53,726 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 05:50:53,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {3740#false} ~cond := #in~cond; {3740#false} is VALID [2022-04-28 05:50:53,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {3740#false} assume 0 == ~cond; {3740#false} is VALID [2022-04-28 05:50:53,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {3740#false} assume !false; {3740#false} is VALID [2022-04-28 05:50:53,726 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 05:50:53,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:50:53,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {3740#false} assume !false; {3740#false} is VALID [2022-04-28 05:50:53,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {3740#false} assume 0 == ~cond; {3740#false} is VALID [2022-04-28 05:50:53,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {3740#false} ~cond := #in~cond; {3740#false} is VALID [2022-04-28 05:50:53,923 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 05:50:53,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {3740#false} assume !(#t~post6 < 5);havoc #t~post6; {3740#false} is VALID [2022-04-28 05:50:53,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {3740#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3740#false} is VALID [2022-04-28 05:50:53,923 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 05:50:53,924 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 05:50:53,924 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 05:50:53,924 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 05:50:53,925 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 05:50:53,925 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 05:50:53,926 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 05:50:53,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {3819#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {3819#(<= ~counter~0 3)} is VALID [2022-04-28 05:50:53,926 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 05:50:53,927 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 05:50:53,927 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 05:50:53,927 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 05:50:53,928 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 05:50:53,928 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 05:50:53,928 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3739#true} {3796#(<= ~counter~0 1)} #96#return; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:53,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {3739#true} assume true; {3739#true} is VALID [2022-04-28 05:50:53,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {3739#true} assume !(0 == ~cond); {3739#true} is VALID [2022-04-28 05:50:53,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {3739#true} ~cond := #in~cond; {3739#true} is VALID [2022-04-28 05:50:53,929 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 05:50:53,929 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3739#true} {3796#(<= ~counter~0 1)} #94#return; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:53,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {3739#true} assume true; {3739#true} is VALID [2022-04-28 05:50:53,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {3739#true} assume !(0 == ~cond); {3739#true} is VALID [2022-04-28 05:50:53,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {3739#true} ~cond := #in~cond; {3739#true} is VALID [2022-04-28 05:50:53,930 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 05:50:53,930 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 05:50:53,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {3796#(<= ~counter~0 1)} call #t~ret9 := main(); {3796#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:53,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3796#(<= ~counter~0 1)} {3739#true} #108#return; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:53,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {3796#(<= ~counter~0 1)} assume true; {3796#(<= ~counter~0 1)} is VALID [2022-04-28 05:50:53,932 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 05:50:53,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {3739#true} call ULTIMATE.init(); {3739#true} is VALID [2022-04-28 05:50:53,932 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 05:50:53,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:53,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119050290] [2022-04-28 05:50:53,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:53,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168365215] [2022-04-28 05:50:53,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168365215] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:50:53,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:50:53,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 05:50:53,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:53,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1844006135] [2022-04-28 05:50:53,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1844006135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:53,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:53,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:50:53,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267585278] [2022-04-28 05:50:53,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:53,934 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 05:50:53,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:53,934 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 05:50:53,968 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 05:50:53,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:50:53,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:53,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:50:53,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:50:53,969 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 05:50:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:54,287 INFO L93 Difference]: Finished difference Result 163 states and 227 transitions. [2022-04-28 05:50:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:50:54,287 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 05:50:54,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:54,287 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 05:50:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-04-28 05:50:54,289 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 05:50:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-04-28 05:50:54,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 109 transitions. [2022-04-28 05:50:54,355 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 05:50:54,356 INFO L225 Difference]: With dead ends: 163 [2022-04-28 05:50:54,357 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 05:50:54,357 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 05:50:54,357 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:54,358 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.1s Time] [2022-04-28 05:50:54,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 05:50:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-28 05:50:54,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:54,513 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 05:50:54,513 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 05:50:54,513 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 05:50:54,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:54,516 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2022-04-28 05:50:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 149 transitions. [2022-04-28 05:50:54,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:54,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:54,517 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 05:50:54,517 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 05:50:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:54,519 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2022-04-28 05:50:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 149 transitions. [2022-04-28 05:50:54,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:54,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:54,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:54,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:54,521 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 05:50:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2022-04-28 05:50:54,523 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 36 [2022-04-28 05:50:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:54,523 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2022-04-28 05:50:54,523 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 05:50:54,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 147 transitions. [2022-04-28 05:50:54,644 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 05:50:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2022-04-28 05:50:54,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 05:50:54,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:54,645 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 05:50:54,663 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 05:50:54,845 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 05:50:54,846 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1581560821, now seen corresponding path program 1 times [2022-04-28 05:50:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:54,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1858200408] [2022-04-28 05:50:54,846 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:54,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1581560821, now seen corresponding path program 2 times [2022-04-28 05:50:54,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:54,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374620480] [2022-04-28 05:50:54,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:54,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:54,856 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:54,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930946353] [2022-04-28 05:50:54,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:54,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:54,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:54,869 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 05:50:54,872 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 05:50:54,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:50:54,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:54,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 05:50:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:54,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:55,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {4733#true} call ULTIMATE.init(); {4733#true} is VALID [2022-04-28 05:50:55,165 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 05:50:55,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-28 05:50:55,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4733#true} {4733#true} #108#return; {4733#true} is VALID [2022-04-28 05:50:55,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {4733#true} call #t~ret9 := main(); {4733#true} is VALID [2022-04-28 05:50:55,165 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 05:50:55,165 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 05:50:55,166 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 05:50:55,166 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 05:50:55,167 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 05:50:55,167 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 05:50:55,167 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 05:50:55,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-28 05:50:55,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-28 05:50:55,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-28 05:50:55,169 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 05:50:55,169 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 05:50:55,169 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 05:50:55,170 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 05:50:55,170 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 05:50:55,170 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 05:50:55,171 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 05:50:55,171 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 05:50:55,171 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 05:50:55,172 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 05:50:55,172 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 05:50:55,172 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 05:50:55,173 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 05:50:55,173 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 05:50:55,174 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 05:50:55,174 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 05:50:55,174 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 05:50:55,175 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 05:50:55,176 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 05:50:55,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {4843#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4734#false} is VALID [2022-04-28 05:50:55,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {4734#false} assume !false; {4734#false} is VALID [2022-04-28 05:50:55,176 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 05:50:55,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:50:55,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {4734#false} assume !false; {4734#false} is VALID [2022-04-28 05:50:55,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {4843#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4734#false} is VALID [2022-04-28 05:50:55,380 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 05:50:55,381 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 05:50:55,381 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 05:50:55,381 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 05:50:55,382 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 05:50:55,382 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 05:50:55,382 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 05:50:55,383 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 05:50:55,383 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 05:50:55,383 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 05:50:55,384 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 05:50:55,384 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 05:50:55,384 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 05:50:55,385 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 05:50:55,385 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 05:50:55,385 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 05:50:55,386 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 05:50:55,386 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 05:50:55,386 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4733#true} {4733#true} #96#return; {4733#true} is VALID [2022-04-28 05:50:55,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-28 05:50:55,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-28 05:50:55,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-28 05:50:55,386 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 05:50:55,386 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4733#true} {4733#true} #94#return; {4733#true} is VALID [2022-04-28 05:50:55,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-28 05:50:55,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-28 05:50:55,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-28 05:50:55,387 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 05:50:55,387 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 05:50:55,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {4733#true} call #t~ret9 := main(); {4733#true} is VALID [2022-04-28 05:50:55,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4733#true} {4733#true} #108#return; {4733#true} is VALID [2022-04-28 05:50:55,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-28 05:50:55,387 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 05:50:55,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {4733#true} call ULTIMATE.init(); {4733#true} is VALID [2022-04-28 05:50:55,387 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 05:50:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:55,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374620480] [2022-04-28 05:50:55,388 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:55,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930946353] [2022-04-28 05:50:55,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930946353] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:50:55,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:50:55,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-28 05:50:55,388 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:55,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1858200408] [2022-04-28 05:50:55,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1858200408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:55,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:55,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:50:55,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875076174] [2022-04-28 05:50:55,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:55,389 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 05:50:55,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:55,389 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 05:50:55,410 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 05:50:55,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:50:55,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:55,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:50:55,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:50:55,411 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 05:50:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:56,051 INFO L93 Difference]: Finished difference Result 154 states and 208 transitions. [2022-04-28 05:50:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:50:56,051 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 05:50:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:56,052 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 05:50:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-28 05:50:56,054 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 05:50:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-28 05:50:56,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2022-04-28 05:50:56,129 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 05:50:56,133 INFO L225 Difference]: With dead ends: 154 [2022-04-28 05:50:56,133 INFO L226 Difference]: Without dead ends: 152 [2022-04-28 05:50:56,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:50:56,134 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 55 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:50:56,134 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.1s Time] [2022-04-28 05:50:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-28 05:50:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2022-04-28 05:50:56,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:56,307 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 05:50:56,308 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 05:50:56,308 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 05:50:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:56,311 INFO L93 Difference]: Finished difference Result 152 states and 206 transitions. [2022-04-28 05:50:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 206 transitions. [2022-04-28 05:50:56,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:56,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:56,312 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 05:50:56,312 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 05:50:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:56,314 INFO L93 Difference]: Finished difference Result 152 states and 206 transitions. [2022-04-28 05:50:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 206 transitions. [2022-04-28 05:50:56,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:56,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:56,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:56,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:56,315 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 05:50:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 202 transitions. [2022-04-28 05:50:56,318 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 202 transitions. Word has length 36 [2022-04-28 05:50:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:56,318 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 202 transitions. [2022-04-28 05:50:56,318 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 05:50:56,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 202 transitions. [2022-04-28 05:50:56,486 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 05:50:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 202 transitions. [2022-04-28 05:50:56,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 05:50:56,486 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:56,487 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 05:50:56,504 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 05:50:56,699 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 05:50:56,700 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash -428189223, now seen corresponding path program 3 times [2022-04-28 05:50:56,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:56,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1340549276] [2022-04-28 05:50:56,700 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash -428189223, now seen corresponding path program 4 times [2022-04-28 05:50:56,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:56,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50792088] [2022-04-28 05:50:56,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:56,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:56,726 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:56,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [617502663] [2022-04-28 05:50:56,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:50:56,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:56,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:56,730 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 05:50:56,731 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 05:50:56,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:50:56,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:56,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:50:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:56,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:56,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {5871#true} call ULTIMATE.init(); {5871#true} is VALID [2022-04-28 05:50:56,864 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 05:50:56,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#true} assume true; {5871#true} is VALID [2022-04-28 05:50:56,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#true} {5871#true} #108#return; {5871#true} is VALID [2022-04-28 05:50:56,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {5871#true} call #t~ret9 := main(); {5871#true} is VALID [2022-04-28 05:50:56,864 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 05:50:56,864 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 05:50:56,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {5871#true} ~cond := #in~cond; {5871#true} is VALID [2022-04-28 05:50:56,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {5871#true} assume !(0 == ~cond); {5871#true} is VALID [2022-04-28 05:50:56,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {5871#true} assume true; {5871#true} is VALID [2022-04-28 05:50:56,864 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5871#true} {5871#true} #94#return; {5871#true} is VALID [2022-04-28 05:50:56,864 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 05:50:56,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {5871#true} ~cond := #in~cond; {5871#true} is VALID [2022-04-28 05:50:56,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {5871#true} assume !(0 == ~cond); {5871#true} is VALID [2022-04-28 05:50:56,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {5871#true} assume true; {5871#true} is VALID [2022-04-28 05:50:56,865 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5871#true} {5871#true} #96#return; {5871#true} is VALID [2022-04-28 05:50:56,865 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 05:50:56,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {5871#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5871#true} is VALID [2022-04-28 05:50:56,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {5871#true} assume !!(#t~post6 < 5);havoc #t~post6; {5871#true} is VALID [2022-04-28 05:50:56,865 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 05:50:56,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {5871#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5871#true} is VALID [2022-04-28 05:50:56,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {5871#true} assume !!(#t~post7 < 5);havoc #t~post7; {5871#true} is VALID [2022-04-28 05:50:56,865 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 05:50:56,866 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 05:50:56,866 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 05:50:56,866 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 05:50:56,867 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 05:50:56,867 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 05:50:56,867 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 05:50:56,868 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 05:50:56,868 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 05:50:56,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {5872#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5872#false} is VALID [2022-04-28 05:50:56,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {5872#false} assume !(#t~post6 < 5);havoc #t~post6; {5872#false} is VALID [2022-04-28 05:50:56,868 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 05:50:56,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {5872#false} ~cond := #in~cond; {5872#false} is VALID [2022-04-28 05:50:56,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {5872#false} assume 0 == ~cond; {5872#false} is VALID [2022-04-28 05:50:56,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {5872#false} assume !false; {5872#false} is VALID [2022-04-28 05:50:56,868 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 05:50:56,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:50:56,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:56,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50792088] [2022-04-28 05:50:56,869 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:56,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617502663] [2022-04-28 05:50:56,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617502663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:56,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:56,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:50:56,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:56,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1340549276] [2022-04-28 05:50:56,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1340549276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:56,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:56,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:50:56,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702721926] [2022-04-28 05:50:56,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:56,870 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 05:50:56,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:56,870 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 05:50:56,894 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 05:50:56,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:50:56,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:56,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:50:56,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:50:56,894 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 05:50:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:57,516 INFO L93 Difference]: Finished difference Result 300 states and 442 transitions. [2022-04-28 05:50:57,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:50:57,516 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 05:50:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:57,517 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 05:50:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-28 05:50:57,518 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 05:50:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-28 05:50:57,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2022-04-28 05:50:57,605 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 05:50:57,610 INFO L225 Difference]: With dead ends: 300 [2022-04-28 05:50:57,610 INFO L226 Difference]: Without dead ends: 249 [2022-04-28 05:50:57,610 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 05:50:57,611 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 05:50:57,611 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 05:50:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-28 05:50:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 175. [2022-04-28 05:50:57,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:57,864 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 05:50:57,865 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 05:50:57,865 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 05:50:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:57,870 INFO L93 Difference]: Finished difference Result 249 states and 361 transitions. [2022-04-28 05:50:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2022-04-28 05:50:57,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:57,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:57,871 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 05:50:57,872 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 05:50:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:57,877 INFO L93 Difference]: Finished difference Result 249 states and 361 transitions. [2022-04-28 05:50:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 361 transitions. [2022-04-28 05:50:57,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:57,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:57,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:57,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:57,878 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 05:50:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 239 transitions. [2022-04-28 05:50:57,881 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 239 transitions. Word has length 37 [2022-04-28 05:50:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:57,881 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 239 transitions. [2022-04-28 05:50:57,881 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 05:50:57,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 239 transitions. [2022-04-28 05:50:58,098 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 05:50:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 239 transitions. [2022-04-28 05:50:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 05:50:58,098 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:58,099 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 05:50:58,114 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 05:50:58,315 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 05:50:58,315 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:50:58,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:50:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash -957710478, now seen corresponding path program 1 times [2022-04-28 05:50:58,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:58,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1186518444] [2022-04-28 05:50:58,316 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:50:58,316 INFO L85 PathProgramCache]: Analyzing trace with hash -957710478, now seen corresponding path program 2 times [2022-04-28 05:50:58,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:50:58,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015097525] [2022-04-28 05:50:58,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:50:58,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:50:58,339 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:50:58,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1540088503] [2022-04-28 05:50:58,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:50:58,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:50:58,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:50:58,346 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 05:50:58,348 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 05:50:58,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:50:58,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:50:58,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:50:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:50:58,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:50:58,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {7439#true} call ULTIMATE.init(); {7439#true} is VALID [2022-04-28 05:50:58,584 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 05:50:58,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {7439#true} assume true; {7439#true} is VALID [2022-04-28 05:50:58,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7439#true} {7439#true} #108#return; {7439#true} is VALID [2022-04-28 05:50:58,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {7439#true} call #t~ret9 := main(); {7439#true} is VALID [2022-04-28 05:50:58,584 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 05:50:58,585 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 05:50:58,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {7439#true} ~cond := #in~cond; {7439#true} is VALID [2022-04-28 05:50:58,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {7439#true} assume !(0 == ~cond); {7439#true} is VALID [2022-04-28 05:50:58,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {7439#true} assume true; {7439#true} is VALID [2022-04-28 05:50:58,585 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7439#true} {7439#true} #94#return; {7439#true} is VALID [2022-04-28 05:50:58,585 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 05:50:58,585 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 05:50:58,585 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 05:50:58,586 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 05:50:58,586 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 05:50:58,586 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 05:50:58,587 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 05:50:58,587 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 05:50:58,587 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 05:50:58,588 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 05:50:58,589 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 05:50:58,589 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 05:50:58,589 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 05:50:58,590 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 05:50:58,590 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 05:50:58,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {7439#true} ~cond := #in~cond; {7439#true} is VALID [2022-04-28 05:50:58,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {7439#true} assume !(0 == ~cond); {7439#true} is VALID [2022-04-28 05:50:58,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {7439#true} assume true; {7439#true} is VALID [2022-04-28 05:50:58,590 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 05:50:58,591 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 05:50:58,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {7439#true} ~cond := #in~cond; {7439#true} is VALID [2022-04-28 05:50:58,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {7439#true} assume !(0 == ~cond); {7439#true} is VALID [2022-04-28 05:50:58,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {7439#true} assume true; {7439#true} is VALID [2022-04-28 05:50:58,591 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 05:50:58,592 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 05:50:58,592 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 05:50:58,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {7558#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7440#false} is VALID [2022-04-28 05:50:58,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {7440#false} assume !false; {7440#false} is VALID [2022-04-28 05:50:58,595 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 05:50:58,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:50:58,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:50:58,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015097525] [2022-04-28 05:50:58,596 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:50:58,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540088503] [2022-04-28 05:50:58,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540088503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:58,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:58,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:50:58,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:50:58,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1186518444] [2022-04-28 05:50:58,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1186518444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:50:58,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:50:58,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:50:58,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678354470] [2022-04-28 05:50:58,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:50:58,597 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 05:50:58,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:50:58,597 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 05:50:58,624 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 05:50:58,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:50:58,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:50:58,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:50:58,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:50:58,625 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 05:50:59,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:59,305 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2022-04-28 05:50:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:50:59,305 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 05:50:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:50:59,305 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 05:50:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-04-28 05:50:59,306 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 05:50:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-04-28 05:50:59,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 92 transitions. [2022-04-28 05:50:59,373 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 05:50:59,376 INFO L225 Difference]: With dead ends: 193 [2022-04-28 05:50:59,376 INFO L226 Difference]: Without dead ends: 191 [2022-04-28 05:50:59,376 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 05:50:59,377 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 05:50:59,377 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 05:50:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-28 05:50:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2022-04-28 05:50:59,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:50:59,687 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 05:50:59,687 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 05:50:59,688 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 05:50:59,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:59,691 INFO L93 Difference]: Finished difference Result 191 states and 259 transitions. [2022-04-28 05:50:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2022-04-28 05:50:59,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:59,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:59,691 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 05:50:59,692 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 05:50:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:50:59,695 INFO L93 Difference]: Finished difference Result 191 states and 259 transitions. [2022-04-28 05:50:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2022-04-28 05:50:59,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:50:59,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:50:59,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:50:59,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:50:59,695 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 05:50:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 258 transitions. [2022-04-28 05:50:59,699 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 258 transitions. Word has length 39 [2022-04-28 05:50:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:50:59,699 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 258 transitions. [2022-04-28 05:50:59,699 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 05:50:59,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 258 transitions. [2022-04-28 05:50:59,943 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 05:50:59,943 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 258 transitions. [2022-04-28 05:50:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 05:50:59,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:50:59,944 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 05:50:59,960 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 05:51:00,144 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 05:51:00,145 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:00,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:00,145 INFO L85 PathProgramCache]: Analyzing trace with hash 409018142, now seen corresponding path program 1 times [2022-04-28 05:51:00,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:00,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [125819974] [2022-04-28 05:51:00,146 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash 409018142, now seen corresponding path program 2 times [2022-04-28 05:51:00,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:00,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57181625] [2022-04-28 05:51:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:00,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:00,160 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:00,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796994931] [2022-04-28 05:51:00,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:51:00,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:00,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:00,161 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 05:51:00,162 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 05:51:00,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:51:00,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:51:00,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 05:51:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:51:00,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:51:00,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {8720#true} call ULTIMATE.init(); {8720#true} is VALID [2022-04-28 05:51:00,663 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 05:51:00,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 05:51:00,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8720#true} {8720#true} #108#return; {8720#true} is VALID [2022-04-28 05:51:00,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {8720#true} call #t~ret9 := main(); {8720#true} is VALID [2022-04-28 05:51:00,663 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 05:51:00,663 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 05:51:00,663 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 05:51:00,664 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 05:51:00,664 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 05:51:00,664 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 05:51:00,664 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 05:51:00,665 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 05:51:00,665 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 05:51:00,665 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 05:51:00,666 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 05:51:00,666 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 05:51:00,666 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 05:51:00,668 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 05:51:00,668 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 05:51:00,669 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 05:51:00,669 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 05:51:00,670 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 05:51:00,670 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 05:51:00,670 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 05:51:00,671 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 05:51:00,671 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 05:51:00,672 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 05:51:00,672 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 05:51:00,672 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 05:51:00,673 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 05:51:00,673 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 05:51:00,673 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 05:51:00,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 05:51:00,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 05:51:00,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 05:51:00,674 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 05:51:00,678 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 05:51:00,679 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 05:51:00,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {8847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8721#false} is VALID [2022-04-28 05:51:00,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {8721#false} assume !false; {8721#false} is VALID [2022-04-28 05:51:00,679 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 05:51:00,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:51:00,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {8721#false} assume !false; {8721#false} is VALID [2022-04-28 05:51:00,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {8847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8721#false} is VALID [2022-04-28 05:51:00,955 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 05:51:00,956 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 05:51:00,957 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 05:51:00,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 05:51:00,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 05:51:00,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 05:51:00,957 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 05:51:00,957 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 05:51:00,958 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 05:51:00,958 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 05:51:00,958 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 05:51:00,959 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 05:51:00,959 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 05:51:00,959 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 05:51:00,959 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 05:51:01,462 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 05:51:01,462 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 05:51:01,463 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 05:51:01,463 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 05:51:01,463 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 05:51:01,464 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 05:51:01,464 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 05:51:01,465 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 05:51:01,465 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8720#true} {8720#true} #96#return; {8720#true} is VALID [2022-04-28 05:51:01,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 05:51:01,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 05:51:01,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 05:51:01,465 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 05:51:01,465 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8720#true} {8720#true} #94#return; {8720#true} is VALID [2022-04-28 05:51:01,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 05:51:01,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {8720#true} assume !(0 == ~cond); {8720#true} is VALID [2022-04-28 05:51:01,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {8720#true} ~cond := #in~cond; {8720#true} is VALID [2022-04-28 05:51:01,465 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 05:51:01,465 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 05:51:01,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {8720#true} call #t~ret9 := main(); {8720#true} is VALID [2022-04-28 05:51:01,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8720#true} {8720#true} #108#return; {8720#true} is VALID [2022-04-28 05:51:01,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {8720#true} assume true; {8720#true} is VALID [2022-04-28 05:51:01,466 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 05:51:01,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {8720#true} call ULTIMATE.init(); {8720#true} is VALID [2022-04-28 05:51:01,466 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 05:51:01,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:51:01,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57181625] [2022-04-28 05:51:01,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:51:01,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796994931] [2022-04-28 05:51:01,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796994931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:51:01,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:51:01,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-04-28 05:51:01,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:51:01,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [125819974] [2022-04-28 05:51:01,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [125819974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:01,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:01,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:51:01,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023337544] [2022-04-28 05:51:01,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:51:01,467 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 05:51:01,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:51:01,467 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 05:51:01,493 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 05:51:01,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:51:01,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:01,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:51:01,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:51:01,494 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 05:51:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:02,444 INFO L93 Difference]: Finished difference Result 199 states and 266 transitions. [2022-04-28 05:51:02,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:51:02,445 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 05:51:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:51:02,445 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 05:51:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 05:51:02,446 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 05:51:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 05:51:02,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-28 05:51:02,539 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 05:51:02,542 INFO L225 Difference]: With dead ends: 199 [2022-04-28 05:51:02,542 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 05:51:02,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-28 05:51:02,542 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 05:51:02,542 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 05:51:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 05:51:02,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2022-04-28 05:51:02,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:51:02,853 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 05:51:02,854 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 05:51:02,854 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 05:51:02,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:02,857 INFO L93 Difference]: Finished difference Result 197 states and 264 transitions. [2022-04-28 05:51:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2022-04-28 05:51:02,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:02,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:02,858 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 05:51:02,858 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 05:51:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:02,861 INFO L93 Difference]: Finished difference Result 197 states and 264 transitions. [2022-04-28 05:51:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2022-04-28 05:51:02,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:02,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:02,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:51:02,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:51:02,862 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 05:51:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 261 transitions. [2022-04-28 05:51:02,867 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 261 transitions. Word has length 41 [2022-04-28 05:51:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:51:02,867 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 261 transitions. [2022-04-28 05:51:02,867 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 05:51:02,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 261 transitions. [2022-04-28 05:51:03,114 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 05:51:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 261 transitions. [2022-04-28 05:51:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 05:51:03,115 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:51:03,115 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 05:51:03,131 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 05:51:03,327 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 05:51:03,327 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:03,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:03,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1943393983, now seen corresponding path program 1 times [2022-04-28 05:51:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:03,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [181287228] [2022-04-28 05:51:03,328 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:03,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1943393983, now seen corresponding path program 2 times [2022-04-28 05:51:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:03,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289456416] [2022-04-28 05:51:03,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:03,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:03,342 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:03,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986449306] [2022-04-28 05:51:03,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:51:03,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:03,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:03,343 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 05:51:03,344 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 05:51:03,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:51:03,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:51:03,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:51:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:51:03,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:51:03,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {10165#true} call ULTIMATE.init(); {10165#true} is VALID [2022-04-28 05:51:03,495 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 05:51:03,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {10165#true} assume true; {10165#true} is VALID [2022-04-28 05:51:03,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10165#true} {10165#true} #108#return; {10165#true} is VALID [2022-04-28 05:51:03,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {10165#true} call #t~ret9 := main(); {10165#true} is VALID [2022-04-28 05:51:03,495 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 05:51:03,495 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 05:51:03,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {10165#true} ~cond := #in~cond; {10165#true} is VALID [2022-04-28 05:51:03,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {10165#true} assume !(0 == ~cond); {10165#true} is VALID [2022-04-28 05:51:03,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {10165#true} assume true; {10165#true} is VALID [2022-04-28 05:51:03,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10165#true} {10165#true} #94#return; {10165#true} is VALID [2022-04-28 05:51:03,496 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 05:51:03,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {10165#true} ~cond := #in~cond; {10165#true} is VALID [2022-04-28 05:51:03,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {10165#true} assume !(0 == ~cond); {10165#true} is VALID [2022-04-28 05:51:03,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {10165#true} assume true; {10165#true} is VALID [2022-04-28 05:51:03,496 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10165#true} {10165#true} #96#return; {10165#true} is VALID [2022-04-28 05:51:03,496 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 05:51:03,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {10165#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10165#true} is VALID [2022-04-28 05:51:03,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {10165#true} assume !!(#t~post6 < 5);havoc #t~post6; {10165#true} is VALID [2022-04-28 05:51:03,496 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 05:51:03,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {10165#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10165#true} is VALID [2022-04-28 05:51:03,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {10165#true} assume !!(#t~post7 < 5);havoc #t~post7; {10165#true} is VALID [2022-04-28 05:51:03,497 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 05:51:03,497 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 05:51:03,497 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 05:51:03,497 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 05:51:03,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {10165#true} ~cond := #in~cond; {10165#true} is VALID [2022-04-28 05:51:03,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {10165#true} assume !(0 == ~cond); {10165#true} is VALID [2022-04-28 05:51:03,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {10165#true} assume true; {10165#true} is VALID [2022-04-28 05:51:03,498 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 05:51:03,498 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 05:51:03,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {10165#true} ~cond := #in~cond; {10165#true} is VALID [2022-04-28 05:51:03,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {10165#true} assume !(0 == ~cond); {10165#true} is VALID [2022-04-28 05:51:03,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {10165#true} assume true; {10165#true} is VALID [2022-04-28 05:51:03,499 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 05:51:03,499 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 05:51:03,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {10165#true} ~cond := #in~cond; {10165#true} is VALID [2022-04-28 05:51:03,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {10165#true} assume !(0 == ~cond); {10165#true} is VALID [2022-04-28 05:51:03,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {10165#true} assume true; {10165#true} is VALID [2022-04-28 05:51:03,500 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 05:51:03,500 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 05:51:03,501 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 05:51:03,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {10295#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10166#false} is VALID [2022-04-28 05:51:03,501 INFO L290 TraceCheckUtils]: 43: Hoare triple {10166#false} assume !false; {10166#false} is VALID [2022-04-28 05:51:03,501 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 05:51:03,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:51:03,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:51:03,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289456416] [2022-04-28 05:51:03,502 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:51:03,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986449306] [2022-04-28 05:51:03,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986449306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:03,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:03,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:51:03,502 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:51:03,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [181287228] [2022-04-28 05:51:03,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [181287228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:03,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:03,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:51:03,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596888597] [2022-04-28 05:51:03,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:51:03,504 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 05:51:03,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:51:03,504 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 05:51:03,526 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 05:51:03,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:51:03,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:03,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:51:03,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:51:03,526 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 05:51:04,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:04,154 INFO L93 Difference]: Finished difference Result 261 states and 367 transitions. [2022-04-28 05:51:04,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:51:04,154 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 05:51:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:51:04,154 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 05:51:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 05:51:04,155 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 05:51:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 05:51:04,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 05:51:04,208 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 05:51:04,214 INFO L225 Difference]: With dead ends: 261 [2022-04-28 05:51:04,215 INFO L226 Difference]: Without dead ends: 259 [2022-04-28 05:51:04,215 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 05:51:04,216 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 05:51:04,218 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 05:51:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-28 05:51:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 228. [2022-04-28 05:51:04,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:51:04,641 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 05:51:04,641 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 05:51:04,641 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 05:51:04,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:04,646 INFO L93 Difference]: Finished difference Result 259 states and 364 transitions. [2022-04-28 05:51:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 364 transitions. [2022-04-28 05:51:04,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:04,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:04,647 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 05:51:04,648 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 05:51:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:04,652 INFO L93 Difference]: Finished difference Result 259 states and 364 transitions. [2022-04-28 05:51:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 364 transitions. [2022-04-28 05:51:04,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:04,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:04,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:51:04,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:51:04,653 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 05:51:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 318 transitions. [2022-04-28 05:51:04,658 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 318 transitions. Word has length 44 [2022-04-28 05:51:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:51:04,658 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 318 transitions. [2022-04-28 05:51:04,658 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 05:51:04,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 228 states and 318 transitions. [2022-04-28 05:51:04,972 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 05:51:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 318 transitions. [2022-04-28 05:51:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 05:51:04,973 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:51:04,973 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 05:51:04,988 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 05:51:05,173 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 05:51:05,173 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:05,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash -772903697, now seen corresponding path program 1 times [2022-04-28 05:51:05,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:05,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146764879] [2022-04-28 05:51:05,174 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash -772903697, now seen corresponding path program 2 times [2022-04-28 05:51:05,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:05,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032116004] [2022-04-28 05:51:05,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:05,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:05,183 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:05,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [144737847] [2022-04-28 05:51:05,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:51:05,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:05,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:05,185 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 05:51:05,186 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 05:51:05,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:51:05,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:51:05,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:51:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:51:05,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:51:05,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {11799#true} call ULTIMATE.init(); {11799#true} is VALID [2022-04-28 05:51:05,418 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 05:51:05,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {11807#(<= ~counter~0 0)} assume true; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11807#(<= ~counter~0 0)} {11799#true} #108#return; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {11807#(<= ~counter~0 0)} call #t~ret9 := main(); {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,420 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 05:51:05,420 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 05:51:05,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {11807#(<= ~counter~0 0)} ~cond := #in~cond; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {11807#(<= ~counter~0 0)} assume !(0 == ~cond); {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {11807#(<= ~counter~0 0)} assume true; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,421 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 05:51:05,422 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 05:51:05,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {11807#(<= ~counter~0 0)} ~cond := #in~cond; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {11807#(<= ~counter~0 0)} assume !(0 == ~cond); {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {11807#(<= ~counter~0 0)} assume true; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,423 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 05:51:05,423 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 05:51:05,424 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 05:51:05,424 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 05:51:05,424 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 05:51:05,424 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 05:51:05,425 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 05:51:05,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {11866#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {11866#(<= ~counter~0 2)} is VALID [2022-04-28 05:51:05,425 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 05:51:05,426 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 05:51:05,426 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 05:51:05,426 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 05:51:05,427 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 05:51:05,427 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 05:51:05,427 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 05:51:05,427 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 05:51:05,428 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 05:51:05,428 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 05:51:05,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {11800#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11800#false} is VALID [2022-04-28 05:51:05,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {11800#false} assume !(#t~post7 < 5);havoc #t~post7; {11800#false} is VALID [2022-04-28 05:51:05,428 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 05:51:05,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {11800#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11800#false} is VALID [2022-04-28 05:51:05,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {11800#false} assume !(#t~post6 < 5);havoc #t~post6; {11800#false} is VALID [2022-04-28 05:51:05,428 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 05:51:05,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {11800#false} ~cond := #in~cond; {11800#false} is VALID [2022-04-28 05:51:05,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {11800#false} assume 0 == ~cond; {11800#false} is VALID [2022-04-28 05:51:05,429 INFO L290 TraceCheckUtils]: 41: Hoare triple {11800#false} assume !false; {11800#false} is VALID [2022-04-28 05:51:05,429 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 05:51:05,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:51:05,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {11800#false} assume !false; {11800#false} is VALID [2022-04-28 05:51:05,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {11800#false} assume 0 == ~cond; {11800#false} is VALID [2022-04-28 05:51:05,605 INFO L290 TraceCheckUtils]: 39: Hoare triple {11800#false} ~cond := #in~cond; {11800#false} is VALID [2022-04-28 05:51:05,605 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 05:51:05,605 INFO L290 TraceCheckUtils]: 37: Hoare triple {11800#false} assume !(#t~post6 < 5);havoc #t~post6; {11800#false} is VALID [2022-04-28 05:51:05,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {11800#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11800#false} is VALID [2022-04-28 05:51:05,605 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 05:51:05,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {11800#false} assume !(#t~post7 < 5);havoc #t~post7; {11800#false} is VALID [2022-04-28 05:51:05,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {11800#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11800#false} is VALID [2022-04-28 05:51:05,606 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 05:51:05,606 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 05:51:05,606 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 05:51:05,607 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 05:51:05,607 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 05:51:05,607 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 05:51:05,608 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 05:51:05,610 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 05:51:05,610 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 05:51:05,611 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 05:51:05,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {11866#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {11866#(<= ~counter~0 2)} is VALID [2022-04-28 05:51:05,611 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 05:51:05,611 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 05:51:05,612 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 05:51:05,612 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 05:51:05,612 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 05:51:05,613 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 05:51:05,613 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11799#true} {11807#(<= ~counter~0 0)} #96#return; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {11799#true} assume true; {11799#true} is VALID [2022-04-28 05:51:05,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {11799#true} assume !(0 == ~cond); {11799#true} is VALID [2022-04-28 05:51:05,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {11799#true} ~cond := #in~cond; {11799#true} is VALID [2022-04-28 05:51:05,613 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 05:51:05,614 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11799#true} {11807#(<= ~counter~0 0)} #94#return; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {11799#true} assume true; {11799#true} is VALID [2022-04-28 05:51:05,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {11799#true} assume !(0 == ~cond); {11799#true} is VALID [2022-04-28 05:51:05,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {11799#true} ~cond := #in~cond; {11799#true} is VALID [2022-04-28 05:51:05,615 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 05:51:05,615 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 05:51:05,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {11807#(<= ~counter~0 0)} call #t~ret9 := main(); {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11807#(<= ~counter~0 0)} {11799#true} #108#return; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {11807#(<= ~counter~0 0)} assume true; {11807#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:05,616 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 05:51:05,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {11799#true} call ULTIMATE.init(); {11799#true} is VALID [2022-04-28 05:51:05,616 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 05:51:05,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:51:05,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032116004] [2022-04-28 05:51:05,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:51:05,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144737847] [2022-04-28 05:51:05,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144737847] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:51:05,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:51:05,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 05:51:05,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:51:05,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146764879] [2022-04-28 05:51:05,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146764879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:05,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:05,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:51:05,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931753299] [2022-04-28 05:51:05,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:51:05,618 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 05:51:05,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:51:05,618 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 05:51:05,642 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 05:51:05,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:51:05,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:05,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:51:05,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:51:05,643 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 05:51:06,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:06,350 INFO L93 Difference]: Finished difference Result 429 states and 607 transitions. [2022-04-28 05:51:06,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 05:51:06,350 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 05:51:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:51:06,350 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 05:51:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2022-04-28 05:51:06,352 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 05:51:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2022-04-28 05:51:06,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 132 transitions. [2022-04-28 05:51:06,451 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 05:51:06,455 INFO L225 Difference]: With dead ends: 429 [2022-04-28 05:51:06,455 INFO L226 Difference]: Without dead ends: 264 [2022-04-28 05:51:06,456 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 05:51:06,457 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 05:51:06,457 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 05:51:06,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-28 05:51:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 258. [2022-04-28 05:51:06,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:51:06,915 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 05:51:06,916 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 05:51:06,916 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 05:51:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:06,921 INFO L93 Difference]: Finished difference Result 264 states and 356 transitions. [2022-04-28 05:51:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2022-04-28 05:51:06,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:06,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:06,922 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 05:51:06,922 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 05:51:06,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:06,927 INFO L93 Difference]: Finished difference Result 264 states and 356 transitions. [2022-04-28 05:51:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2022-04-28 05:51:06,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:06,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:06,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:51:06,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:51:06,928 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 05:51:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 351 transitions. [2022-04-28 05:51:06,933 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 351 transitions. Word has length 42 [2022-04-28 05:51:06,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:51:06,933 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 351 transitions. [2022-04-28 05:51:06,933 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 05:51:06,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 351 transitions. [2022-04-28 05:51:07,314 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 05:51:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 351 transitions. [2022-04-28 05:51:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 05:51:07,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:51:07,314 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 05:51:07,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 05:51:07,515 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 05:51:07,515 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:07,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash 744709461, now seen corresponding path program 1 times [2022-04-28 05:51:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:07,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2085268239] [2022-04-28 05:51:07,516 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:07,516 INFO L85 PathProgramCache]: Analyzing trace with hash 744709461, now seen corresponding path program 2 times [2022-04-28 05:51:07,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:07,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832858641] [2022-04-28 05:51:07,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:07,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:07,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1851981948] [2022-04-28 05:51:07,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:51:07,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:07,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:07,526 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 05:51:07,527 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 05:51:07,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:51:07,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:51:07,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:51:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:51:07,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:51:11,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {13964#true} call ULTIMATE.init(); {13964#true} is VALID [2022-04-28 05:51:11,724 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 05:51:11,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {13964#true} assume true; {13964#true} is VALID [2022-04-28 05:51:11,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13964#true} {13964#true} #108#return; {13964#true} is VALID [2022-04-28 05:51:11,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {13964#true} call #t~ret9 := main(); {13964#true} is VALID [2022-04-28 05:51:11,724 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 05:51:11,724 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 05:51:11,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {13964#true} ~cond := #in~cond; {13964#true} is VALID [2022-04-28 05:51:11,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {13964#true} assume !(0 == ~cond); {13964#true} is VALID [2022-04-28 05:51:11,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {13964#true} assume true; {13964#true} is VALID [2022-04-28 05:51:11,724 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13964#true} {13964#true} #94#return; {13964#true} is VALID [2022-04-28 05:51:11,724 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 05:51:11,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {13964#true} ~cond := #in~cond; {13964#true} is VALID [2022-04-28 05:51:11,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {13964#true} assume !(0 == ~cond); {13964#true} is VALID [2022-04-28 05:51:11,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {13964#true} assume true; {13964#true} is VALID [2022-04-28 05:51:11,725 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13964#true} {13964#true} #96#return; {13964#true} is VALID [2022-04-28 05:51:11,725 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 05:51:11,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {13964#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13964#true} is VALID [2022-04-28 05:51:11,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {13964#true} assume !!(#t~post6 < 5);havoc #t~post6; {13964#true} is VALID [2022-04-28 05:51:11,725 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 05:51:11,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {13964#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13964#true} is VALID [2022-04-28 05:51:11,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {13964#true} assume !!(#t~post7 < 5);havoc #t~post7; {13964#true} is VALID [2022-04-28 05:51:11,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {13964#true} assume !(~c~0 >= ~b~0); {13964#true} is VALID [2022-04-28 05:51:11,725 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 05:51:11,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {13964#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13964#true} is VALID [2022-04-28 05:51:11,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {13964#true} assume !!(#t~post6 < 5);havoc #t~post6; {13964#true} is VALID [2022-04-28 05:51:11,733 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 05:51:11,733 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 05:51:11,733 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 05:51:11,734 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 05:51:11,734 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 05:51:11,734 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 05:51:11,734 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 05:51:11,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {13964#true} ~cond := #in~cond; {13964#true} is VALID [2022-04-28 05:51:11,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {13964#true} assume !(0 == ~cond); {13964#true} is VALID [2022-04-28 05:51:11,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {13964#true} assume true; {13964#true} is VALID [2022-04-28 05:51:11,735 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 05:51:11,735 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 05:51:11,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {13964#true} ~cond := #in~cond; {13964#true} is VALID [2022-04-28 05:51:11,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {13964#true} assume !(0 == ~cond); {13964#true} is VALID [2022-04-28 05:51:11,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {13964#true} assume true; {13964#true} is VALID [2022-04-28 05:51:11,736 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 05:51:11,737 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 05:51:11,737 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 05:51:11,737 INFO L290 TraceCheckUtils]: 44: Hoare triple {14100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13965#false} is VALID [2022-04-28 05:51:11,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {13965#false} assume !false; {13965#false} is VALID [2022-04-28 05:51:11,738 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 05:51:11,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:51:11,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:51:11,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832858641] [2022-04-28 05:51:11,738 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:51:11,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851981948] [2022-04-28 05:51:11,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851981948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:11,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:11,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:51:11,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:51:11,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2085268239] [2022-04-28 05:51:11,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2085268239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:11,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:11,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:51:11,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599102630] [2022-04-28 05:51:11,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:51:11,739 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 05:51:11,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:51:11,739 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 05:51:11,763 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 05:51:11,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:51:11,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:11,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:51:11,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:51:11,764 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 05:51:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:12,486 INFO L93 Difference]: Finished difference Result 332 states and 473 transitions. [2022-04-28 05:51:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:51:12,486 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 05:51:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:51:12,486 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 05:51:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 05:51:12,487 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 05:51:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 05:51:12,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 05:51:12,545 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 05:51:12,551 INFO L225 Difference]: With dead ends: 332 [2022-04-28 05:51:12,551 INFO L226 Difference]: Without dead ends: 330 [2022-04-28 05:51:12,552 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 05:51:12,552 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 05:51:12,552 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 05:51:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-04-28 05:51:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 321. [2022-04-28 05:51:13,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:51:13,226 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 05:51:13,226 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 05:51:13,226 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 05:51:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:13,233 INFO L93 Difference]: Finished difference Result 330 states and 471 transitions. [2022-04-28 05:51:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 471 transitions. [2022-04-28 05:51:13,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:13,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:13,234 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 05:51:13,235 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 05:51:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:13,242 INFO L93 Difference]: Finished difference Result 330 states and 471 transitions. [2022-04-28 05:51:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 471 transitions. [2022-04-28 05:51:13,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:13,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:13,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:51:13,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:51:13,243 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 05:51:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 462 transitions. [2022-04-28 05:51:13,251 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 462 transitions. Word has length 46 [2022-04-28 05:51:13,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:51:13,251 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 462 transitions. [2022-04-28 05:51:13,251 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 05:51:13,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 321 states and 462 transitions. [2022-04-28 05:51:13,743 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 05:51:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 462 transitions. [2022-04-28 05:51:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 05:51:13,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:51:13,744 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 05:51:13,759 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 05:51:13,959 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 05:51:13,960 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash -522797827, now seen corresponding path program 1 times [2022-04-28 05:51:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:13,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1387026700] [2022-04-28 05:51:13,960 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash -522797827, now seen corresponding path program 2 times [2022-04-28 05:51:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:13,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571248758] [2022-04-28 05:51:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:13,971 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587885712] [2022-04-28 05:51:13,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:51:13,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:13,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:13,973 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 05:51:13,973 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 05:51:14,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:51:14,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:51:14,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:51:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:51:14,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:51:14,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {16074#true} call ULTIMATE.init(); {16074#true} is VALID [2022-04-28 05:51:14,258 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 05:51:14,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {16082#(<= ~counter~0 0)} assume true; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16082#(<= ~counter~0 0)} {16074#true} #108#return; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {16082#(<= ~counter~0 0)} call #t~ret9 := main(); {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,259 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 05:51:14,260 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 05:51:14,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {16082#(<= ~counter~0 0)} ~cond := #in~cond; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {16082#(<= ~counter~0 0)} assume !(0 == ~cond); {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {16082#(<= ~counter~0 0)} assume true; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,261 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 05:51:14,261 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 05:51:14,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {16082#(<= ~counter~0 0)} ~cond := #in~cond; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {16082#(<= ~counter~0 0)} assume !(0 == ~cond); {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {16082#(<= ~counter~0 0)} assume true; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,263 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 05:51:14,263 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 05:51:14,264 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 05:51:14,264 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 05:51:14,264 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 05:51:14,265 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 05:51:14,265 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 05:51:14,265 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 05:51:14,266 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 05:51:14,266 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 05:51:14,266 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 05:51:14,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {16151#(<= ~counter~0 3)} ~cond := #in~cond; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {16151#(<= ~counter~0 3)} assume !(0 == ~cond); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {16151#(<= ~counter~0 3)} assume true; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,268 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 05:51:14,268 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 05:51:14,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {16151#(<= ~counter~0 3)} ~cond := #in~cond; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {16151#(<= ~counter~0 3)} assume !(0 == ~cond); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {16151#(<= ~counter~0 3)} assume true; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,269 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 05:51:14,270 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 05:51:14,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {16151#(<= ~counter~0 3)} ~cond := #in~cond; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {16151#(<= ~counter~0 3)} assume !(0 == ~cond); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {16151#(<= ~counter~0 3)} assume true; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,271 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 05:51:14,272 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 05:51:14,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {16151#(<= ~counter~0 3)} ~cond := #in~cond; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {16151#(<= ~counter~0 3)} assume !(0 == ~cond); {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {16151#(<= ~counter~0 3)} assume true; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,273 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 05:51:14,273 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 05:51:14,273 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 05:51:14,274 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 05:51:14,274 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 05:51:14,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {16224#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {16224#(<= ~counter~0 4)} is VALID [2022-04-28 05:51:14,274 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 05:51:14,275 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 05:51:14,275 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 05:51:14,275 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 05:51:14,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {16075#false} ~cond := #in~cond; {16075#false} is VALID [2022-04-28 05:51:14,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {16075#false} assume 0 == ~cond; {16075#false} is VALID [2022-04-28 05:51:14,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {16075#false} assume !false; {16075#false} is VALID [2022-04-28 05:51:14,276 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 05:51:14,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:51:14,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {16075#false} assume !false; {16075#false} is VALID [2022-04-28 05:51:14,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {16075#false} assume 0 == ~cond; {16075#false} is VALID [2022-04-28 05:51:14,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {16075#false} ~cond := #in~cond; {16075#false} is VALID [2022-04-28 05:51:14,520 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 05:51:14,521 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 05:51:14,521 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 05:51:14,521 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 05:51:14,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {16224#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {16224#(<= ~counter~0 4)} is VALID [2022-04-28 05:51:14,522 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 05:51:14,522 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 05:51:14,523 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 05:51:14,523 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 05:51:14,523 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16074#true} {16151#(<= ~counter~0 3)} #104#return; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,523 INFO L290 TraceCheckUtils]: 43: Hoare triple {16074#true} assume true; {16074#true} is VALID [2022-04-28 05:51:14,524 INFO L290 TraceCheckUtils]: 42: Hoare triple {16074#true} assume !(0 == ~cond); {16074#true} is VALID [2022-04-28 05:51:14,524 INFO L290 TraceCheckUtils]: 41: Hoare triple {16074#true} ~cond := #in~cond; {16074#true} is VALID [2022-04-28 05:51:14,524 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 05:51:14,524 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16074#true} {16151#(<= ~counter~0 3)} #102#return; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {16074#true} assume true; {16074#true} is VALID [2022-04-28 05:51:14,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {16074#true} assume !(0 == ~cond); {16074#true} is VALID [2022-04-28 05:51:14,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {16074#true} ~cond := #in~cond; {16074#true} is VALID [2022-04-28 05:51:14,524 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 05:51:14,525 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16074#true} {16151#(<= ~counter~0 3)} #100#return; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {16074#true} assume true; {16074#true} is VALID [2022-04-28 05:51:14,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {16074#true} assume !(0 == ~cond); {16074#true} is VALID [2022-04-28 05:51:14,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {16074#true} ~cond := #in~cond; {16074#true} is VALID [2022-04-28 05:51:14,525 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 05:51:14,526 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16074#true} {16151#(<= ~counter~0 3)} #98#return; {16151#(<= ~counter~0 3)} is VALID [2022-04-28 05:51:14,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {16074#true} assume true; {16074#true} is VALID [2022-04-28 05:51:14,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {16074#true} assume !(0 == ~cond); {16074#true} is VALID [2022-04-28 05:51:14,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {16074#true} ~cond := #in~cond; {16074#true} is VALID [2022-04-28 05:51:14,526 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 05:51:14,526 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 05:51:14,527 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 05:51:14,527 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 05:51:14,527 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 05:51:14,528 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 05:51:14,528 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 05:51:14,529 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 05:51:14,529 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 05:51:14,529 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 05:51:14,530 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16074#true} {16082#(<= ~counter~0 0)} #96#return; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {16074#true} assume true; {16074#true} is VALID [2022-04-28 05:51:14,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {16074#true} assume !(0 == ~cond); {16074#true} is VALID [2022-04-28 05:51:14,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {16074#true} ~cond := #in~cond; {16074#true} is VALID [2022-04-28 05:51:14,530 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 05:51:14,530 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16074#true} {16082#(<= ~counter~0 0)} #94#return; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {16074#true} assume true; {16074#true} is VALID [2022-04-28 05:51:14,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {16074#true} assume !(0 == ~cond); {16074#true} is VALID [2022-04-28 05:51:14,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {16074#true} ~cond := #in~cond; {16074#true} is VALID [2022-04-28 05:51:14,531 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 05:51:14,531 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 05:51:14,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {16082#(<= ~counter~0 0)} call #t~ret9 := main(); {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16082#(<= ~counter~0 0)} {16074#true} #108#return; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {16082#(<= ~counter~0 0)} assume true; {16082#(<= ~counter~0 0)} is VALID [2022-04-28 05:51:14,535 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 05:51:14,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {16074#true} call ULTIMATE.init(); {16074#true} is VALID [2022-04-28 05:51:14,535 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 05:51:14,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:51:14,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571248758] [2022-04-28 05:51:14,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:51:14,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587885712] [2022-04-28 05:51:14,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587885712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:51:14,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:51:14,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 05:51:14,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:51:14,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1387026700] [2022-04-28 05:51:14,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1387026700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:14,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:14,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:51:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084921279] [2022-04-28 05:51:14,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:51:14,537 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 05:51:14,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:51:14,537 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 05:51:14,564 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 05:51:14,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:51:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:14,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:51:14,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:51:14,565 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 05:51:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:15,445 INFO L93 Difference]: Finished difference Result 335 states and 475 transitions. [2022-04-28 05:51:15,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 05:51:15,446 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 05:51:15,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:51:15,446 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 05:51:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-28 05:51:15,447 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 05:51:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-28 05:51:15,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2022-04-28 05:51:15,521 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 05:51:15,527 INFO L225 Difference]: With dead ends: 335 [2022-04-28 05:51:15,527 INFO L226 Difference]: Without dead ends: 328 [2022-04-28 05:51:15,527 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 05:51:15,528 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 05:51:15,528 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 05:51:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-04-28 05:51:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2022-04-28 05:51:16,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:51:16,180 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 05:51:16,181 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 05:51:16,181 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 05:51:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:16,188 INFO L93 Difference]: Finished difference Result 328 states and 468 transitions. [2022-04-28 05:51:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 468 transitions. [2022-04-28 05:51:16,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:16,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:16,189 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 05:51:16,189 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 05:51:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:16,196 INFO L93 Difference]: Finished difference Result 328 states and 468 transitions. [2022-04-28 05:51:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 468 transitions. [2022-04-28 05:51:16,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:16,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:16,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:51:16,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:51:16,197 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 05:51:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 465 transitions. [2022-04-28 05:51:16,205 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 465 transitions. Word has length 57 [2022-04-28 05:51:16,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:51:16,205 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 465 transitions. [2022-04-28 05:51:16,205 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 05:51:16,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 324 states and 465 transitions. [2022-04-28 05:51:16,700 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 05:51:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 465 transitions. [2022-04-28 05:51:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 05:51:16,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:51:16,701 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 05:51:16,716 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 05:51:16,901 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 05:51:16,901 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:16,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash 958119025, now seen corresponding path program 1 times [2022-04-28 05:51:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:16,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2147314806] [2022-04-28 05:51:16,902 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:16,902 INFO L85 PathProgramCache]: Analyzing trace with hash 958119025, now seen corresponding path program 2 times [2022-04-28 05:51:16,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:16,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318481396] [2022-04-28 05:51:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:16,911 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:16,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [916022875] [2022-04-28 05:51:16,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:51:16,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:16,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:16,912 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 05:51:16,913 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 05:51:16,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:51:16,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:51:16,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 05:51:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:51:16,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:51:17,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {18401#true} call ULTIMATE.init(); {18401#true} is VALID [2022-04-28 05:51:17,655 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 05:51:17,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 05:51:17,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18401#true} {18401#true} #108#return; {18401#true} is VALID [2022-04-28 05:51:17,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {18401#true} call #t~ret9 := main(); {18401#true} is VALID [2022-04-28 05:51:17,656 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 05:51:17,656 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 05:51:17,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 05:51:17,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 05:51:17,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 05:51:17,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18401#true} {18401#true} #94#return; {18401#true} is VALID [2022-04-28 05:51:17,656 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 05:51:17,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 05:51:17,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 05:51:17,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 05:51:17,656 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18401#true} {18401#true} #96#return; {18401#true} is VALID [2022-04-28 05:51:17,657 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 05:51:17,657 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 05:51:17,657 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 05:51:17,658 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 05:51:17,658 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 05:51:17,659 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 05:51:17,659 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 05:51:17,659 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 05:51:17,666 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 05:51:17,666 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 05:51:17,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {18401#true} ~cond := #in~cond; {18487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:17,667 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 05:51:17,667 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 05:51:17,668 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 05:51:17,668 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 05:51:17,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 05:51:17,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 05:51:17,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 05:51:17,669 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 05:51:17,669 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 05:51:17,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 05:51:17,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 05:51:17,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 05:51:17,670 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 05:51:17,670 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 05:51:17,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 05:51:17,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 05:51:17,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 05:51:17,671 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 05:51:17,672 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 05:51:17,672 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 05:51:17,672 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 05:51:17,673 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 05:51:17,673 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 05:51:17,674 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 05:51:17,674 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 05:51:17,675 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 05:51:17,675 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 05:51:17,676 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 05:51:17,676 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 05:51:17,676 INFO L290 TraceCheckUtils]: 56: Hoare triple {18581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18402#false} is VALID [2022-04-28 05:51:17,676 INFO L290 TraceCheckUtils]: 57: Hoare triple {18402#false} assume !false; {18402#false} is VALID [2022-04-28 05:51:17,677 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 05:51:17,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:51:26,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {18402#false} assume !false; {18402#false} is VALID [2022-04-28 05:51:26,935 INFO L290 TraceCheckUtils]: 56: Hoare triple {18581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18402#false} is VALID [2022-04-28 05:51:26,935 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 05:51:26,936 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 05:51:26,936 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 05:51:26,937 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 05:51:26,937 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 05:51:27,294 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 05:51:27,295 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 05:51:27,295 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 05:51:27,295 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 05:51:27,433 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 05:51:27,434 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 05:51:27,434 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 05:51:27,434 INFO L290 TraceCheckUtils]: 43: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 05:51:27,435 INFO L290 TraceCheckUtils]: 42: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 05:51:27,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 05:51:27,435 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 05:51:27,438 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 05:51:27,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 05:51:27,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 05:51:27,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 05:51:27,438 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 05:51:27,440 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 05:51:27,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 05:51:27,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 05:51:27,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 05:51:27,440 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 05:51:27,441 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 05:51:27,441 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 05:51:27,442 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 05:51:27,442 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 05:51:27,442 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 05:51:27,443 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 05:51:27,443 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 05:51:27,444 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 05:51:27,444 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 05:51:27,445 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 05:51:27,445 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 05:51:27,446 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 05:51:27,446 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 05:51:27,447 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 05:51:27,447 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18401#true} {18401#true} #96#return; {18401#true} is VALID [2022-04-28 05:51:27,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 05:51:27,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 05:51:27,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 05:51:27,447 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 05:51:27,447 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18401#true} {18401#true} #94#return; {18401#true} is VALID [2022-04-28 05:51:27,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 05:51:27,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {18401#true} assume !(0 == ~cond); {18401#true} is VALID [2022-04-28 05:51:27,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {18401#true} ~cond := #in~cond; {18401#true} is VALID [2022-04-28 05:51:27,448 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 05:51:27,448 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 05:51:27,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {18401#true} call #t~ret9 := main(); {18401#true} is VALID [2022-04-28 05:51:27,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18401#true} {18401#true} #108#return; {18401#true} is VALID [2022-04-28 05:51:27,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {18401#true} assume true; {18401#true} is VALID [2022-04-28 05:51:27,448 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 05:51:27,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {18401#true} call ULTIMATE.init(); {18401#true} is VALID [2022-04-28 05:51:27,448 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 05:51:27,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:51:27,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318481396] [2022-04-28 05:51:27,449 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:51:27,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916022875] [2022-04-28 05:51:27,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916022875] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:51:27,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:51:27,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-28 05:51:27,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:51:27,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2147314806] [2022-04-28 05:51:27,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2147314806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:27,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:27,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:51:27,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911127282] [2022-04-28 05:51:27,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:51:27,450 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 05:51:27,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:51:27,450 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 05:51:27,487 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 05:51:27,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:51:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:27,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:51:27,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-28 05:51:27,488 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 05:51:29,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:29,823 INFO L93 Difference]: Finished difference Result 384 states and 559 transitions. [2022-04-28 05:51:29,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 05:51:29,823 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 05:51:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:51:29,823 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 05:51:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2022-04-28 05:51:29,824 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 05:51:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2022-04-28 05:51:29,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 149 transitions. [2022-04-28 05:51:29,966 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 05:51:29,973 INFO L225 Difference]: With dead ends: 384 [2022-04-28 05:51:29,973 INFO L226 Difference]: Without dead ends: 381 [2022-04-28 05:51:29,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-04-28 05:51:29,974 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 65 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 05:51:29,974 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.7s Time] [2022-04-28 05:51:29,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-04-28 05:51:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2022-04-28 05:51:30,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:51:30,683 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 05:51:30,684 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 05:51:30,684 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 05:51:30,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:30,706 INFO L93 Difference]: Finished difference Result 381 states and 555 transitions. [2022-04-28 05:51:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 555 transitions. [2022-04-28 05:51:30,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:30,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:30,708 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 05:51:30,708 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 05:51:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:30,718 INFO L93 Difference]: Finished difference Result 381 states and 555 transitions. [2022-04-28 05:51:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 555 transitions. [2022-04-28 05:51:30,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:30,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:30,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:51:30,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:51:30,720 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 05:51:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 551 transitions. [2022-04-28 05:51:30,729 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 551 transitions. Word has length 58 [2022-04-28 05:51:30,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:51:30,729 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 551 transitions. [2022-04-28 05:51:30,729 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 05:51:30,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 551 transitions. [2022-04-28 05:51:31,410 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 05:51:31,410 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 551 transitions. [2022-04-28 05:51:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 05:51:31,411 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:51:31,411 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 05:51:31,427 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 05:51:31,611 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 05:51:31,612 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:31,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash 27973409, now seen corresponding path program 1 times [2022-04-28 05:51:31,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:31,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1240211642] [2022-04-28 05:51:31,613 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:31,613 INFO L85 PathProgramCache]: Analyzing trace with hash 27973409, now seen corresponding path program 2 times [2022-04-28 05:51:31,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:31,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685888630] [2022-04-28 05:51:31,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:31,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:31,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:31,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509527330] [2022-04-28 05:51:31,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:51:31,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:31,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:31,629 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 05:51:31,629 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 05:51:31,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:51:31,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 05:51:31,676 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 05:51:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 05:51:31,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 05:51:31,714 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 05:51:31,714 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 05:51:31,716 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 05:51:31,735 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 05:51:31,931 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 05:51:31,934 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 05:51:31,936 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 05:51:31,949 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-28 05:51:31,950 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-28 05:51:31,951 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-28 05:51:31,951 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 05:51:31,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 05:51:31 BoogieIcfgContainer [2022-04-28 05:51:31,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 05:51:31,953 INFO L158 Benchmark]: Toolchain (without parser) took 45510.46ms. Allocated memory was 169.9MB in the beginning and 257.9MB in the end (delta: 88.1MB). Free memory was 120.5MB in the beginning and 87.9MB in the end (delta: 32.6MB). Peak memory consumption was 122.0MB. Max. memory is 8.0GB. [2022-04-28 05:51:31,953 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 169.9MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 05:51:31,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.77ms. Allocated memory is still 169.9MB. Free memory was 120.4MB in the beginning and 145.1MB in the end (delta: -24.8MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-04-28 05:51:31,953 INFO L158 Benchmark]: Boogie Preprocessor took 24.83ms. Allocated memory is still 169.9MB. Free memory was 145.1MB in the beginning and 143.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 05:51:31,953 INFO L158 Benchmark]: RCFGBuilder took 289.06ms. Allocated memory is still 169.9MB. Free memory was 143.6MB in the beginning and 129.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 05:51:31,953 INFO L158 Benchmark]: TraceAbstraction took 45019.38ms. Allocated memory was 169.9MB in the beginning and 257.9MB in the end (delta: 88.1MB). Free memory was 129.4MB in the beginning and 87.9MB in the end (delta: 41.5MB). Peak memory consumption was 131.1MB. Max. memory is 8.0GB. [2022-04-28 05:51:31,954 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.10ms. Allocated memory is still 169.9MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 169.77ms. Allocated memory is still 169.9MB. Free memory was 120.4MB in the beginning and 145.1MB in the end (delta: -24.8MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.83ms. Allocated memory is still 169.9MB. Free memory was 145.1MB in the beginning and 143.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 289.06ms. Allocated memory is still 169.9MB. Free memory was 143.6MB in the beginning and 129.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 45019.38ms. Allocated memory was 169.9MB in the beginning and 257.9MB in the end (delta: 88.1MB). Free memory was 129.4MB in the beginning and 87.9MB in the end (delta: 41.5MB). Peak memory consumption was 131.1MB. 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: 45.0s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 702 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 641 mSDsluCounter, 3465 SdHoareTripleChecker+Invalid, 1.7s 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: 4.7s 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 05:51:31,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...