/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:17:51,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:17:51,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:17:51,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:17:51,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:17:51,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:17:51,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:17:51,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:17:51,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:17:51,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:17:51,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:17:51,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:17:51,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:17:51,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:17:51,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:17:52,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:17:52,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:17:52,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:17:52,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:17:52,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:17:52,003 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:17:52,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:17:52,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:17:52,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:17:52,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:17:52,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:17:52,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:17:52,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:17:52,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:17:52,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:17:52,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:17:52,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:17:52,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:17:52,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:17:52,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:17:52,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:17:52,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:17:52,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:17:52,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:17:52,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:17:52,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:17:52,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:17:52,020 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 07:17:52,030 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:17:52,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:17:52,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:17:52,032 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:17:52,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:17:52,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:17:52,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:17:52,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:17:52,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:17:52,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:17:52,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:17:52,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:17:52,033 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:17:52,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:17:52,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:17:52,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:17:52,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:17:52,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:17:52,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:17:52,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:17:52,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:17:52,034 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:17:52,034 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:17:52,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:17:52,035 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:17:52,035 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 07:17:52,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:17:52,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:17:52,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:17:52,234 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:17:52,234 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:17:52,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_valuebound20.c [2022-04-28 07:17:52,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/676ccaa8d/cc184eb1cc664b43b747c61613bdc709/FLAG31cb4f6a3 [2022-04-28 07:17:52,622 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:17:52,623 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_valuebound20.c [2022-04-28 07:17:52,627 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/676ccaa8d/cc184eb1cc664b43b747c61613bdc709/FLAG31cb4f6a3 [2022-04-28 07:17:52,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/676ccaa8d/cc184eb1cc664b43b747c61613bdc709 [2022-04-28 07:17:52,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:17:52,638 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:17:52,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:17:52,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:17:52,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:17:52,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:17:52" (1/1) ... [2022-04-28 07:17:52,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe102a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:17:52, skipping insertion in model container [2022-04-28 07:17:52,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:17:52" (1/1) ... [2022-04-28 07:17:52,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:17:52,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:17:52,768 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/mannadiv_valuebound20.c[573,586] [2022-04-28 07:17:52,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:17:52,800 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:17:52,807 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/mannadiv_valuebound20.c[573,586] [2022-04-28 07:17:52,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:17:52,818 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:17:52,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:17:52 WrapperNode [2022-04-28 07:17:52,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:17:52,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:17:52,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:17:52,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:17:52,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:17:52" (1/1) ... [2022-04-28 07:17:52,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:17:52" (1/1) ... [2022-04-28 07:17:52,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:17:52" (1/1) ... [2022-04-28 07:17:52,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:17:52" (1/1) ... [2022-04-28 07:17:52,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:17:52" (1/1) ... [2022-04-28 07:17:52,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:17:52" (1/1) ... [2022-04-28 07:17:52,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:17:52" (1/1) ... [2022-04-28 07:17:52,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:17:52,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:17:52,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:17:52,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:17:52,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:17:52" (1/1) ... [2022-04-28 07:17:52,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:17:52,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:17:52,888 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 07:17:52,892 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 07:17:52,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:17:52,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:17:52,919 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:17:52,919 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:17:52,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:17:52,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:17:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:17:52,963 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:17:52,964 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:17:53,056 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:17:53,060 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:17:53,060 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:17:53,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:17:53 BoogieIcfgContainer [2022-04-28 07:17:53,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:17:53,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:17:53,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:17:53,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:17:53,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:17:52" (1/3) ... [2022-04-28 07:17:53,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57dd11bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:17:53, skipping insertion in model container [2022-04-28 07:17:53,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:17:52" (2/3) ... [2022-04-28 07:17:53,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57dd11bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:17:53, skipping insertion in model container [2022-04-28 07:17:53,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:17:53" (3/3) ... [2022-04-28 07:17:53,082 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_valuebound20.c [2022-04-28 07:17:53,090 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:17:53,090 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:17:53,125 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:17:53,129 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@18a113c6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58b9fb97 [2022-04-28 07:17:53,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:17:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:17:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 07:17:53,158 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:17:53,159 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:17:53,159 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:17:53,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:17:53,162 INFO L85 PathProgramCache]: Analyzing trace with hash -786972844, now seen corresponding path program 1 times [2022-04-28 07:17:53,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:17:53,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1081899448] [2022-04-28 07:17:53,174 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:17:53,174 INFO L85 PathProgramCache]: Analyzing trace with hash -786972844, now seen corresponding path program 2 times [2022-04-28 07:17:53,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:17:53,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839541220] [2022-04-28 07:17:53,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:17:53,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:17:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:17:53,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:17:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:17:53,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 07:17:53,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:17:53,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #66#return; {32#true} is VALID [2022-04-28 07:17:53,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:17:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:17:53,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:17:53,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:17:53,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:17:53,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-28 07:17:53,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 07:17:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:17:53,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:17:53,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:17:53,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:17:53,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #60#return; {33#false} is VALID [2022-04-28 07:17:53,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 07:17:53,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 07:17:53,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:17:53,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #66#return; {32#true} is VALID [2022-04-28 07:17:53,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 07:17:53,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {32#true} is VALID [2022-04-28 07:17:53,346 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {32#true} is VALID [2022-04-28 07:17:53,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:17:53,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:17:53,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:17:53,347 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-28 07:17:53,347 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {32#true} is VALID [2022-04-28 07:17:53,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:17:53,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:17:53,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:17:53,348 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #60#return; {33#false} is VALID [2022-04-28 07:17:53,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {33#false} is VALID [2022-04-28 07:17:53,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-28 07:17:53,349 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {33#false} is VALID [2022-04-28 07:17:53,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 07:17:53,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 07:17:53,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 07:17:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:17:53,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:17:53,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839541220] [2022-04-28 07:17:53,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839541220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:17:53,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:17:53,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:17:53,352 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:17:53,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1081899448] [2022-04-28 07:17:53,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1081899448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:17:53,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:17:53,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:17:53,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227153247] [2022-04-28 07:17:53,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:17:53,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 07:17:53,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:17:53,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:17:53,379 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 07:17:53,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:17:53,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:17:53,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:17:53,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:17:53,394 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:17:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:17:53,471 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 07:17:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:17:53,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 07:17:53,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:17:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:17:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-28 07:17:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:17:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-28 07:17:53,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2022-04-28 07:17:53,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:17:53,570 INFO L225 Difference]: With dead ends: 51 [2022-04-28 07:17:53,570 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 07:17:53,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:17:53,575 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:17:53,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:17:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 07:17:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 07:17:53,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:17:53,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:17:53,598 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:17:53,598 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:17:53,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:17:53,601 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 07:17:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:17:53,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:17:53,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:17:53,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-28 07:17:53,603 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-28 07:17:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:17:53,611 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 07:17:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:17:53,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:17:53,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:17:53,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:17:53,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:17:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 07:17:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 07:17:53,615 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-28 07:17:53,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:17:53,616 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 07:17:53,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:17:53,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 07:17:53,649 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 07:17:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:17:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 07:17:53,649 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:17:53,650 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:17:53,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:17:53,650 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:17:53,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:17:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1131020600, now seen corresponding path program 1 times [2022-04-28 07:17:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:17:53,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2138062271] [2022-04-28 07:17:53,651 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:17:53,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1131020600, now seen corresponding path program 2 times [2022-04-28 07:17:53,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:17:53,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125169333] [2022-04-28 07:17:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:17:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:17:53,665 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:17:53,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725597503] [2022-04-28 07:17:53,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:17:53,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:17:53,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:17:53,667 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 07:17:53,696 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 07:17:53,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:17:53,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:17:53,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 07:17:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:17:53,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:17:56,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-28 07:17:56,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-04-28 07:17:56,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:17:56,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #66#return; {246#true} is VALID [2022-04-28 07:17:56,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret6 := main(); {246#true} is VALID [2022-04-28 07:17:56,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {246#true} is VALID [2022-04-28 07:17:56,701 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {246#true} is VALID [2022-04-28 07:17:56,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 07:17:56,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 07:17:56,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:17:56,702 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #58#return; {246#true} is VALID [2022-04-28 07:17:56,702 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {246#true} is VALID [2022-04-28 07:17:56,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 07:17:56,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 07:17:56,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:17:56,703 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #60#return; {246#true} is VALID [2022-04-28 07:17:56,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {299#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 07:17:56,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} assume !false; {299#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 07:17:56,707 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:17:56,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:17:56,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-28 07:17:56,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-28 07:17:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:17:56,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:17:56,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:17:56,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125169333] [2022-04-28 07:17:56,709 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:17:56,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725597503] [2022-04-28 07:17:56,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725597503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:17:56,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:17:56,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:17:56,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:17:56,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2138062271] [2022-04-28 07:17:56,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2138062271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:17:56,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:17:56,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:17:56,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424052328] [2022-04-28 07:17:56,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:17:56,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 07:17:56,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:17:56,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:17:56,729 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 07:17:56,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:17:56,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:17:56,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:17:56,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:17:56,733 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:17:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:17:56,862 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-28 07:17:56,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:17:56,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 07:17:56,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:17:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:17:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 07:17:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:17:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 07:17:56,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-28 07:17:56,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:17:56,902 INFO L225 Difference]: With dead ends: 35 [2022-04-28 07:17:56,903 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 07:17:56,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 07:17:56,904 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:17:56,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 75 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:17:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 07:17:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-04-28 07:17:56,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:17:56,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:17:56,920 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:17:56,921 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:17:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:17:56,925 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-28 07:17:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-28 07:17:56,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:17:56,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:17:56,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-28 07:17:56,929 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-28 07:17:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:17:56,935 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-28 07:17:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-28 07:17:56,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:17:56,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:17:56,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:17:56,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:17:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:17:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-28 07:17:56,945 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2022-04-28 07:17:56,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:17:56,945 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-28 07:17:56,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:17:56,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions. [2022-04-28 07:17:56,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:17:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-28 07:17:56,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 07:17:56,977 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:17:56,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:17:56,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 07:17:57,191 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 07:17:57,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:17:57,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:17:57,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1991967029, now seen corresponding path program 1 times [2022-04-28 07:17:57,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:17:57,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [449516168] [2022-04-28 07:17:57,193 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:17:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1991967029, now seen corresponding path program 2 times [2022-04-28 07:17:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:17:57,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884089896] [2022-04-28 07:17:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:17:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:17:57,209 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:17:57,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2077854161] [2022-04-28 07:17:57,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:17:57,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:17:57,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:17:57,217 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 07:17:57,218 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 07:17:57,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:17:57,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:17:57,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 07:17:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:17:57,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:17:57,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2022-04-28 07:17:57,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {514#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {514#true} is VALID [2022-04-28 07:17:57,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-28 07:17:57,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #66#return; {514#true} is VALID [2022-04-28 07:17:57,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret6 := main(); {514#true} is VALID [2022-04-28 07:17:57,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {514#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {514#true} is VALID [2022-04-28 07:17:57,412 INFO L272 TraceCheckUtils]: 6: Hoare triple {514#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {514#true} is VALID [2022-04-28 07:17:57,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2022-04-28 07:17:57,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2022-04-28 07:17:57,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-28 07:17:57,413 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {514#true} {514#true} #58#return; {514#true} is VALID [2022-04-28 07:17:57,413 INFO L272 TraceCheckUtils]: 11: Hoare triple {514#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {514#true} is VALID [2022-04-28 07:17:57,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2022-04-28 07:17:57,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2022-04-28 07:17:57,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-28 07:17:57,414 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {514#true} {514#true} #60#return; {514#true} is VALID [2022-04-28 07:17:57,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {514#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {514#true} is VALID [2022-04-28 07:17:57,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {514#true} assume !false; {514#true} is VALID [2022-04-28 07:17:57,414 INFO L272 TraceCheckUtils]: 18: Hoare triple {514#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {514#true} is VALID [2022-04-28 07:17:57,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {514#true} ~cond := #in~cond; {576#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:17:57,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {576#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:17:57,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {580#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:17:57,418 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {580#(not (= |__VERIFIER_assert_#in~cond| 0))} {514#true} #62#return; {587#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-28 07:17:57,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} assume !(0 != ~y3~0); {591#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-28 07:17:57,420 INFO L272 TraceCheckUtils]: 24: Hoare triple {591#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:17:57,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:17:57,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {515#false} is VALID [2022-04-28 07:17:57,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {515#false} assume !false; {515#false} is VALID [2022-04-28 07:17:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:17:57,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:18:01,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {515#false} assume !false; {515#false} is VALID [2022-04-28 07:18:01,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {515#false} is VALID [2022-04-28 07:18:01,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:18:01,792 INFO L272 TraceCheckUtils]: 24: Hoare triple {591#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:18:01,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {618#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} assume !(0 != ~y3~0); {591#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-28 07:18:01,793 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {580#(not (= |__VERIFIER_assert_#in~cond| 0))} {514#true} #62#return; {618#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-28 07:18:01,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {580#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:18:01,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {631#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:18:01,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {514#true} ~cond := #in~cond; {631#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 07:18:01,795 INFO L272 TraceCheckUtils]: 18: Hoare triple {514#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {514#true} is VALID [2022-04-28 07:18:01,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {514#true} assume !false; {514#true} is VALID [2022-04-28 07:18:01,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {514#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {514#true} is VALID [2022-04-28 07:18:01,795 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {514#true} {514#true} #60#return; {514#true} is VALID [2022-04-28 07:18:01,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-28 07:18:01,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2022-04-28 07:18:01,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2022-04-28 07:18:01,796 INFO L272 TraceCheckUtils]: 11: Hoare triple {514#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {514#true} is VALID [2022-04-28 07:18:01,796 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {514#true} {514#true} #58#return; {514#true} is VALID [2022-04-28 07:18:01,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-28 07:18:01,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2022-04-28 07:18:01,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2022-04-28 07:18:01,796 INFO L272 TraceCheckUtils]: 6: Hoare triple {514#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {514#true} is VALID [2022-04-28 07:18:01,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {514#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {514#true} is VALID [2022-04-28 07:18:01,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret6 := main(); {514#true} is VALID [2022-04-28 07:18:01,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #66#return; {514#true} is VALID [2022-04-28 07:18:01,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-28 07:18:01,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {514#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {514#true} is VALID [2022-04-28 07:18:01,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2022-04-28 07:18:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:18:01,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:18:01,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884089896] [2022-04-28 07:18:01,797 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:18:01,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077854161] [2022-04-28 07:18:01,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077854161] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:18:01,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:18:01,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 07:18:01,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:18:01,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [449516168] [2022-04-28 07:18:01,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [449516168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:18:01,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:18:01,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:18:01,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400771267] [2022-04-28 07:18:01,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:18:01,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 07:18:01,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:18:01,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:18:01,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:18:01,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:18:01,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:18:01,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:18:01,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:18:01,817 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:18:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:18:01,972 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-28 07:18:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 07:18:01,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 07:18:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:18:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:18:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-28 07:18:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:18:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-28 07:18:01,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-28 07:18:01,994 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 07:18:01,994 INFO L225 Difference]: With dead ends: 30 [2022-04-28 07:18:01,994 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 07:18:01,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:18:01,995 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:18:01,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 101 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:18:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 07:18:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 07:18:01,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:18:01,996 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 07:18:01,996 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 07:18:01,996 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 07:18:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:18:01,996 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 07:18:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:18:02,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:18:02,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:18:02,015 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 07:18:02,015 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 07:18:02,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:18:02,015 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 07:18:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:18:02,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:18:02,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:18:02,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:18:02,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:18:02,016 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 07:18:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 07:18:02,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-28 07:18:02,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:18:02,016 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 07:18:02,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:18:02,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 07:18:02,016 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 07:18:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:18:02,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:18:02,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 07:18:02,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 07:18:02,234 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 07:18:02,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 07:18:02,329 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 9) no Hoare annotation was computed. [2022-04-28 07:18:02,330 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 9) no Hoare annotation was computed. [2022-04-28 07:18:02,330 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 9) no Hoare annotation was computed. [2022-04-28 07:18:02,330 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-04-28 07:18:02,330 INFO L902 garLoopResultBuilder]: At program point L13(line 13) the Hoare annotation is: true [2022-04-28 07:18:02,330 INFO L902 garLoopResultBuilder]: At program point L13-2(lines 12 14) the Hoare annotation is: true [2022-04-28 07:18:02,330 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 12 14) the Hoare annotation is: true [2022-04-28 07:18:02,330 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 48) the Hoare annotation is: (let ((.cse0 (* main_~x2~0 main_~y1~0))) (and (= (+ .cse0 main_~y3~0 main_~y2~0) main_~x1~0) (= (+ .cse0 main_~y2~0) main_~x1~0))) [2022-04-28 07:18:02,330 INFO L902 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-28 07:18:02,330 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 51) the Hoare annotation is: true [2022-04-28 07:18:02,330 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 51) the Hoare annotation is: true [2022-04-28 07:18:02,331 INFO L895 garLoopResultBuilder]: At program point L40(lines 40 47) the Hoare annotation is: (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0) [2022-04-28 07:18:02,331 INFO L895 garLoopResultBuilder]: At program point L40-2(lines 35 48) the Hoare annotation is: (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0) [2022-04-28 07:18:02,331 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0) [2022-04-28 07:18:02,331 INFO L895 garLoopResultBuilder]: At program point L36-1(lines 35 48) the Hoare annotation is: (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0) [2022-04-28 07:18:02,331 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 51) the Hoare annotation is: true [2022-04-28 07:18:02,331 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-28 07:18:02,331 INFO L902 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: true [2022-04-28 07:18:02,331 INFO L902 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: true [2022-04-28 07:18:02,331 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 07:18:02,331 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 07:18:02,331 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 07:18:02,332 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 07:18:02,332 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 07:18:02,332 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 07:18:02,332 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 07:18:02,332 INFO L895 garLoopResultBuilder]: At program point L17(lines 17 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 07:18:02,332 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 07:18:02,332 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-04-28 07:18:02,332 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 15 21) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 07:18:02,332 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 15 21) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 07:18:02,332 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 07:18:02,334 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-28 07:18:02,336 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 07:18:02,342 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 07:18:02,344 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 07:18:02,350 INFO L163 areAnnotationChecker]: CFG has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 07:18:02,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 07:18:02 BoogieIcfgContainer [2022-04-28 07:18:02,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 07:18:02,359 INFO L158 Benchmark]: Toolchain (without parser) took 9720.94ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 153.2MB in the beginning and 207.0MB in the end (delta: -53.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 07:18:02,359 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory is still 169.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 07:18:02,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.39ms. Allocated memory is still 199.2MB. Free memory was 153.1MB in the beginning and 178.2MB in the end (delta: -25.1MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-04-28 07:18:02,361 INFO L158 Benchmark]: Boogie Preprocessor took 19.72ms. Allocated memory is still 199.2MB. Free memory was 178.2MB in the beginning and 176.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 07:18:02,361 INFO L158 Benchmark]: RCFGBuilder took 221.69ms. Allocated memory is still 199.2MB. Free memory was 176.3MB in the beginning and 166.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 07:18:02,362 INFO L158 Benchmark]: TraceAbstraction took 9284.72ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 165.6MB in the beginning and 207.0MB in the end (delta: -41.4MB). Peak memory consumption was 25.2kB. Max. memory is 8.0GB. [2022-04-28 07:18:02,363 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.09ms. Allocated memory is still 199.2MB. Free memory is still 169.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.39ms. Allocated memory is still 199.2MB. Free memory was 153.1MB in the beginning and 178.2MB in the end (delta: -25.1MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.72ms. Allocated memory is still 199.2MB. Free memory was 178.2MB in the beginning and 176.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 221.69ms. Allocated memory is still 199.2MB. Free memory was 176.3MB in the beginning and 166.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9284.72ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 165.6MB in the beginning and 207.0MB in the end (delta: -41.4MB). Peak memory consumption was 25.2kB. 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: 18]: 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 67 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 61 PreInvPairs, 87 NumberOfFragments, 105 HoareAnnotationTreeSize, 61 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 98 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: 35]: Loop Invariant Derived loop invariant: x2 * y1 + y3 + y2 == x1 - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 07:18:02,380 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...