/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 14:16:16,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 14:16:16,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 14:16:16,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 14:16:16,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 14:16:16,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 14:16:16,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 14:16:16,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 14:16:16,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 14:16:16,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 14:16:16,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 14:16:16,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 14:16:16,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 14:16:16,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 14:16:16,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 14:16:16,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 14:16:16,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 14:16:16,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 14:16:16,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 14:16:16,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 14:16:16,791 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 14:16:16,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 14:16:16,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 14:16:16,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 14:16:16,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 14:16:16,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 14:16:16,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 14:16:16,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 14:16:16,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 14:16:16,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 14:16:16,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 14:16:16,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 14:16:16,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 14:16:16,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 14:16:16,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 14:16:16,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 14:16:16,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 14:16:16,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 14:16:16,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 14:16:16,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 14:16:16,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 14:16:16,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 14:16:16,804 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 14:16:16,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 14:16:16,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 14:16:16,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 14:16:16,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 14:16:16,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 14:16:16,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 14:16:16,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 14:16:16,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 14:16:16,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 14:16:16,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 14:16:16,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 14:16:16,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 14:16:16,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 14:16:16,811 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 14:16:16,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 14:16:16,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:16:16,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 14:16:16,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 14:16:16,812 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 14:16:16,812 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 14:16:16,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 14:16:16,812 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 14:16:16,812 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 14:16:16,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 14:16:17,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 14:16:17,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 14:16:17,009 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 14:16:17,012 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 14:16:17,012 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound50.c [2022-04-28 14:16:17,065 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a1c2f44/1020a7ead5d549fbb38f3f10ef709efe/FLAG52693f499 [2022-04-28 14:16:17,400 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 14:16:17,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound50.c [2022-04-28 14:16:17,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a1c2f44/1020a7ead5d549fbb38f3f10ef709efe/FLAG52693f499 [2022-04-28 14:16:17,853 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a1c2f44/1020a7ead5d549fbb38f3f10ef709efe [2022-04-28 14:16:17,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 14:16:17,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 14:16:17,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 14:16:17,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 14:16:17,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 14:16:17,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:16:17" (1/1) ... [2022-04-28 14:16:17,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70560116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:16:17, skipping insertion in model container [2022-04-28 14:16:17,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:16:17" (1/1) ... [2022-04-28 14:16:17,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 14:16:17,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 14:16:17,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound50.c[454,467] [2022-04-28 14:16:17,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:16:17,986 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 14:16:17,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps2-ll_unwindbound50.c[454,467] [2022-04-28 14:16:17,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 14:16:18,005 INFO L208 MainTranslator]: Completed translation [2022-04-28 14:16:18,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:16:18 WrapperNode [2022-04-28 14:16:18,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 14:16:18,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 14:16:18,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 14:16:18,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 14:16:18,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:16:18" (1/1) ... [2022-04-28 14:16:18,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:16:18" (1/1) ... [2022-04-28 14:16:18,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:16:18" (1/1) ... [2022-04-28 14:16:18,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:16:18" (1/1) ... [2022-04-28 14:16:18,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:16:18" (1/1) ... [2022-04-28 14:16:18,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:16:18" (1/1) ... [2022-04-28 14:16:18,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:16:18" (1/1) ... [2022-04-28 14:16:18,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 14:16:18,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 14:16:18,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 14:16:18,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 14:16:18,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:16:18" (1/1) ... [2022-04-28 14:16:18,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 14:16:18,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:16:18,044 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 14:16:18,046 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 14:16:18,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 14:16:18,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 14:16:18,070 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 14:16:18,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 14:16:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 14:16:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 14:16:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 14:16:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 14:16:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 14:16:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 14:16:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 14:16:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 14:16:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 14:16:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 14:16:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 14:16:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 14:16:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 14:16:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 14:16:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 14:16:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 14:16:18,119 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 14:16:18,120 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 14:16:18,194 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 14:16:18,198 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 14:16:18,199 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 14:16:18,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:16:18 BoogieIcfgContainer [2022-04-28 14:16:18,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 14:16:18,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 14:16:18,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 14:16:18,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 14:16:18,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:16:17" (1/3) ... [2022-04-28 14:16:18,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e88751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:16:18, skipping insertion in model container [2022-04-28 14:16:18,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:16:18" (2/3) ... [2022-04-28 14:16:18,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e88751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:16:18, skipping insertion in model container [2022-04-28 14:16:18,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:16:18" (3/3) ... [2022-04-28 14:16:18,223 INFO L111 eAbstractionObserver]: Analyzing ICFG ps2-ll_unwindbound50.c [2022-04-28 14:16:18,234 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 14:16:18,234 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 14:16:18,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 14:16:18,279 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@f0f8029, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@582d0c30 [2022-04-28 14:16:18,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 14:16:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 14:16:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 14:16:18,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:16:18,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:16:18,292 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:16:18,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:16:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-28 14:16:18,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:16:18,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050866070] [2022-04-28 14:16:18,313 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:16:18,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times [2022-04-28 14:16:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:16:18,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66239436] [2022-04-28 14:16:18,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:16:18,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:16:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:16:18,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 14:16:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:16:18,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-28 14:16:18,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 14:16:18,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-28 14:16:18,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 14:16:18,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-28 14:16:18,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 14:16:18,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-28 14:16:18,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret6 := main(); {25#true} is VALID [2022-04-28 14:16:18,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {25#true} is VALID [2022-04-28 14:16:18,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 14:16:18,496 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-28 14:16:18,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 14:16:18,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 14:16:18,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 14:16:18,497 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 14:16:18,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:16:18,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66239436] [2022-04-28 14:16:18,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66239436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:16:18,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:16:18,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:16:18,501 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:16:18,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050866070] [2022-04-28 14:16:18,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050866070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:16:18,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:16:18,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 14:16:18,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541500142] [2022-04-28 14:16:18,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:16:18,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 14:16:18,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:16:18,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:18,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:18,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 14:16:18,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:16:18,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 14:16:18,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 14:16:18,551 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:18,649 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-28 14:16:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 14:16:18,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 14:16:18,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:16:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:18,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-28 14:16:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-28 14:16:18,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-28 14:16:18,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:18,736 INFO L225 Difference]: With dead ends: 39 [2022-04-28 14:16:18,736 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 14:16:18,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 14:16:18,740 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:16:18,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:16:18,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 14:16:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-28 14:16:18,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:16:18,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:18,768 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:18,769 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:18,771 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 14:16:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 14:16:18,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:16:18,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:16:18,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-28 14:16:18,772 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-28 14:16:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:18,773 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 14:16:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 14:16:18,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:16:18,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:16:18,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:16:18,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:16:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 14:16:18,777 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-28 14:16:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:16:18,777 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 14:16:18,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:18,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 14:16:18,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 14:16:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 14:16:18,801 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:16:18,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:16:18,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 14:16:18,805 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:16:18,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:16:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-28 14:16:18,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:16:18,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2137580662] [2022-04-28 14:16:18,806 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:16:18,806 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times [2022-04-28 14:16:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:16:18,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306238459] [2022-04-28 14:16:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:16:18,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:16:18,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:16:18,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [464212089] [2022-04-28 14:16:18,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:16:18,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:16:18,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:16:18,829 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 14:16:18,830 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 14:16:18,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:16:18,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:16:18,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 14:16:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:16:18,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:16:18,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2022-04-28 14:16:18,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {189#(<= ~counter~0 0)} is VALID [2022-04-28 14:16:18,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#(<= ~counter~0 0)} assume true; {189#(<= ~counter~0 0)} is VALID [2022-04-28 14:16:18,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#(<= ~counter~0 0)} {181#true} #54#return; {189#(<= ~counter~0 0)} is VALID [2022-04-28 14:16:18,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#(<= ~counter~0 0)} call #t~ret6 := main(); {189#(<= ~counter~0 0)} is VALID [2022-04-28 14:16:18,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {189#(<= ~counter~0 0)} is VALID [2022-04-28 14:16:19,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {205#(<= |main_#t~post5| 0)} is VALID [2022-04-28 14:16:19,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {205#(<= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {182#false} is VALID [2022-04-28 14:16:19,001 INFO L272 TraceCheckUtils]: 8: Hoare triple {182#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {182#false} is VALID [2022-04-28 14:16:19,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#false} ~cond := #in~cond; {182#false} is VALID [2022-04-28 14:16:19,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#false} assume 0 == ~cond; {182#false} is VALID [2022-04-28 14:16:19,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {182#false} assume !false; {182#false} is VALID [2022-04-28 14:16:19,001 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 14:16:19,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:16:19,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:16:19,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306238459] [2022-04-28 14:16:19,002 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:16:19,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464212089] [2022-04-28 14:16:19,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464212089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:16:19,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:16:19,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:16:19,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:16:19,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2137580662] [2022-04-28 14:16:19,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2137580662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:16:19,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:16:19,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 14:16:19,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629362049] [2022-04-28 14:16:19,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:16:19,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 14:16:19,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:16:19,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:19,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:19,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 14:16:19,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:16:19,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 14:16:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:16:19,017 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:19,054 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 14:16:19,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 14:16:19,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 14:16:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:16:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 14:16:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 14:16:19,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-28 14:16:19,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:19,083 INFO L225 Difference]: With dead ends: 26 [2022-04-28 14:16:19,084 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 14:16:19,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 14:16:19,088 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:16:19,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:16:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 14:16:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 14:16:19,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:16:19,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:19,119 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:19,119 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:19,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:19,121 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 14:16:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 14:16:19,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:16:19,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:16:19,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 14:16:19,121 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 14:16:19,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:19,122 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 14:16:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 14:16:19,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:16:19,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:16:19,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:16:19,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:16:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 14:16:19,124 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-28 14:16:19,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:16:19,124 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 14:16:19,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:19,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 14:16:19,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 14:16:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 14:16:19,140 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:16:19,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:16:19,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 14:16:19,355 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 14:16:19,356 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:16:19,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:16:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-28 14:16:19,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:16:19,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1555054589] [2022-04-28 14:16:19,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 14:16:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times [2022-04-28 14:16:19,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:16:19,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024256755] [2022-04-28 14:16:19,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:16:19,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:16:19,367 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:16:19,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83536673] [2022-04-28 14:16:19,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:16:19,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:16:19,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:16:19,371 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 14:16:19,373 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 14:16:19,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 14:16:19,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:16:19,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:16:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:16:19,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:16:19,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-28 14:16:19,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {348#true} is VALID [2022-04-28 14:16:19,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 14:16:19,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #54#return; {348#true} is VALID [2022-04-28 14:16:19,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret6 := main(); {348#true} is VALID [2022-04-28 14:16:19,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {368#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:16:19,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {368#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:16:19,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {368#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:16:19,504 INFO L272 TraceCheckUtils]: 8: Hoare triple {368#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:16:19,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:16:19,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {349#false} is VALID [2022-04-28 14:16:19,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 14:16:19,506 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 14:16:19,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 14:16:19,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:16:19,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024256755] [2022-04-28 14:16:19,506 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:16:19,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83536673] [2022-04-28 14:16:19,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83536673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:16:19,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:16:19,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:16:19,507 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:16:19,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1555054589] [2022-04-28 14:16:19,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1555054589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:16:19,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:16:19,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:16:19,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190068389] [2022-04-28 14:16:19,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:16:19,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 14:16:19,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:16:19,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:19,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:19,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:16:19,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:16:19,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:16:19,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 14:16:19,519 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:19,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:19,608 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 14:16:19,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:16:19,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 14:16:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:16:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 14:16:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 14:16:19,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-28 14:16:19,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:19,637 INFO L225 Difference]: With dead ends: 28 [2022-04-28 14:16:19,637 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 14:16:19,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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 14:16:19,638 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:16:19,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:16:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 14:16:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 14:16:19,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:16:19,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:16:19,651 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:16:19,651 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:16:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:19,652 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 14:16:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 14:16:19,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:16:19,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:16:19,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 14:16:19,653 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 14:16:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:19,654 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 14:16:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 14:16:19,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:16:19,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:16:19,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:16:19,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:16:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:16:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 14:16:19,656 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-28 14:16:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:16:19,656 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 14:16:19,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 14:16:19,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 14:16:19,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 14:16:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 14:16:19,677 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:16:19,677 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:16:19,693 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 14:16:19,893 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 14:16:19,893 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:16:19,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:16:19,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-28 14:16:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:16:19,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1336457662] [2022-04-28 14:16:20,040 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:16:20,040 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:16:20,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 2 times [2022-04-28 14:16:20,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:16:20,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974840886] [2022-04-28 14:16:20,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:16:20,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:16:20,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:16:20,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [196037969] [2022-04-28 14:16:20,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:16:20,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:16:20,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:16:20,053 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 14:16:20,054 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 14:16:20,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:16:20,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:16:20,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 14:16:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:16:20,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:16:20,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-28 14:16:20,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-28 14:16:20,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-28 14:16:20,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #54#return; {554#(<= ~counter~0 0)} is VALID [2022-04-28 14:16:20,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret6 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-28 14:16:20,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-28 14:16:20,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {570#(<= ~counter~0 1)} is VALID [2022-04-28 14:16:20,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {570#(<= ~counter~0 1)} is VALID [2022-04-28 14:16:20,192 INFO L272 TraceCheckUtils]: 8: Hoare triple {570#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {570#(<= ~counter~0 1)} is VALID [2022-04-28 14:16:20,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {570#(<= ~counter~0 1)} ~cond := #in~cond; {570#(<= ~counter~0 1)} is VALID [2022-04-28 14:16:20,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {570#(<= ~counter~0 1)} assume !(0 == ~cond); {570#(<= ~counter~0 1)} is VALID [2022-04-28 14:16:20,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {570#(<= ~counter~0 1)} assume true; {570#(<= ~counter~0 1)} is VALID [2022-04-28 14:16:20,198 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {570#(<= ~counter~0 1)} {570#(<= ~counter~0 1)} #50#return; {570#(<= ~counter~0 1)} is VALID [2022-04-28 14:16:20,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {570#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {570#(<= ~counter~0 1)} is VALID [2022-04-28 14:16:20,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {570#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {595#(<= |main_#t~post5| 1)} is VALID [2022-04-28 14:16:20,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {595#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {547#false} is VALID [2022-04-28 14:16:20,199 INFO L272 TraceCheckUtils]: 16: Hoare triple {547#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {547#false} is VALID [2022-04-28 14:16:20,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-28 14:16:20,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-28 14:16:20,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-28 14:16:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:16:20,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:16:20,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-28 14:16:20,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-28 14:16:20,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-28 14:16:20,320 INFO L272 TraceCheckUtils]: 16: Hoare triple {547#false} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {547#false} is VALID [2022-04-28 14:16:20,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {547#false} is VALID [2022-04-28 14:16:20,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {627#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {623#(< |main_#t~post5| 50)} is VALID [2022-04-28 14:16:20,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {627#(< ~counter~0 50)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {627#(< ~counter~0 50)} is VALID [2022-04-28 14:16:20,321 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {546#true} {627#(< ~counter~0 50)} #50#return; {627#(< ~counter~0 50)} is VALID [2022-04-28 14:16:20,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#true} assume true; {546#true} is VALID [2022-04-28 14:16:20,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {546#true} assume !(0 == ~cond); {546#true} is VALID [2022-04-28 14:16:20,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {546#true} ~cond := #in~cond; {546#true} is VALID [2022-04-28 14:16:20,322 INFO L272 TraceCheckUtils]: 8: Hoare triple {627#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {546#true} is VALID [2022-04-28 14:16:20,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {627#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {627#(< ~counter~0 50)} is VALID [2022-04-28 14:16:20,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {652#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {627#(< ~counter~0 50)} is VALID [2022-04-28 14:16:20,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {652#(< ~counter~0 49)} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {652#(< ~counter~0 49)} is VALID [2022-04-28 14:16:20,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {652#(< ~counter~0 49)} call #t~ret6 := main(); {652#(< ~counter~0 49)} is VALID [2022-04-28 14:16:20,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {652#(< ~counter~0 49)} {546#true} #54#return; {652#(< ~counter~0 49)} is VALID [2022-04-28 14:16:20,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {652#(< ~counter~0 49)} assume true; {652#(< ~counter~0 49)} is VALID [2022-04-28 14:16:20,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {652#(< ~counter~0 49)} is VALID [2022-04-28 14:16:20,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-28 14:16:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:16:20,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:16:20,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974840886] [2022-04-28 14:16:20,325 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:16:20,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196037969] [2022-04-28 14:16:20,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196037969] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 14:16:20,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 14:16:20,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 14:16:20,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:16:20,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1336457662] [2022-04-28 14:16:20,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1336457662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:16:20,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:16:20,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:16:20,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059139627] [2022-04-28 14:16:20,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:16:20,327 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 14:16:20,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:16:20,327 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:20,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:20,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:16:20,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:16:20,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:16:20,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:16:20,350 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:20,409 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 14:16:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 14:16:20,409 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 14:16:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:16:20,409 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 14:16:20,411 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 14:16:20,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-28 14:16:20,437 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 14:16:20,438 INFO L225 Difference]: With dead ends: 34 [2022-04-28 14:16:20,438 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 14:16:20,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 14:16:20,439 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:16:20,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:16:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 14:16:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 14:16:20,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:16:20,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:16:20,451 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:16:20,452 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:16:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:20,453 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 14:16:20,453 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 14:16:20,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:16:20,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:16:20,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-28 14:16:20,453 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-28 14:16:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:20,454 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 14:16:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 14:16:20,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:16:20,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:16:20,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:16:20,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:16:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 14:16:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-28 14:16:20,456 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2022-04-28 14:16:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:16:20,456 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-28 14:16:20,456 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), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:20,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-28 14:16:20,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 14:16:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 14:16:20,474 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 14:16:20,474 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 14:16:20,492 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 14:16:20,678 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 14:16:20,678 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 14:16:20,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 14:16:20,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-28 14:16:20,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 14:16:20,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [174621278] [2022-04-28 14:16:20,776 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 14:16:20,776 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 14:16:20,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 2 times [2022-04-28 14:16:20,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 14:16:20,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537771303] [2022-04-28 14:16:20,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 14:16:20,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 14:16:20,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 14:16:20,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922337222] [2022-04-28 14:16:20,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 14:16:20,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 14:16:20,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 14:16:20,786 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 14:16:20,787 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 14:16:20,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 14:16:20,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 14:16:20,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 14:16:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 14:16:20,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 14:16:20,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {851#true} call ULTIMATE.init(); {851#true} is VALID [2022-04-28 14:16:20,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {851#true} is VALID [2022-04-28 14:16:20,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 14:16:20,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {851#true} {851#true} #54#return; {851#true} is VALID [2022-04-28 14:16:20,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {851#true} call #t~ret6 := main(); {851#true} is VALID [2022-04-28 14:16:20,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {851#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {871#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:16:20,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {871#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:16:20,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {871#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {871#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:16:20,913 INFO L272 TraceCheckUtils]: 8: Hoare triple {871#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {851#true} is VALID [2022-04-28 14:16:20,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#true} ~cond := #in~cond; {851#true} is VALID [2022-04-28 14:16:20,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {851#true} assume !(0 == ~cond); {851#true} is VALID [2022-04-28 14:16:20,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 14:16:20,914 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {851#true} {871#(and (= main_~x~0 0) (= main_~y~0 0))} #50#return; {871#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 14:16:20,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {871#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {896#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 14:16:20,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {896#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {896#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 14:16:20,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {896#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {896#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 14:16:20,916 INFO L272 TraceCheckUtils]: 16: Hoare triple {896#(and (= (+ (- 1) main_~y~0) 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {906#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:16:20,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {906#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {910#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:16:20,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {910#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {852#false} is VALID [2022-04-28 14:16:20,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {852#false} assume !false; {852#false} is VALID [2022-04-28 14:16:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 14:16:20,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 14:16:21,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {852#false} assume !false; {852#false} is VALID [2022-04-28 14:16:21,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {910#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {852#false} is VALID [2022-04-28 14:16:21,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {906#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {910#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 14:16:21,012 INFO L272 TraceCheckUtils]: 16: Hoare triple {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {906#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 14:16:21,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 14:16:21,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 14:16:21,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 + ~x~0; {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 14:16:21,017 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {851#true} {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} #50#return; {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 14:16:21,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 14:16:21,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {851#true} assume !(0 == ~cond); {851#true} is VALID [2022-04-28 14:16:21,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#true} ~cond := #in~cond; {851#true} is VALID [2022-04-28 14:16:21,018 INFO L272 TraceCheckUtils]: 8: Hoare triple {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~y~0 - 2 * ~x~0 + ~y~0 then 1 else 0)); {851#true} is VALID [2022-04-28 14:16:21,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 14:16:21,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 14:16:21,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {851#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~k~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 0;~x~0 := 0;~c~0 := 0; {926#(= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 14:16:21,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {851#true} call #t~ret6 := main(); {851#true} is VALID [2022-04-28 14:16:21,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {851#true} {851#true} #54#return; {851#true} is VALID [2022-04-28 14:16:21,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 14:16:21,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {851#true} is VALID [2022-04-28 14:16:21,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {851#true} call ULTIMATE.init(); {851#true} is VALID [2022-04-28 14:16:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 14:16:21,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 14:16:21,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537771303] [2022-04-28 14:16:21,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 14:16:21,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922337222] [2022-04-28 14:16:21,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922337222] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 14:16:21,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 14:16:21,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 14:16:21,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 14:16:21,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [174621278] [2022-04-28 14:16:21,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [174621278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 14:16:21,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 14:16:21,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 14:16:21,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029373183] [2022-04-28 14:16:21,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 14:16:21,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 14:16:21,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 14:16:21,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:21,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:21,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 14:16:21,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 14:16:21,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 14:16:21,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 14:16:21,049 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:21,108 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 14:16:21,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 14:16:21,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 14:16:21,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 14:16:21,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 14:16:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 14:16:21,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-28 14:16:21,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:21,126 INFO L225 Difference]: With dead ends: 27 [2022-04-28 14:16:21,126 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 14:16:21,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 14:16:21,127 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 14:16:21,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 14:16:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 14:16:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 14:16:21,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 14:16:21,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:16:21,128 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:16:21,128 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:16:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:21,128 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:16:21,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:16:21,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:16:21,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:16:21,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:16:21,128 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 14:16:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 14:16:21,128 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 14:16:21,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:16:21,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:16:21,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 14:16:21,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 14:16:21,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 14:16:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 14:16:21,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 14:16:21,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-28 14:16:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 14:16:21,129 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 14:16:21,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 14:16:21,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 14:16:21,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 14:16:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 14:16:21,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 14:16:21,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 14:16:21,149 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 14:16:21,335 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 14:16:21,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 14:16:21,449 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 14:16:21,449 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 14:16:21,449 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 14:16:21,449 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-28 14:16:21,449 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-28 14:16:21,449 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-28 14:16:21,449 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-28 14:16:21,449 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 18 40) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-28 14:16:21,449 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))) [2022-04-28 14:16:21,449 INFO L895 garLoopResultBuilder]: At program point L28-1(lines 27 36) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))) [2022-04-28 14:16:21,450 INFO L895 garLoopResultBuilder]: At program point L27-1(lines 27 36) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))) [2022-04-28 14:16:21,450 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 18 40) the Hoare annotation is: true [2022-04-28 14:16:21,450 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))) [2022-04-28 14:16:21,450 INFO L895 garLoopResultBuilder]: At program point L27-4(lines 27 36) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (= (* main_~x~0 2) (+ main_~y~0 (* main_~y~0 main_~y~0)))) [2022-04-28 14:16:21,450 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 18 40) the Hoare annotation is: true [2022-04-28 14:16:21,450 INFO L902 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: true [2022-04-28 14:16:21,450 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 14:16:21,450 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 14:16:21,450 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 14:16:21,450 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 14:16:21,450 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 14:16:21,450 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 14:16:21,450 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 14:16:21,450 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-28 14:16:21,450 INFO L895 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 14:16:21,450 INFO L895 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 14:16:21,451 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 14:16:21,451 INFO L895 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 14:16:21,451 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 14:16:21,453 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2] [2022-04-28 14:16:21,454 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 14:16:21,456 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 14:16:21,460 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 14:16:21,461 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 14:16:21,462 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 14:16:21,462 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 14:16:21,465 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-28 14:16:21,505 INFO L163 areAnnotationChecker]: CFG has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 14:16:21,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:16:21 BoogieIcfgContainer [2022-04-28 14:16:21,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 14:16:21,512 INFO L158 Benchmark]: Toolchain (without parser) took 3656.48ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 145.5MB in the beginning and 185.8MB in the end (delta: -40.4MB). Peak memory consumption was 4.0kB. Max. memory is 8.0GB. [2022-04-28 14:16:21,512 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 14:16:21,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 149.52ms. Allocated memory is still 194.0MB. Free memory was 145.2MB in the beginning and 170.5MB in the end (delta: -25.3MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-04-28 14:16:21,512 INFO L158 Benchmark]: Boogie Preprocessor took 16.59ms. Allocated memory is still 194.0MB. Free memory was 170.5MB in the beginning and 169.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 14:16:21,512 INFO L158 Benchmark]: RCFGBuilder took 176.75ms. Allocated memory is still 194.0MB. Free memory was 168.8MB in the beginning and 158.6MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 14:16:21,512 INFO L158 Benchmark]: TraceAbstraction took 3309.89ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 157.9MB in the beginning and 186.3MB in the end (delta: -28.4MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-04-28 14:16:21,513 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 161.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 149.52ms. Allocated memory is still 194.0MB. Free memory was 145.2MB in the beginning and 170.5MB in the end (delta: -25.3MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.59ms. Allocated memory is still 194.0MB. Free memory was 170.5MB in the beginning and 169.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 176.75ms. Allocated memory is still 194.0MB. Free memory was 168.8MB in the beginning and 158.6MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3309.89ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 157.9MB in the beginning and 186.3MB in the end (delta: -28.4MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 87 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 64 PreInvPairs, 97 NumberOfFragments, 136 HoareAnnotationTreeSize, 64 FomulaSimplifications, 112 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 118 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: !(\old(counter) <= 0) || x * 2 == y + y * y - ProcedureContractResult [Line: 18]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-28 14:16:21,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...