/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/while_infinite_loop_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:12:23,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:12:23,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:12:23,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:12:23,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:12:23,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:12:23,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:12:23,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:12:23,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:12:23,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:12:23,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:12:23,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:12:23,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:12:23,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:12:23,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:12:23,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:12:23,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:12:23,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:12:23,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:12:23,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:12:23,902 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:12:23,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:12:23,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:12:23,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:12:23,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:12:23,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:12:23,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:12:23,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:12:23,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:12:23,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:12:23,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:12:23,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:12:23,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:12:23,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:12:23,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:12:23,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:12:23,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:12:23,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:12:23,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:12:23,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:12:23,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:12:23,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:12:23,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:12:23,928 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:12:23,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:12:23,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:12:23,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:12:23,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:12:23,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:12:23,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:12:23,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:12:23,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:12:23,929 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:12:23,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:12:23,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:12:23,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:12:23,930 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:12:23,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:12:23,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:12:23,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:12:23,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:12:23,931 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:12:23,931 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:12:23,931 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:12:23,931 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:12:23,931 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 09:12:24,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:12:24,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:12:24,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:12:24,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:12:24,142 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:12:24,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/while_infinite_loop_3.c [2022-04-28 09:12:24,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5281b191/f99e36d8d2fc40bdbb8f6858f6b5bdb6/FLAG2c1141b12 [2022-04-28 09:12:24,523 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:12:24,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/while_infinite_loop_3.c [2022-04-28 09:12:24,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5281b191/f99e36d8d2fc40bdbb8f6858f6b5bdb6/FLAG2c1141b12 [2022-04-28 09:12:24,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5281b191/f99e36d8d2fc40bdbb8f6858f6b5bdb6 [2022-04-28 09:12:24,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:12:24,537 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:12:24,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:12:24,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:12:24,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:12:24,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:12:24" (1/1) ... [2022-04-28 09:12:24,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c859d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:24, skipping insertion in model container [2022-04-28 09:12:24,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:12:24" (1/1) ... [2022-04-28 09:12:24,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:12:24,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:12:24,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/while_infinite_loop_3.c[333,346] [2022-04-28 09:12:24,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:12:24,711 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:12:24,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/while_infinite_loop_3.c[333,346] [2022-04-28 09:12:24,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:12:24,736 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:12:24,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:24 WrapperNode [2022-04-28 09:12:24,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:12:24,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:12:24,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:12:24,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:12:24,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:24" (1/1) ... [2022-04-28 09:12:24,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:24" (1/1) ... [2022-04-28 09:12:24,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:24" (1/1) ... [2022-04-28 09:12:24,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:24" (1/1) ... [2022-04-28 09:12:24,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:24" (1/1) ... [2022-04-28 09:12:24,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:24" (1/1) ... [2022-04-28 09:12:24,764 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:24" (1/1) ... [2022-04-28 09:12:24,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:12:24,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:12:24,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:12:24,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:12:24,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:24" (1/1) ... [2022-04-28 09:12:24,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:12:24,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:12:24,789 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 09:12:24,791 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 09:12:24,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:12:24,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:12:24,813 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:12:24,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:12:24,813 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2022-04-28 09:12:24,814 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:12:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:12:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:12:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:12:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:12:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:12:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2022-04-28 09:12:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:12:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:12:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:12:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:12:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:12:24,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:12:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:12:24,852 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:12:24,853 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:12:24,974 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:12:24,978 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:12:24,978 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 09:12:24,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:12:24 BoogieIcfgContainer [2022-04-28 09:12:24,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:12:24,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:12:24,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:12:24,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:12:24,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:12:24" (1/3) ... [2022-04-28 09:12:24,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9eacbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:12:24, skipping insertion in model container [2022-04-28 09:12:24,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:12:24" (2/3) ... [2022-04-28 09:12:24,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9eacbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:12:24, skipping insertion in model container [2022-04-28 09:12:24,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:12:24" (3/3) ... [2022-04-28 09:12:24,999 INFO L111 eAbstractionObserver]: Analyzing ICFG while_infinite_loop_3.c [2022-04-28 09:12:25,008 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:12:25,009 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:12:25,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:12:25,054 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@196741cc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@214fd7cf [2022-04-28 09:12:25,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:12:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:12:25,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-28 09:12:25,065 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:12:25,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:12:25,066 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:12:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:12:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1499484955, now seen corresponding path program 1 times [2022-04-28 09:12:25,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:25,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [976966777] [2022-04-28 09:12:25,106 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:12:25,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1499484955, now seen corresponding path program 2 times [2022-04-28 09:12:25,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:12:25,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514769408] [2022-04-28 09:12:25,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:12:25,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:12:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:25,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:12:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:25,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3);~x~0 := 0; {26#true} is VALID [2022-04-28 09:12:25,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 09:12:25,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #53#return; {26#true} is VALID [2022-04-28 09:12:25,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:12:25,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3);~x~0 := 0; {26#true} is VALID [2022-04-28 09:12:25,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 09:12:25,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #53#return; {26#true} is VALID [2022-04-28 09:12:25,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret4 := main(); {26#true} is VALID [2022-04-28 09:12:25,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} assume false; {27#false} is VALID [2022-04-28 09:12:25,276 INFO L272 TraceCheckUtils]: 6: Hoare triple {27#false} call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); {27#false} is VALID [2022-04-28 09:12:25,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-28 09:12:25,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-28 09:12:25,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-28 09:12:25,277 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 09:12:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:12:25,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514769408] [2022-04-28 09:12:25,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514769408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:25,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:12:25,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:12:25,283 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:12:25,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [976966777] [2022-04-28 09:12:25,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [976966777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:25,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:12:25,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:12:25,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300787518] [2022-04-28 09:12:25,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:12:25,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 10 [2022-04-28 09:12:25,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:12:25,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 09:12:25,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:25,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:12:25,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:25,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:12:25,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:12:25,340 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 09:12:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:25,430 INFO L93 Difference]: Finished difference Result 37 states and 53 transitions. [2022-04-28 09:12:25,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:12:25,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 10 [2022-04-28 09:12:25,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:12:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 09:12:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-28 09:12:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 09:12:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-28 09:12:25,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-04-28 09:12:25,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:25,540 INFO L225 Difference]: With dead ends: 37 [2022-04-28 09:12:25,540 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 09:12:25,542 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 09:12:25,546 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:12:25,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:12:25,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 09:12:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-04-28 09:12:25,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:12:25,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:12:25,572 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:12:25,572 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:12:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:25,575 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-28 09:12:25,575 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 09:12:25,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:25,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:25,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-28 09:12:25,576 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 19 states. [2022-04-28 09:12:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:25,577 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-28 09:12:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 09:12:25,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:25,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:25,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:12:25,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:12:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:12:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 09:12:25,593 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2022-04-28 09:12:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:12:25,594 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 09:12:25,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 09:12:25,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 09:12:25,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:12:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:12:25,609 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:12:25,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:12:25,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:12:25,610 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:12:25,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:12:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1713498874, now seen corresponding path program 1 times [2022-04-28 09:12:25,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:25,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [92468298] [2022-04-28 09:12:25,611 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:12:25,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1713498874, now seen corresponding path program 2 times [2022-04-28 09:12:25,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:12:25,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625355089] [2022-04-28 09:12:25,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:12:25,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:12:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:25,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:12:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:25,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3);~x~0 := 0; {180#true} is VALID [2022-04-28 09:12:25,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-28 09:12:25,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #53#return; {180#true} is VALID [2022-04-28 09:12:25,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 09:12:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:12:25,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {192#(= ~x~0 |old(~x~0)|)} assume !false;~x~0 := 0; {188#(= ~x~0 0)} is VALID [2022-04-28 09:12:25,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#(= ~x~0 0)} assume true; {188#(= ~x~0 0)} is VALID [2022-04-28 09:12:25,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {188#(= ~x~0 0)} {180#true} #47#return; {188#(= ~x~0 0)} is VALID [2022-04-28 09:12:25,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {191#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:12:25,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#(and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3);~x~0 := 0; {180#true} is VALID [2022-04-28 09:12:25,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-28 09:12:25,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #53#return; {180#true} is VALID [2022-04-28 09:12:25,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret4 := main(); {180#true} is VALID [2022-04-28 09:12:25,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume !false; {180#true} is VALID [2022-04-28 09:12:25,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {180#true} call eval(); {192#(= ~x~0 |old(~x~0)|)} is VALID [2022-04-28 09:12:25,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#(= ~x~0 |old(~x~0)|)} assume !false;~x~0 := 0; {188#(= ~x~0 0)} is VALID [2022-04-28 09:12:25,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {188#(= ~x~0 0)} assume true; {188#(= ~x~0 0)} is VALID [2022-04-28 09:12:25,720 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {188#(= ~x~0 0)} {180#true} #47#return; {188#(= ~x~0 0)} is VALID [2022-04-28 09:12:25,721 INFO L272 TraceCheckUtils]: 10: Hoare triple {188#(= ~x~0 0)} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {189#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:12:25,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {189#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {190#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:12:25,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {190#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {181#false} is VALID [2022-04-28 09:12:25,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-28 09:12:25,722 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 09:12:25,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:12:25,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625355089] [2022-04-28 09:12:25,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625355089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:25,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:12:25,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:12:25,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:12:25,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [92468298] [2022-04-28 09:12:25,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [92468298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:12:25,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:12:25,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:12:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184738079] [2022-04-28 09:12:25,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:12:25,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-28 09:12:25,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:12:25,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 09:12:25,738 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 09:12:25,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:12:25,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:12:25,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:12:25,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:12:25,739 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 09:12:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:25,857 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 09:12:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:12:25,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-28 09:12:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:12:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 09:12:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-04-28 09:12:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 09:12:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-04-28 09:12:25,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 17 transitions. [2022-04-28 09:12:25,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:12:25,874 INFO L225 Difference]: With dead ends: 17 [2022-04-28 09:12:25,874 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:12:25,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:12:25,875 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:12:25,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 23 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:12:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:12:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:12:25,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:12:25,877 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 09:12:25,877 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 09:12:25,877 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 09:12:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:25,877 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:12:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:12:25,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:25,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:25,877 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 09:12:25,877 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 09:12:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:12:25,877 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:12:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:12:25,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:25,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:12:25,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:12:25,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:12:25,878 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 09:12:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:12:25,878 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-28 09:12:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:12:25,878 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:12:25,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 09:12:25,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:12:25,878 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 09:12:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:12:25,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:12:25,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:12:25,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:12:25,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:12:26,003 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 09:12:26,003 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 09:12:26,003 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 09:12:26,003 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (not (= |old(~x~0)| 0)) [2022-04-28 09:12:26,003 INFO L895 garLoopResultBuilder]: At program point L29(lines 24 35) the Hoare annotation is: (or (not (= |old(~x~0)| 0)) (= ~x~0 |old(~x~0)|)) [2022-04-28 09:12:26,004 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (or (not (= |old(~x~0)| 0)) (= ~x~0 |old(~x~0)|)) [2022-04-28 09:12:26,004 INFO L895 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (or (not (= |old(~x~0)| 0)) (= ~x~0 |old(~x~0)|)) [2022-04-28 09:12:26,004 INFO L895 garLoopResultBuilder]: At program point L26-1(lines 26 30) the Hoare annotation is: (not (= |old(~x~0)| 0)) [2022-04-28 09:12:26,004 INFO L895 garLoopResultBuilder]: At program point mainEXIT(lines 24 35) the Hoare annotation is: (not (= |old(~x~0)| 0)) [2022-04-28 09:12:26,004 INFO L895 garLoopResultBuilder]: At program point mainFINAL(lines 24 35) the Hoare annotation is: (not (= |old(~x~0)| 0)) [2022-04-28 09:12:26,004 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (= ~x~0 0) [2022-04-28 09:12:26,004 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~x~0 |old(~x~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:12:26,004 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= ~x~0 0) [2022-04-28 09:12:26,004 INFO L895 garLoopResultBuilder]: At program point evalENTRY(lines 14 21) the Hoare annotation is: (or (not (= |old(~x~0)| 0)) (= ~x~0 |old(~x~0)|)) [2022-04-28 09:12:26,005 INFO L895 garLoopResultBuilder]: At program point L16-1(lines 14 21) the Hoare annotation is: (or (not (= |old(~x~0)| 0)) (= ~x~0 |old(~x~0)|)) [2022-04-28 09:12:26,005 INFO L895 garLoopResultBuilder]: At program point evalEXIT(lines 14 21) the Hoare annotation is: (or (not (= |old(~x~0)| 0)) (= ~x~0 |old(~x~0)|)) [2022-04-28 09:12:26,005 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: false [2022-04-28 09:12:26,005 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~x~0 0) [2022-04-28 09:12:26,005 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:12:26,005 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: false [2022-04-28 09:12:26,005 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-28 09:12:26,005 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= ~x~0 0)) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:12:26,005 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= ~x~0 0))) [2022-04-28 09:12:26,006 INFO L895 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= ~x~0 0)) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:12:26,006 INFO L895 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= ~x~0 0)) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:12:26,006 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= ~x~0 0))) [2022-04-28 09:12:26,008 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-28 09:12:26,009 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:12:26,012 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:12:26,017 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 09:12:26,022 INFO L163 areAnnotationChecker]: CFG has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:12:26,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:12:26 BoogieIcfgContainer [2022-04-28 09:12:26,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:12:26,028 INFO L158 Benchmark]: Toolchain (without parser) took 1491.13ms. Allocated memory is still 179.3MB. Free memory was 129.4MB in the beginning and 74.4MB in the end (delta: 55.1MB). Peak memory consumption was 55.1MB. Max. memory is 8.0GB. [2022-04-28 09:12:26,028 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 78.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:12:26,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.81ms. Allocated memory is still 179.3MB. Free memory was 129.2MB in the beginning and 154.6MB in the end (delta: -25.4MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-28 09:12:26,029 INFO L158 Benchmark]: Boogie Preprocessor took 28.50ms. Allocated memory is still 179.3MB. Free memory was 154.6MB in the beginning and 153.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:12:26,029 INFO L158 Benchmark]: RCFGBuilder took 213.00ms. Allocated memory is still 179.3MB. Free memory was 153.0MB in the beginning and 143.1MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 09:12:26,029 INFO L158 Benchmark]: TraceAbstraction took 1046.71ms. Allocated memory is still 179.3MB. Free memory was 142.5MB in the beginning and 74.4MB in the end (delta: 68.2MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. [2022-04-28 09:12:26,030 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.12ms. Allocated memory is still 179.3MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 78.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.81ms. Allocated memory is still 179.3MB. Free memory was 129.2MB in the beginning and 154.6MB in the end (delta: -25.4MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.50ms. Allocated memory is still 179.3MB. Free memory was 154.6MB in the beginning and 153.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 213.00ms. Allocated memory is still 179.3MB. Free memory was 153.0MB in the beginning and 143.1MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1046.71ms. Allocated memory is still 179.3MB. Free memory was 142.5MB in the beginning and 74.4MB in the end (delta: 68.2MB). Peak memory consumption was 68.2MB. 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 6 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 29 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 10, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 38 PreInvPairs, 45 NumberOfFragments, 139 HoareAnnotationTreeSize, 38 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 63 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 - ProcedureContractResult [Line: 14]: Procedure Contract for eval Derived contract for procedure eval: !(\old(x) == 0) || x == \old(x) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: !(\old(x) == 0) - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (\old(cond) == 0 || !(x == 0)) || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 09:12:26,060 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...