/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/loop-invariants/eq1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:05:28,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:05:28,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:05:28,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:05:28,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:05:28,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:05:28,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:05:28,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:05:28,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:05:28,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:05:28,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:05:28,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:05:28,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:05:28,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:05:28,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:05:28,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:05:28,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:05:28,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:05:28,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:05:28,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:05:28,835 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:05:28,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:05:28,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:05:28,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:05:28,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:05:28,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:05:28,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:05:28,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:05:28,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:05:28,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:05:28,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:05:28,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:05:28,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:05:28,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:05:28,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:05:28,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:05:28,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:05:28,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:05:28,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:05:28,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:05:28,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:05:28,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:05:28,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:05:28,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:05:28,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:05:28,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:05:28,858 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:05:28,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:05:28,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:05:28,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:05:28,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:05:28,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:05:28,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:05:28,859 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:05:28,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:05:28,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:05:28,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:05:28,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:05:28,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:05:28,860 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:05:28,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:05:28,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:05:28,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:05:28,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:05:28,860 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:05:28,860 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:05:28,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:05:28,861 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:05:28,861 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:05:29,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:05:29,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:05:29,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:05:29,063 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:05:29,066 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:05:29,067 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/eq1.c [2022-04-28 04:05:29,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d92a8dd4/2d9eda2ce97440e5b963022620a466f9/FLAGbcd383512 [2022-04-28 04:05:29,484 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:05:29,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/eq1.c [2022-04-28 04:05:29,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d92a8dd4/2d9eda2ce97440e5b963022620a466f9/FLAGbcd383512 [2022-04-28 04:05:29,500 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d92a8dd4/2d9eda2ce97440e5b963022620a466f9 [2022-04-28 04:05:29,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:05:29,504 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:05:29,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:05:29,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:05:29,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:05:29,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:05:29" (1/1) ... [2022-04-28 04:05:29,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8bb2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:29, skipping insertion in model container [2022-04-28 04:05:29,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:05:29" (1/1) ... [2022-04-28 04:05:29,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:05:29,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:05:29,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/eq1.c[364,377] [2022-04-28 04:05:29,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:05:29,690 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:05:29,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/eq1.c[364,377] [2022-04-28 04:05:29,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:05:29,717 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:05:29,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:29 WrapperNode [2022-04-28 04:05:29,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:05:29,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:05:29,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:05:29,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:05:29,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:29" (1/1) ... [2022-04-28 04:05:29,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:29" (1/1) ... [2022-04-28 04:05:29,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:29" (1/1) ... [2022-04-28 04:05:29,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:29" (1/1) ... [2022-04-28 04:05:29,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:29" (1/1) ... [2022-04-28 04:05:29,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:29" (1/1) ... [2022-04-28 04:05:29,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:29" (1/1) ... [2022-04-28 04:05:29,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:05:29,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:05:29,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:05:29,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:05:29,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:29" (1/1) ... [2022-04-28 04:05:29,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:05:29,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:05:29,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:05:29,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:05:29,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:05:29,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:05:29,804 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:05:29,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:05:29,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:05:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:05:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:05:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:05:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:05:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 04:05:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:05:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:05:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:05:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:05:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:05:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:05:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:05:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:05:29,851 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:05:29,852 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:05:29,927 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:05:29,931 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:05:29,931 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:05:29,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:05:29 BoogieIcfgContainer [2022-04-28 04:05:29,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:05:29,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:05:29,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:05:29,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:05:29,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:05:29" (1/3) ... [2022-04-28 04:05:29,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8981ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:05:29, skipping insertion in model container [2022-04-28 04:05:29,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:29" (2/3) ... [2022-04-28 04:05:29,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8981ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:05:29, skipping insertion in model container [2022-04-28 04:05:29,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:05:29" (3/3) ... [2022-04-28 04:05:29,937 INFO L111 eAbstractionObserver]: Analyzing ICFG eq1.c [2022-04-28 04:05:29,946 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:05:29,946 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:05:29,972 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:05:29,976 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@2471659d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@694fed92 [2022-04-28 04:05:29,976 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:05:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:05:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 04:05:29,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:29,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:29,985 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1706373939, now seen corresponding path program 1 times [2022-04-28 04:05:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:29,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [682726971] [2022-04-28 04:05:30,001 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:05:30,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1706373939, now seen corresponding path program 2 times [2022-04-28 04:05:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:30,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465130394] [2022-04-28 04:05:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:30,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:30,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:30,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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(6, 2);call write~init~int(101, 2, 0, 1);call write~init~int(113, 2, 1, 1);call write~init~int(49, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 04:05:30,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 04:05:30,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #43#return; {23#true} is VALID [2022-04-28 04:05:30,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:05:30,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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(6, 2);call write~init~int(101, 2, 0, 1);call write~init~int(113, 2, 1, 1);call write~init~int(49, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 04:05:30,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 04:05:30,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #43#return; {23#true} is VALID [2022-04-28 04:05:30,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret12 := main(); {23#true} is VALID [2022-04-28 04:05:30,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~w~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~w~0;~y~0 := #t~nondet5;havoc #t~nondet5;~z~0 := ~y~0; {23#true} is VALID [2022-04-28 04:05:30,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-28 04:05:30,186 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~w~0 % 4294967296 == ~x~0 % 4294967296 && ~y~0 % 4294967296 == ~z~0 % 4294967296 then 1 else 0)); {24#false} is VALID [2022-04-28 04:05:30,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 04:05:30,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 04:05:30,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 04:05:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:05:30,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:30,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465130394] [2022-04-28 04:05:30,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465130394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:30,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:30,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:05:30,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:05:30,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [682726971] [2022-04-28 04:05:30,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [682726971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:30,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:30,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:05:30,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024447834] [2022-04-28 04:05:30,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:05:30,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:05:30,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:05:30,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:30,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:05:30,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:30,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:05:30,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:05:30,247 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:30,329 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 04:05:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:05:30,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:05:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:05:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-28 04:05:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-28 04:05:30,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-28 04:05:30,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:30,393 INFO L225 Difference]: With dead ends: 32 [2022-04-28 04:05:30,394 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 04:05:30,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:05:30,400 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:05:30,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:05:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 04:05:30,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 04:05:30,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:05:30,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,425 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,425 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:30,430 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 04:05:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 04:05:30,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:30,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:30,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 04:05:30,431 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 04:05:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:30,434 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 04:05:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 04:05:30,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:30,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:30,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:05:30,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:05:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-28 04:05:30,437 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-28 04:05:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:05:30,437 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-28 04:05:30,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-28 04:05:30,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 04:05:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 04:05:30,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:30,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:30,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:05:30,468 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1697138729, now seen corresponding path program 1 times [2022-04-28 04:05:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:30,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063430405] [2022-04-28 04:05:30,472 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:05:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1697138729, now seen corresponding path program 2 times [2022-04-28 04:05:30,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:30,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409539845] [2022-04-28 04:05:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:30,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:30,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:30,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {155#(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(6, 2);call write~init~int(101, 2, 0, 1);call write~init~int(113, 2, 1, 1);call write~init~int(49, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-28 04:05:30,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-28 04:05:30,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147#true} {147#true} #43#return; {147#true} is VALID [2022-04-28 04:05:30,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:05:30,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#(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(6, 2);call write~init~int(101, 2, 0, 1);call write~init~int(113, 2, 1, 1);call write~init~int(49, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-28 04:05:30,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-28 04:05:30,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #43#return; {147#true} is VALID [2022-04-28 04:05:30,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret12 := main(); {147#true} is VALID [2022-04-28 04:05:30,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#true} ~w~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~w~0;~y~0 := #t~nondet5;havoc #t~nondet5;~z~0 := ~y~0; {152#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= 0 (+ main_~w~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 04:05:30,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= 0 (+ main_~w~0 (* (- 1) main_~x~0))))} assume !(0 != #t~nondet6 % 4294967296);havoc #t~nondet6; {152#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= 0 (+ main_~w~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 04:05:30,626 INFO L272 TraceCheckUtils]: 7: Hoare triple {152#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= 0 (+ main_~w~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~w~0 % 4294967296 == ~x~0 % 4294967296 && ~y~0 % 4294967296 == ~z~0 % 4294967296 then 1 else 0)); {153#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:05:30,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {153#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {154#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:05:30,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {154#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {148#false} is VALID [2022-04-28 04:05:30,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-04-28 04:05:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:05:30,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:30,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409539845] [2022-04-28 04:05:30,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409539845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:30,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:30,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:05:30,628 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:05:30,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1063430405] [2022-04-28 04:05:30,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1063430405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:30,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:30,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:05:30,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89472645] [2022-04-28 04:05:30,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:05:30,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:05:30,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:05:30,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:30,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:05:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:30,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:05:30,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:05:30,639 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:30,748 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 04:05:30,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:05:30,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:05:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:05:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2022-04-28 04:05:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2022-04-28 04:05:30,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 14 transitions. [2022-04-28 04:05:30,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:30,776 INFO L225 Difference]: With dead ends: 13 [2022-04-28 04:05:30,776 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 04:05:30,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:05:30,777 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:05:30,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:05:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 04:05:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 04:05:30,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:05:30,779 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 04:05:30,779 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 04:05:30,779 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 04:05:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:30,779 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:05:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:05:30,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:30,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:30,780 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 04:05:30,780 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 04:05:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:30,780 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:05:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:05:30,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:30,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:30,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:05:30,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:05:30,780 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 04:05:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 04:05:30,781 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-04-28 04:05:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:05:30,781 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 04:05:30,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:05:30,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 04:05:30,781 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 04:05:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:05:30,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:30,783 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:05:30,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:05:30,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 04:05:30,845 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 04:05:30,845 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 04:05:30,845 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 04:05:30,845 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 11 25) the Hoare annotation is: true [2022-04-28 04:05:30,845 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 11 25) the Hoare annotation is: true [2022-04-28 04:05:30,845 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-28 04:05:30,845 INFO L895 garLoopResultBuilder]: At program point L17(lines 17 21) the Hoare annotation is: (and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= 0 (+ main_~w~0 (* (- 1) main_~x~0)))) [2022-04-28 04:05:30,845 INFO L895 garLoopResultBuilder]: At program point L17-2(lines 16 22) the Hoare annotation is: (and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= 0 (+ main_~w~0 (* (- 1) main_~x~0)))) [2022-04-28 04:05:30,846 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 16 22) the Hoare annotation is: (and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= 0 (+ main_~w~0 (* (- 1) main_~x~0)))) [2022-04-28 04:05:30,846 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 11 25) the Hoare annotation is: true [2022-04-28 04:05:30,846 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:05:30,846 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 04:05:30,846 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:05:30,846 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:05:30,846 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 04:05:30,846 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:05:30,846 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:05:30,846 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-28 04:05:30,847 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-28 04:05:30,847 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 04:05:30,847 INFO L895 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 04:05:30,847 INFO L902 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-28 04:05:30,847 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 04:05:30,856 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-28 04:05:30,857 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 04:05:30,860 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:05:30,861 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 04:05:30,864 INFO L163 areAnnotationChecker]: CFG has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 04:05:30,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:05:30 BoogieIcfgContainer [2022-04-28 04:05:30,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 04:05:30,871 INFO L158 Benchmark]: Toolchain (without parser) took 1366.98ms. Allocated memory is still 185.6MB. Free memory was 136.8MB in the beginning and 87.3MB in the end (delta: 49.6MB). Peak memory consumption was 49.8MB. Max. memory is 8.0GB. [2022-04-28 04:05:30,871 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 152.9MB in the beginning and 152.7MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:05:30,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.21ms. Allocated memory is still 185.6MB. Free memory was 136.5MB in the beginning and 162.2MB in the end (delta: -25.7MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-28 04:05:30,872 INFO L158 Benchmark]: Boogie Preprocessor took 33.83ms. Allocated memory is still 185.6MB. Free memory was 162.2MB in the beginning and 161.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:05:30,872 INFO L158 Benchmark]: RCFGBuilder took 179.59ms. Allocated memory is still 185.6MB. Free memory was 161.2MB in the beginning and 150.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 04:05:30,873 INFO L158 Benchmark]: TraceAbstraction took 936.48ms. Allocated memory is still 185.6MB. Free memory was 150.2MB in the beginning and 87.3MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2022-04-28 04:05:30,874 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 185.6MB. Free memory was 152.9MB in the beginning and 152.7MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.21ms. Allocated memory is still 185.6MB. Free memory was 136.5MB in the beginning and 162.2MB in the end (delta: -25.7MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.83ms. Allocated memory is still 185.6MB. Free memory was 162.2MB in the beginning and 161.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 179.59ms. Allocated memory is still 185.6MB. Free memory was 161.2MB in the beginning and 150.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 936.48ms. Allocated memory is still 185.6MB. Free memory was 150.2MB in the beginning and 87.3MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. 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: 7]: 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 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 29 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 26 PreInvPairs, 34 NumberOfFragments, 79 HoareAnnotationTreeSize, 26 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.0s 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: 16]: Loop Invariant Derived loop invariant: y + -1 * z == 0 && 0 == w + -1 * x - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 04:05:30,900 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...