/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/cohendiv-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:13:12,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:13:12,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:13:12,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:13:12,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:13:12,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:13:12,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:13:12,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:13:12,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:13:12,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:13:12,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:13:12,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:13:12,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:13:12,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:13:12,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:13:12,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:13:12,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:13:12,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:13:12,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:13:12,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:13:12,730 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:13:12,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:13:12,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:13:12,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:13:12,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:13:12,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:13:12,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:13:12,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:13:12,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:13:12,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:13:12,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:13:12,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:13:12,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:13:12,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:13:12,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:13:12,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:13:12,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:13:12,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:13:12,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:13:12,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:13:12,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:13:12,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:13:12,758 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 04:13:12,772 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:13:12,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:13:12,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:13:12,774 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:13:12,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:13:12,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:13:12,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:13:12,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:13:12,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:13:12,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:13:12,776 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:13:12,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:13:12,776 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:13:12,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:13:12,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:13:12,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:13:12,777 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:13:12,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:13:12,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:13:12,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:13:12,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:13:12,777 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:13:12,777 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:13:12,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:13:12,778 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:13:12,778 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 04:13:13,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:13:13,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:13:13,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:13:13,042 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:13:13,043 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:13:13,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-28 04:13:13,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be3cafa13/835b5456ecd149c2b7a2988bdef28bfa/FLAGc8c4d244e [2022-04-28 04:13:13,533 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:13:13,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-28 04:13:13,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be3cafa13/835b5456ecd149c2b7a2988bdef28bfa/FLAGc8c4d244e [2022-04-28 04:13:13,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be3cafa13/835b5456ecd149c2b7a2988bdef28bfa [2022-04-28 04:13:13,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:13:13,561 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:13:13,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:13:13,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:13:13,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:13:13,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:13:13" (1/1) ... [2022-04-28 04:13:13,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502e041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:13:13, skipping insertion in model container [2022-04-28 04:13:13,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:13:13" (1/1) ... [2022-04-28 04:13:13,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:13:13,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:13:13,762 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/cohendiv-ll.c[576,589] [2022-04-28 04:13:13,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:13:13,819 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:13:13,834 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/cohendiv-ll.c[576,589] [2022-04-28 04:13:13,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:13:13,870 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:13:13,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:13:13 WrapperNode [2022-04-28 04:13:13,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:13:13,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:13:13,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:13:13,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:13:13,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:13:13" (1/1) ... [2022-04-28 04:13:13,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:13:13" (1/1) ... [2022-04-28 04:13:13,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:13:13" (1/1) ... [2022-04-28 04:13:13,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:13:13" (1/1) ... [2022-04-28 04:13:13,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:13:13" (1/1) ... [2022-04-28 04:13:13,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:13:13" (1/1) ... [2022-04-28 04:13:13,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:13:13" (1/1) ... [2022-04-28 04:13:13,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:13:13,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:13:13,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:13:13,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:13:13,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:13:13" (1/1) ... [2022-04-28 04:13:13,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:13:13,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:13:13,953 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 04:13:13,987 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 04:13:14,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:13:14,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:13:14,001 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:13:14,001 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:13:14,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:13:14,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:13:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:13:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:13:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:13:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:13:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:13:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:13:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:13:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:13:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:13:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:13:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:13:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:13:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:13:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:13:14,066 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:13:14,068 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:13:14,222 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:13:14,228 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:13:14,228 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 04:13:14,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:13:14 BoogieIcfgContainer [2022-04-28 04:13:14,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:13:14,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:13:14,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:13:14,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:13:14,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:13:13" (1/3) ... [2022-04-28 04:13:14,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784bc002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:13:14, skipping insertion in model container [2022-04-28 04:13:14,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:13:13" (2/3) ... [2022-04-28 04:13:14,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784bc002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:13:14, skipping insertion in model container [2022-04-28 04:13:14,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:13:14" (3/3) ... [2022-04-28 04:13:14,237 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll.c [2022-04-28 04:13:14,252 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:13:14,252 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:13:14,291 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:13:14,297 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@6e4b9b46, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23dcab5f [2022-04-28 04:13:14,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:13:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:13:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:13:14,327 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:14,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:14,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:14,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:14,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1389800432, now seen corresponding path program 1 times [2022-04-28 04:13:14,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:14,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1195273594] [2022-04-28 04:13:14,382 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:13:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1389800432, now seen corresponding path program 2 times [2022-04-28 04:13:14,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:14,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048530593] [2022-04-28 04:13:14,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:14,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:14,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:13:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:14,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-28 04:13:14,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 04:13:14,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2022-04-28 04:13:14,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:13:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:14,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 04:13:14,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 04:13:14,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 04:13:14,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #75#return; {40#false} is VALID [2022-04-28 04:13:14,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:13:14,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-28 04:13:14,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 04:13:14,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2022-04-28 04:13:14,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret6 := main(); {39#true} is VALID [2022-04-28 04:13:14,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {39#true} is VALID [2022-04-28 04:13:14,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {39#true} is VALID [2022-04-28 04:13:14,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 04:13:14,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 04:13:14,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 04:13:14,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #75#return; {40#false} is VALID [2022-04-28 04:13:14,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {40#false} is VALID [2022-04-28 04:13:14,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume false; {40#false} is VALID [2022-04-28 04:13:14,682 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {40#false} is VALID [2022-04-28 04:13:14,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-28 04:13:14,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-28 04:13:14,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-28 04:13:14,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:13:14,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:14,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048530593] [2022-04-28 04:13:14,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048530593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:14,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:14,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:13:14,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:14,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1195273594] [2022-04-28 04:13:14,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1195273594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:14,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:14,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:13:14,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975966330] [2022-04-28 04:13:14,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:14,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 04:13:14,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:14,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:13:14,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:14,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:13:14,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:14,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:13:14,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:13:14,771 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:13:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:14,997 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2022-04-28 04:13:14,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:13:14,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 04:13:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:13:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 04:13:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:13:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-28 04:13:15,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-28 04:13:15,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:15,203 INFO L225 Difference]: With dead ends: 63 [2022-04-28 04:13:15,203 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 04:13:15,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:13:15,211 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:15,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:13:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 04:13:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 04:13:15,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:15,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:13:15,248 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:13:15,248 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:13:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:15,252 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-28 04:13:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-28 04:13:15,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:15,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:15,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-04-28 04:13:15,254 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-04-28 04:13:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:15,257 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-28 04:13:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-28 04:13:15,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:15,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:15,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:15,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:13:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-28 04:13:15,263 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 17 [2022-04-28 04:13:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:15,263 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-28 04:13:15,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:13:15,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 38 transitions. [2022-04-28 04:13:15,307 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 04:13:15,307 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-28 04:13:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:13:15,309 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:15,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:15,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:13:15,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:15,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2071348352, now seen corresponding path program 1 times [2022-04-28 04:13:15,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:15,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [594541912] [2022-04-28 04:13:15,313 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:13:15,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2071348352, now seen corresponding path program 2 times [2022-04-28 04:13:15,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:15,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652777481] [2022-04-28 04:13:15,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:15,329 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:13:15,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [450181357] [2022-04-28 04:13:15,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:13:15,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:13:15,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:13:15,332 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 04:13:15,368 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 04:13:15,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:13:15,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:13:15,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:13:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:15,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:13:16,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2022-04-28 04:13:16,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-28 04:13:16,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 04:13:16,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #91#return; {301#true} is VALID [2022-04-28 04:13:16,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret6 := main(); {301#true} is VALID [2022-04-28 04:13:16,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {301#true} is VALID [2022-04-28 04:13:16,022 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {301#true} is VALID [2022-04-28 04:13:16,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 04:13:16,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 04:13:16,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 04:13:16,023 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #75#return; {301#true} is VALID [2022-04-28 04:13:16,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {339#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 04:13:16,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {339#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false; {339#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 04:13:16,026 INFO L272 TraceCheckUtils]: 13: Hoare triple {339#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:13:16,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:13:16,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {302#false} is VALID [2022-04-28 04:13:16,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-28 04:13:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:13:16,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:13:16,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:16,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652777481] [2022-04-28 04:13:16,031 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:13:16,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450181357] [2022-04-28 04:13:16,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450181357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:16,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:16,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:13:16,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:16,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [594541912] [2022-04-28 04:13:16,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [594541912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:16,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:16,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:13:16,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081190580] [2022-04-28 04:13:16,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:16,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 04:13:16,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:16,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:13:16,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:16,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:13:16,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:16,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:13:16,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:13:16,055 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:13:16,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:16,237 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 04:13:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:13:16,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 04:13:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:13:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-28 04:13:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:13:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-28 04:13:16,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-28 04:13:16,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:16,309 INFO L225 Difference]: With dead ends: 42 [2022-04-28 04:13:16,309 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 04:13:16,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 04:13:16,313 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:16,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:13:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 04:13:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-28 04:13:16,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:16,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 04:13:16,342 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 04:13:16,344 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 04:13:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:16,347 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-28 04:13:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 04:13:16,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:16,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:16,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-04-28 04:13:16,349 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-04-28 04:13:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:16,351 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-28 04:13:16,352 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 04:13:16,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:16,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:16,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:16,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 04:13:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-28 04:13:16,358 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2022-04-28 04:13:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:16,359 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-28 04:13:16,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:13:16,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 44 transitions. [2022-04-28 04:13:16,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:16,409 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-28 04:13:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 04:13:16,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:16,419 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:16,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 04:13:16,635 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 04:13:16,636 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash 933849696, now seen corresponding path program 1 times [2022-04-28 04:13:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:16,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1908771642] [2022-04-28 04:13:16,638 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:13:16,638 INFO L85 PathProgramCache]: Analyzing trace with hash 933849696, now seen corresponding path program 2 times [2022-04-28 04:13:16,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:16,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456094666] [2022-04-28 04:13:16,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:16,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:13:16,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [855074469] [2022-04-28 04:13:16,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:13:16,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:13:16,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:13:16,654 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 04:13:16,660 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 04:13:16,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:13:16,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:13:16,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:13:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:16,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:13:17,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {596#true} call ULTIMATE.init(); {596#true} is VALID [2022-04-28 04:13:17,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {596#true} is VALID [2022-04-28 04:13:17,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-28 04:13:17,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {596#true} {596#true} #91#return; {596#true} is VALID [2022-04-28 04:13:17,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {596#true} call #t~ret6 := main(); {596#true} is VALID [2022-04-28 04:13:17,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {596#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {596#true} is VALID [2022-04-28 04:13:17,630 INFO L272 TraceCheckUtils]: 6: Hoare triple {596#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {596#true} is VALID [2022-04-28 04:13:17,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-28 04:13:17,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-28 04:13:17,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-28 04:13:17,631 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {596#true} {596#true} #75#return; {596#true} is VALID [2022-04-28 04:13:17,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {596#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:13:17,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !false; {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:13:17,637 INFO L272 TraceCheckUtils]: 13: Hoare triple {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {596#true} is VALID [2022-04-28 04:13:17,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-28 04:13:17,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-28 04:13:17,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-28 04:13:17,639 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {596#true} {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #77#return; {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:13:17,640 INFO L272 TraceCheckUtils]: 18: Hoare triple {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:13:17,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:13:17,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {597#false} is VALID [2022-04-28 04:13:17,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {597#false} assume !false; {597#false} is VALID [2022-04-28 04:13:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:13:17,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:13:17,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:17,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456094666] [2022-04-28 04:13:17,643 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:13:17,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855074469] [2022-04-28 04:13:17,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855074469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:17,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:17,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:13:17,644 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:17,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1908771642] [2022-04-28 04:13:17,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1908771642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:17,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:17,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:13:17,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656145390] [2022-04-28 04:13:17,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:17,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 04:13:17,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:17,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:13:17,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:17,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:13:17,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:17,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:13:17,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:13:17,669 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:13:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:17,951 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-04-28 04:13:17,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:13:17,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 04:13:17,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:13:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 04:13:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:13:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 04:13:17,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 04:13:18,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:18,030 INFO L225 Difference]: With dead ends: 54 [2022-04-28 04:13:18,030 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 04:13:18,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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 04:13:18,031 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:18,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 123 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:13:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 04:13:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 04:13:18,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:18,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 04:13:18,050 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 04:13:18,051 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 04:13:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:18,054 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-28 04:13:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-28 04:13:18,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:18,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:18,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 51 states. [2022-04-28 04:13:18,066 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 51 states. [2022-04-28 04:13:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:18,070 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-28 04:13:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-28 04:13:18,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:18,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:18,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:18,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 04:13:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-28 04:13:18,074 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 22 [2022-04-28 04:13:18,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:18,075 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-28 04:13:18,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:13:18,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-28 04:13:18,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 04:13:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 04:13:18,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:18,152 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:13:18,175 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 04:13:18,367 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 04:13:18,368 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:18,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:18,369 INFO L85 PathProgramCache]: Analyzing trace with hash 721086345, now seen corresponding path program 1 times [2022-04-28 04:13:18,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:18,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2021775288] [2022-04-28 04:13:18,370 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:13:18,370 INFO L85 PathProgramCache]: Analyzing trace with hash 721086345, now seen corresponding path program 2 times [2022-04-28 04:13:18,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:18,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096903] [2022-04-28 04:13:18,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:18,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:18,403 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:13:18,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285086674] [2022-04-28 04:13:18,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:13:18,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:13:18,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:13:18,405 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 04:13:18,413 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 04:13:18,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:13:18,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:13:18,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:13:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:18,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:13:18,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {978#true} call ULTIMATE.init(); {978#true} is VALID [2022-04-28 04:13:18,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {978#true} is VALID [2022-04-28 04:13:18,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-28 04:13:18,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {978#true} {978#true} #91#return; {978#true} is VALID [2022-04-28 04:13:18,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {978#true} call #t~ret6 := main(); {978#true} is VALID [2022-04-28 04:13:18,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {978#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {978#true} is VALID [2022-04-28 04:13:18,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {978#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {978#true} is VALID [2022-04-28 04:13:18,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {978#true} ~cond := #in~cond; {978#true} is VALID [2022-04-28 04:13:18,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {978#true} assume !(0 == ~cond); {978#true} is VALID [2022-04-28 04:13:18,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-28 04:13:18,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {978#true} {978#true} #75#return; {978#true} is VALID [2022-04-28 04:13:18,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {978#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {978#true} is VALID [2022-04-28 04:13:18,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {978#true} assume !false; {978#true} is VALID [2022-04-28 04:13:18,608 INFO L272 TraceCheckUtils]: 13: Hoare triple {978#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {978#true} is VALID [2022-04-28 04:13:18,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {978#true} ~cond := #in~cond; {978#true} is VALID [2022-04-28 04:13:18,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {978#true} assume !(0 == ~cond); {978#true} is VALID [2022-04-28 04:13:18,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-28 04:13:18,609 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {978#true} {978#true} #77#return; {978#true} is VALID [2022-04-28 04:13:18,609 INFO L272 TraceCheckUtils]: 18: Hoare triple {978#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {978#true} is VALID [2022-04-28 04:13:18,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {978#true} ~cond := #in~cond; {978#true} is VALID [2022-04-28 04:13:18,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {978#true} assume !(0 == ~cond); {978#true} is VALID [2022-04-28 04:13:18,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-28 04:13:18,610 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {978#true} {978#true} #79#return; {978#true} is VALID [2022-04-28 04:13:18,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {978#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 04:13:18,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !false; {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-28 04:13:18,612 INFO L272 TraceCheckUtils]: 25: Hoare triple {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1059#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:13:18,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {1059#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1063#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:13:18,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {1063#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {979#false} is VALID [2022-04-28 04:13:18,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {979#false} assume !false; {979#false} is VALID [2022-04-28 04:13:18,615 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 04:13:18,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:13:18,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:18,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096903] [2022-04-28 04:13:18,615 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:13:18,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285086674] [2022-04-28 04:13:18,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285086674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:18,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:18,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:13:18,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:18,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2021775288] [2022-04-28 04:13:18,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2021775288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:18,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:18,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:13:18,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091305036] [2022-04-28 04:13:18,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:18,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 04:13:18,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:18,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:13:18,645 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 04:13:18,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:13:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:18,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:13:18,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:13:18,647 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:13:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:18,895 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-04-28 04:13:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:13:18,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 04:13:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:13:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 04:13:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:13:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-28 04:13:18,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-28 04:13:18,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:18,964 INFO L225 Difference]: With dead ends: 76 [2022-04-28 04:13:18,964 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 04:13:18,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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 04:13:18,966 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:18,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 126 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:13:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 04:13:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-04-28 04:13:18,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:18,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:13:18,989 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:13:18,990 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:13:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:18,995 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-28 04:13:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-28 04:13:18,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:18,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:18,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 74 states. [2022-04-28 04:13:18,998 INFO L87 Difference]: Start difference. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 74 states. [2022-04-28 04:13:19,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:19,002 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-28 04:13:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-28 04:13:19,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:19,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:19,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:19,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:13:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2022-04-28 04:13:19,008 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 29 [2022-04-28 04:13:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:19,008 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2022-04-28 04:13:19,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:13:19,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 87 transitions. [2022-04-28 04:13:19,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-04-28 04:13:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 04:13:19,116 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:19,117 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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 04:13:19,137 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 04:13:19,327 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 04:13:19,328 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash -607067127, now seen corresponding path program 1 times [2022-04-28 04:13:19,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:19,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553170152] [2022-04-28 04:13:19,329 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:13:19,329 INFO L85 PathProgramCache]: Analyzing trace with hash -607067127, now seen corresponding path program 2 times [2022-04-28 04:13:19,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:19,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853501041] [2022-04-28 04:13:19,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:19,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:19,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:13:19,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1492771159] [2022-04-28 04:13:19,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:13:19,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:13:19,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:13:19,353 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 04:13:19,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 04:13:19,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:13:19,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:13:19,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:13:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:19,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:13:19,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {1505#true} call ULTIMATE.init(); {1505#true} is VALID [2022-04-28 04:13:19,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {1505#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {1505#true} is VALID [2022-04-28 04:13:19,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-28 04:13:19,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1505#true} {1505#true} #91#return; {1505#true} is VALID [2022-04-28 04:13:19,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {1505#true} call #t~ret6 := main(); {1505#true} is VALID [2022-04-28 04:13:19,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {1505#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1505#true} is VALID [2022-04-28 04:13:19,612 INFO L272 TraceCheckUtils]: 6: Hoare triple {1505#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1505#true} is VALID [2022-04-28 04:13:19,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {1505#true} ~cond := #in~cond; {1531#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:13:19,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {1531#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1535#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:13:19,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {1535#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1535#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:13:19,617 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1535#(not (= |assume_abort_if_not_#in~cond| 0))} {1505#true} #75#return; {1542#(<= 1 main_~y~0)} is VALID [2022-04-28 04:13:19,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {1542#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1542#(<= 1 main_~y~0)} is VALID [2022-04-28 04:13:19,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(<= 1 main_~y~0)} assume !false; {1542#(<= 1 main_~y~0)} is VALID [2022-04-28 04:13:19,619 INFO L272 TraceCheckUtils]: 13: Hoare triple {1542#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1505#true} is VALID [2022-04-28 04:13:19,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-28 04:13:19,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-28 04:13:19,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-28 04:13:19,620 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1505#true} {1542#(<= 1 main_~y~0)} #77#return; {1542#(<= 1 main_~y~0)} is VALID [2022-04-28 04:13:19,620 INFO L272 TraceCheckUtils]: 18: Hoare triple {1542#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1505#true} is VALID [2022-04-28 04:13:19,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-28 04:13:19,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-28 04:13:19,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-28 04:13:19,625 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1505#true} {1542#(<= 1 main_~y~0)} #79#return; {1542#(<= 1 main_~y~0)} is VALID [2022-04-28 04:13:19,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {1542#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1582#(<= 1 main_~r~0)} is VALID [2022-04-28 04:13:19,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {1582#(<= 1 main_~r~0)} assume !false; {1582#(<= 1 main_~r~0)} is VALID [2022-04-28 04:13:19,639 INFO L272 TraceCheckUtils]: 25: Hoare triple {1582#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1505#true} is VALID [2022-04-28 04:13:19,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-28 04:13:19,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-28 04:13:19,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-28 04:13:19,641 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1505#true} {1582#(<= 1 main_~r~0)} #81#return; {1582#(<= 1 main_~r~0)} is VALID [2022-04-28 04:13:19,641 INFO L272 TraceCheckUtils]: 30: Hoare triple {1582#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1505#true} is VALID [2022-04-28 04:13:19,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-28 04:13:19,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-28 04:13:19,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-28 04:13:19,645 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1505#true} {1582#(<= 1 main_~r~0)} #83#return; {1582#(<= 1 main_~r~0)} is VALID [2022-04-28 04:13:19,646 INFO L272 TraceCheckUtils]: 35: Hoare triple {1582#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {1619#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:13:19,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {1619#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1623#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:13:19,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {1623#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1506#false} is VALID [2022-04-28 04:13:19,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {1506#false} assume !false; {1506#false} is VALID [2022-04-28 04:13:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 04:13:19,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:13:19,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:19,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853501041] [2022-04-28 04:13:19,648 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:13:19,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492771159] [2022-04-28 04:13:19,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492771159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:19,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:19,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:13:19,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:19,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553170152] [2022-04-28 04:13:19,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553170152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:19,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:19,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:13:19,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882325048] [2022-04-28 04:13:19,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:19,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-28 04:13:19,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:19,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 04:13:19,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:19,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:13:19,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:19,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:13:19,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:13:19,676 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 04:13:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:20,071 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-28 04:13:20,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:13:20,071 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-28 04:13:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 04:13:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 04:13:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 04:13:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 04:13:20,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 04:13:20,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:20,113 INFO L225 Difference]: With dead ends: 73 [2022-04-28 04:13:20,113 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 04:13:20,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:13:20,115 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:20,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:13:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 04:13:20,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-28 04:13:20,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:20,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:13:20,170 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:13:20,170 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:13:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:20,174 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-28 04:13:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-28 04:13:20,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:20,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:20,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 71 states. [2022-04-28 04:13:20,176 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 71 states. [2022-04-28 04:13:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:20,180 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-28 04:13:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-28 04:13:20,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:20,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:20,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:20,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:13:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-04-28 04:13:20,184 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 39 [2022-04-28 04:13:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:20,185 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-04-28 04:13:20,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-28 04:13:20,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 90 transitions. [2022-04-28 04:13:20,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-28 04:13:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 04:13:20,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:20,301 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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 04:13:20,319 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 04:13:20,507 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 04:13:20,507 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1279335692, now seen corresponding path program 1 times [2022-04-28 04:13:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:20,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1714468633] [2022-04-28 04:13:20,509 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:13:20,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1279335692, now seen corresponding path program 2 times [2022-04-28 04:13:20,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:20,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391787131] [2022-04-28 04:13:20,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:20,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:20,526 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:13:20,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622967269] [2022-04-28 04:13:20,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:13:20,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:13:20,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:13:20,528 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 04:13:20,563 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 04:13:20,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:13:20,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:13:20,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:13:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:20,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:13:20,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-28 04:13:20,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {2065#true} is VALID [2022-04-28 04:13:20,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 04:13:20,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #91#return; {2065#true} is VALID [2022-04-28 04:13:20,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret6 := main(); {2065#true} is VALID [2022-04-28 04:13:20,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2065#true} is VALID [2022-04-28 04:13:20,813 INFO L272 TraceCheckUtils]: 6: Hoare triple {2065#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2065#true} is VALID [2022-04-28 04:13:20,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 04:13:20,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 04:13:20,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 04:13:20,813 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2065#true} {2065#true} #75#return; {2065#true} is VALID [2022-04-28 04:13:20,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2065#true} is VALID [2022-04-28 04:13:20,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-28 04:13:20,814 INFO L272 TraceCheckUtils]: 13: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 04:13:20,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 04:13:20,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 04:13:20,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 04:13:20,814 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2065#true} {2065#true} #77#return; {2065#true} is VALID [2022-04-28 04:13:20,814 INFO L272 TraceCheckUtils]: 18: Hoare triple {2065#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 04:13:20,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 04:13:20,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 04:13:20,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 04:13:20,815 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2065#true} {2065#true} #79#return; {2065#true} is VALID [2022-04-28 04:13:20,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {2065#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2065#true} is VALID [2022-04-28 04:13:20,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-28 04:13:20,815 INFO L272 TraceCheckUtils]: 25: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 04:13:20,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {2065#true} ~cond := #in~cond; {2148#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:13:20,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {2148#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:13:20,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:13:20,817 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} {2065#true} #81#return; {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 04:13:20,817 INFO L272 TraceCheckUtils]: 30: Hoare triple {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 04:13:20,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 04:13:20,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 04:13:20,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 04:13:20,818 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2065#true} {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} #83#return; {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 04:13:20,818 INFO L272 TraceCheckUtils]: 35: Hoare triple {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2065#true} is VALID [2022-04-28 04:13:20,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 04:13:20,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 04:13:20,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 04:13:20,820 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2065#true} {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} #85#return; {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 04:13:20,820 INFO L290 TraceCheckUtils]: 40: Hoare triple {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 04:13:20,821 INFO L272 TraceCheckUtils]: 41: Hoare triple {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:13:20,821 INFO L290 TraceCheckUtils]: 42: Hoare triple {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:13:20,822 INFO L290 TraceCheckUtils]: 43: Hoare triple {2201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-28 04:13:20,822 INFO L290 TraceCheckUtils]: 44: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-28 04:13:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 04:13:20,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:13:25,291 INFO L290 TraceCheckUtils]: 44: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-28 04:13:25,291 INFO L290 TraceCheckUtils]: 43: Hoare triple {2201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-28 04:13:25,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:13:25,293 INFO L272 TraceCheckUtils]: 41: Hoare triple {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:13:25,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 04:13:25,294 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2065#true} {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #85#return; {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 04:13:25,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 04:13:25,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 04:13:25,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 04:13:25,295 INFO L272 TraceCheckUtils]: 35: Hoare triple {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2065#true} is VALID [2022-04-28 04:13:25,295 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2065#true} {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #83#return; {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 04:13:25,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 04:13:25,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 04:13:25,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 04:13:25,296 INFO L272 TraceCheckUtils]: 30: Hoare triple {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 04:13:25,297 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} {2065#true} #81#return; {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 04:13:25,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:13:25,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {2263#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:13:25,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {2065#true} ~cond := #in~cond; {2263#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:13:25,298 INFO L272 TraceCheckUtils]: 25: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 04:13:25,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-28 04:13:25,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {2065#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2065#true} is VALID [2022-04-28 04:13:25,299 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2065#true} {2065#true} #79#return; {2065#true} is VALID [2022-04-28 04:13:25,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 04:13:25,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 04:13:25,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 04:13:25,299 INFO L272 TraceCheckUtils]: 18: Hoare triple {2065#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 04:13:25,300 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2065#true} {2065#true} #77#return; {2065#true} is VALID [2022-04-28 04:13:25,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 04:13:25,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 04:13:25,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 04:13:25,300 INFO L272 TraceCheckUtils]: 13: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-28 04:13:25,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-28 04:13:25,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2065#true} is VALID [2022-04-28 04:13:25,300 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2065#true} {2065#true} #75#return; {2065#true} is VALID [2022-04-28 04:13:25,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 04:13:25,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-28 04:13:25,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-28 04:13:25,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {2065#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2065#true} is VALID [2022-04-28 04:13:25,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2065#true} is VALID [2022-04-28 04:13:25,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret6 := main(); {2065#true} is VALID [2022-04-28 04:13:25,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #91#return; {2065#true} is VALID [2022-04-28 04:13:25,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-28 04:13:25,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {2065#true} is VALID [2022-04-28 04:13:25,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-28 04:13:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 04:13:25,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:25,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391787131] [2022-04-28 04:13:25,303 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:13:25,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622967269] [2022-04-28 04:13:25,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622967269] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:13:25,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:13:25,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 04:13:25,303 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:13:25,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1714468633] [2022-04-28 04:13:25,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1714468633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:25,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:25,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:13:25,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998986551] [2022-04-28 04:13:25,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:13:25,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-28 04:13:25,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:13:25,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 04:13:25,334 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 04:13:25,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:13:25,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:25,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:13:25,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:13:25,335 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 04:13:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:25,745 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2022-04-28 04:13:25,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:13:25,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-28 04:13:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:13:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 04:13:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 04:13:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 04:13:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 04:13:25,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 04:13:25,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:25,796 INFO L225 Difference]: With dead ends: 77 [2022-04-28 04:13:25,796 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 04:13:25,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:13:25,797 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:13:25,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 95 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:13:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 04:13:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-28 04:13:25,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:13:25,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:13:25,864 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:13:25,864 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:13:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:25,871 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-28 04:13:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-28 04:13:25,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:25,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:25,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 75 states. [2022-04-28 04:13:25,872 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 75 states. [2022-04-28 04:13:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:13:25,876 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-28 04:13:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-28 04:13:25,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:13:25,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:13:25,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:13:25,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:13:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:13:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2022-04-28 04:13:25,882 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 45 [2022-04-28 04:13:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:13:25,882 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2022-04-28 04:13:25,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 04:13:25,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 93 transitions. [2022-04-28 04:13:26,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:13:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-28 04:13:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 04:13:26,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:13:26,008 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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 04:13:26,037 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 04:13:26,223 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 04:13:26,224 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:13:26,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:13:26,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1789016266, now seen corresponding path program 1 times [2022-04-28 04:13:26,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:13:26,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1876915779] [2022-04-28 04:13:38,143 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:13:38,147 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:13:38,152 INFO L85 PathProgramCache]: Analyzing trace with hash -862809214, now seen corresponding path program 1 times [2022-04-28 04:13:38,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:13:38,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473355] [2022-04-28 04:13:38,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:38,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:13:38,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:13:38,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1664491451] [2022-04-28 04:13:38,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:13:38,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:13:38,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:13:38,178 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 04:13:38,202 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 04:13:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:38,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 04:13:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:13:38,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:13:39,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {2804#true} call ULTIMATE.init(); {2804#true} is VALID [2022-04-28 04:13:39,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {2804#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {2804#true} is VALID [2022-04-28 04:13:39,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-28 04:13:39,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2804#true} {2804#true} #91#return; {2804#true} is VALID [2022-04-28 04:13:39,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {2804#true} call #t~ret6 := main(); {2804#true} is VALID [2022-04-28 04:13:39,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {2804#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2804#true} is VALID [2022-04-28 04:13:39,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {2804#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2804#true} is VALID [2022-04-28 04:13:39,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {2804#true} ~cond := #in~cond; {2830#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:13:39,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {2830#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2834#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:13:39,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {2834#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2834#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:13:39,947 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2834#(not (= |assume_abort_if_not_#in~cond| 0))} {2804#true} #75#return; {2841#(<= 1 main_~y~0)} is VALID [2022-04-28 04:13:39,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {2841#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2845#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 04:13:39,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {2845#(and (= main_~x~0 main_~r~0) (= main_~q~0 0) (<= 1 main_~y~0))} [95] L36-2-->L37_primed: Formula: (let ((.cse5 (+ v_main_~r~0_26 (* v_main_~q~0_16 v_main_~y~0_30)))) (let ((.cse0 (= v_main_~a~0_20 v_main_~a~0_19)) (.cse6 (= v_main_~x~0_15 .cse5)) (.cse2 (<= v_main_~y~0_30 v_main_~r~0_26)) (.cse3 (<= (* v_main_~y~0_30 2) v_main_~r~0_26)) (.cse7 (= (* v_main_~y~0_30 v_main_~a~0_20) v_main_~b~0_20)) (.cse1 (= v_main_~q~0_16 v_main_~q~0_15))) (or (and (= v_main_~x~0_15 v_main_~x~0_15) .cse0 (= v_main_~y~0_30 v_main_~y~0_30) (= v_main_~r~0_26 v_main_~r~0_25) (= v_main_~b~0_20 v_main_~b~0_19) .cse1) (and (< v_main_~q~0_16 v_main_~q~0_15) (= v_main_~y~0_30 v_main_~b~0_19) .cse2 (not .cse3) (= 1 v_main_~a~0_19) (forall ((v_it_1 Int)) (or (not (<= (+ v_main_~q~0_16 v_it_1 1) v_main_~q~0_15)) (not (<= 1 v_it_1)) (let ((.cse4 (* v_main_~y~0_30 v_it_1))) (and (< v_main_~r~0_26 (+ (* v_main_~y~0_30 2) .cse4)) (<= (+ v_main_~y~0_30 .cse4) v_main_~r~0_26) (<= .cse4 v_main_~r~0_26))))) (= .cse5 (+ v_main_~r~0_25 (* v_main_~q~0_15 v_main_~y~0_30))) .cse6 .cse7) (and (= v_main_~b~0_19 v_main_~b~0_20) .cse0 (= v_main_~r~0_25 v_main_~r~0_26) (or (not .cse6) (not .cse2) .cse3 (not .cse7)) .cse1)))) InVars {main_~q~0=v_main_~q~0_16, main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_30, main_~b~0=v_main_~b~0_20, main_~r~0=v_main_~r~0_26, main_~a~0=v_main_~a~0_20} OutVars{main_~q~0=v_main_~q~0_15, main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_30, main_~b~0=v_main_~b~0_19, main_~r~0=v_main_~r~0_25, main_~a~0=v_main_~a~0_19} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0, main_~a~0] {2849#(and (or (and (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) main_~q~0)) (not (<= 1 v_it_1)))) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0))) (<= 1 main_~y~0))} is VALID [2022-04-28 04:13:39,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {2849#(and (or (and (forall ((v_it_1 Int)) (or (not (<= (+ v_it_1 1) main_~q~0)) (not (<= 1 v_it_1)))) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0))) (<= 1 main_~y~0))} [94] L37_primed-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2853#(and (<= 1 main_~y~0) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~q~0 2) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0))))} is VALID [2022-04-28 04:13:39,958 INFO L272 TraceCheckUtils]: 14: Hoare triple {2853#(and (<= 1 main_~y~0) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~q~0 2) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2804#true} is VALID [2022-04-28 04:13:39,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-28 04:13:39,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-28 04:13:39,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-28 04:13:39,965 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2804#true} {2853#(and (<= 1 main_~y~0) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~q~0 2) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0))))} #77#return; {2853#(and (<= 1 main_~y~0) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~q~0 2) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0))))} is VALID [2022-04-28 04:13:39,968 INFO L272 TraceCheckUtils]: 19: Hoare triple {2853#(and (<= 1 main_~y~0) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~q~0 2) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2872#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:13:39,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {2872#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2876#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:13:39,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {2876#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2805#false} is VALID [2022-04-28 04:13:39,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {2805#false} assume !false; {2805#false} is VALID [2022-04-28 04:13:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:13:39,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:13:39,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:13:39,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473355] [2022-04-28 04:13:39,975 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:13:39,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664491451] [2022-04-28 04:13:39,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664491451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:13:39,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:13:39,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 04:14:05,132 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:14:16,729 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:14:16,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1876915779] [2022-04-28 04:14:16,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1876915779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:14:16,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:14:16,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 04:14:16,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241716237] [2022-04-28 04:14:16,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:14:16,730 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 17 states have internal predecessors, (31), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 52 [2022-04-28 04:14:16,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:14:16,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 17 states have internal predecessors, (31), 6 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 04:14:16,765 WARN L143 InductivityCheck]: Transition 2899#(and (<= 0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0))) ( _ , assume !false; , 2853#(and (<= 1 main_~y~0) (or (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (< 0 main_~q~0) (< main_~q~0 2) (< main_~x~0 (* main_~y~0 2)) (<= main_~y~0 main_~x~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0)))) ) not inductive [2022-04-28 04:14:16,782 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 04:14:16,965 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 04:14:16,966 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 04:14:16,970 INFO L158 Benchmark]: Toolchain (without parser) took 63409.22ms. Allocated memory was 180.4MB in the beginning and 235.9MB in the end (delta: 55.6MB). Free memory was 131.6MB in the beginning and 178.7MB in the end (delta: -47.1MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-04-28 04:14:16,970 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:14:16,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.29ms. Allocated memory is still 180.4MB. Free memory was 131.5MB in the beginning and 159.0MB in the end (delta: -27.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 04:14:16,971 INFO L158 Benchmark]: Boogie Preprocessor took 46.96ms. Allocated memory is still 180.4MB. Free memory was 158.7MB in the beginning and 157.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:14:16,971 INFO L158 Benchmark]: RCFGBuilder took 309.41ms. Allocated memory is still 180.4MB. Free memory was 157.2MB in the beginning and 145.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 04:14:16,971 INFO L158 Benchmark]: TraceAbstraction took 62738.27ms. Allocated memory was 180.4MB in the beginning and 235.9MB in the end (delta: 55.6MB). Free memory was 145.1MB in the beginning and 178.7MB in the end (delta: -33.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-04-28 04:14:16,972 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 308.29ms. Allocated memory is still 180.4MB. Free memory was 131.5MB in the beginning and 159.0MB in the end (delta: -27.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.96ms. Allocated memory is still 180.4MB. Free memory was 158.7MB in the beginning and 157.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 309.41ms. Allocated memory is still 180.4MB. Free memory was 157.2MB in the beginning and 145.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 62738.27ms. Allocated memory was 180.4MB in the beginning and 235.9MB in the end (delta: 55.6MB). Free memory was 145.1MB in the beginning and 178.7MB in the end (delta: -33.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 04:14:16,992 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...