/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/loops/while_infinite_loop_3.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-15 05:45:32,893 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-15 05:45:32,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-15 05:45:32,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-15 05:45:32,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-15 05:45:32,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-15 05:45:32,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-15 05:45:32,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-15 05:45:32,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-15 05:45:32,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-15 05:45:32,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-15 05:45:32,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-15 05:45:32,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-15 05:45:32,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-15 05:45:32,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-15 05:45:32,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-15 05:45:32,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-15 05:45:32,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-15 05:45:32,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-15 05:45:32,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-15 05:45:32,958 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-15 05:45:32,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-15 05:45:32,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-15 05:45:32,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-15 05:45:32,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-15 05:45:32,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-15 05:45:32,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-15 05:45:32,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-15 05:45:32,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-15 05:45:32,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-15 05:45:32,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-15 05:45:32,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-15 05:45:32,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-15 05:45:32,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-15 05:45:32,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-15 05:45:32,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-15 05:45:32,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-15 05:45:32,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-15 05:45:32,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-15 05:45:32,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-15 05:45:32,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-15 05:45:32,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-15 05:45:32,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf
[2022-04-15 05:45:32,988 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-15 05:45:32,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-15 05:45:32,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-15 05:45:32,989 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-15 05:45:32,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-15 05:45:32,990 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-15 05:45:32,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-15 05:45:32,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-15 05:45:32,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-15 05:45:32,990 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-15 05:45:32,990 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-15 05:45:32,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-15 05:45:32,990 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-15 05:45:32,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-15 05:45:32,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-15 05:45:32,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-15 05:45:32,996 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-15 05:45:32,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-15 05:45:32,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 05:45:32,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-15 05:45:32,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-15 05:45:32,997 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-15 05:45:32,997 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-15 05:45:32,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-15 05:45:32,998 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-15 05:45:32,998 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-15 05:45:33,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-15 05:45:33,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-15 05:45:33,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-15 05:45:33,221 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-15 05:45:33,222 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-15 05:45:33,223 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-15 05:45:33,278 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8aa18f6/3b74712bd05f43f58707fa899006c4d0/FLAG5dd53cd3f
[2022-04-15 05:45:33,657 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-15 05:45:33,657 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/while_infinite_loop_3.c
[2022-04-15 05:45:33,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8aa18f6/3b74712bd05f43f58707fa899006c4d0/FLAG5dd53cd3f
[2022-04-15 05:45:33,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8aa18f6/3b74712bd05f43f58707fa899006c4d0
[2022-04-15 05:45:33,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-15 05:45:33,676 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-15 05:45:33,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-15 05:45:33,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-15 05:45:33,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-15 05:45:33,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:45:33" (1/1) ...
[2022-04-15 05:45:33,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74402406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:33, skipping insertion in model container
[2022-04-15 05:45:33,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:45:33" (1/1) ...
[2022-04-15 05:45:33,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-15 05:45:33,697 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-15 05:45:33,809 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-15 05:45:33,819 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 05:45:33,848 INFO L203 MainTranslator]: Completed pre-run
[2022-04-15 05:45:33,858 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-15 05:45:33,860 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 05:45:33,872 INFO L208 MainTranslator]: Completed translation
[2022-04-15 05:45:33,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:33 WrapperNode
[2022-04-15 05:45:33,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-15 05:45:33,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-15 05:45:33,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-15 05:45:33,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-15 05:45:33,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:33" (1/1) ...
[2022-04-15 05:45:33,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:33" (1/1) ...
[2022-04-15 05:45:33,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:33" (1/1) ...
[2022-04-15 05:45:33,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:33" (1/1) ...
[2022-04-15 05:45:33,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:33" (1/1) ...
[2022-04-15 05:45:33,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:33" (1/1) ...
[2022-04-15 05:45:33,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:33" (1/1) ...
[2022-04-15 05:45:33,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-15 05:45:33,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-15 05:45:33,898 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-15 05:45:33,898 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-15 05:45:33,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:33" (1/1) ...
[2022-04-15 05:45:33,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 05:45:33,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 05:45:33,925 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-15 05:45:33,927 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-15 05:45:33,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-15 05:45:33,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-15 05:45:33,954 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-15 05:45:33,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-15 05:45:33,954 INFO L138 BoogieDeclarations]: Found implementation of procedure eval
[2022-04-15 05:45:33,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-15 05:45:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-15 05:45:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-15 05:45:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-15 05:45:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-15 05:45:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-15 05:45:33,956 INFO L130 BoogieDeclarations]: Found specification of procedure eval
[2022-04-15 05:45:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-15 05:45:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-15 05:45:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-15 05:45:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-15 05:45:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-15 05:45:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-15 05:45:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-15 05:45:34,009 INFO L234 CfgBuilder]: Building ICFG
[2022-04-15 05:45:34,011 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-15 05:45:34,073 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-15 05:45:34,079 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-15 05:45:34,079 INFO L299 CfgBuilder]: Removed 2 assume(true) statements.
[2022-04-15 05:45:34,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:45:34 BoogieIcfgContainer
[2022-04-15 05:45:34,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-15 05:45:34,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-15 05:45:34,082 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-15 05:45:34,085 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-15 05:45:34,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:45:33" (1/3) ...
[2022-04-15 05:45:34,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727607ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:45:34, skipping insertion in model container
[2022-04-15 05:45:34,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:45:33" (2/3) ...
[2022-04-15 05:45:34,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727607ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:45:34, skipping insertion in model container
[2022-04-15 05:45:34,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:45:34" (3/3) ...
[2022-04-15 05:45:34,087 INFO L111 eAbstractionObserver]: Analyzing ICFG while_infinite_loop_3.c
[2022-04-15 05:45:34,091 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-15 05:45:34,092 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-15 05:45:34,136 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-15 05:45:34,145 INFO L340 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
[2022-04-15 05:45:34,145 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-15 05:45:34,169 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-15 05:45:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2022-04-15 05:45:34,175 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 05:45:34,176 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 05:45:34,176 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 05:45:34,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 05:45:34,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1499484955, now seen corresponding path program 1 times
[2022-04-15 05:45:34,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 05:45:34,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1268901096]
[2022-04-15 05:45:34,197 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 05:45:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1499484955, now seen corresponding path program 2 times
[2022-04-15 05:45:34,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 05:45:34,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846159954]
[2022-04-15 05:45:34,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 05:45:34,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 05:45:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 05:45:34,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 05:45:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 05:45:34,389 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-15 05:45:34,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID
[2022-04-15 05:45:34,390 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #53#return; {26#true} is VALID
[2022-04-15 05:45:34,392 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-15 05:45:34,392 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-15 05:45:34,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID
[2022-04-15 05:45:34,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #53#return; {26#true} is VALID
[2022-04-15 05:45:34,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret4 := main(); {26#true} is VALID
[2022-04-15 05:45:34,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} assume false; {27#false} is VALID
[2022-04-15 05:45:34,394 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-15 05:45:34,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID
[2022-04-15 05:45:34,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID
[2022-04-15 05:45:34,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume !false; {27#false} is VALID
[2022-04-15 05:45:34,395 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-15 05:45:34,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 05:45:34,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846159954]
[2022-04-15 05:45:34,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846159954] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 05:45:34,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 05:45:34,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 05:45:34,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 05:45:34,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1268901096]
[2022-04-15 05:45:34,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1268901096] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 05:45:34,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 05:45:34,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 05:45:34,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283584174]
[2022-04-15 05:45:34,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 05:45:34,405 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-15 05:45:34,406 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 05:45:34,409 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-15 05:45:34,423 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-15 05:45:34,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-15 05:45:34,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 05:45:34,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-15 05:45:34,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 05:45:34,458 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-15 05:45:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 05:45:34,595 INFO L93 Difference]: Finished difference Result 37 states and 53 transitions.
[2022-04-15 05:45:34,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-15 05:45:34,596 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-15 05:45:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 05:45:34,597 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-15 05:45:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions.
[2022-04-15 05:45:34,608 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-15 05:45:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions.
[2022-04-15 05:45:34,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 53 transitions.
[2022-04-15 05:45:34,697 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-15 05:45:34,707 INFO L225 Difference]: With dead ends: 37
[2022-04-15 05:45:34,707 INFO L226 Difference]: Without dead ends: 19
[2022-04-15 05:45:34,711 INFO L912 BasicCegarLoop]: 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-15 05:45:34,717 INFO L913 BasicCegarLoop]: 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-15 05:45:34,719 INFO L914 BasicCegarLoop]: 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-15 05:45:34,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2022-04-15 05:45:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17.
[2022-04-15 05:45:34,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 05:45:34,744 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-15 05:45:34,745 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-15 05:45:34,745 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-15 05:45:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 05:45:34,749 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions.
[2022-04-15 05:45:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions.
[2022-04-15 05:45:34,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 05:45:34,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 05:45:34,750 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-15 05:45:34,750 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-15 05:45:34,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 05:45:34,753 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions.
[2022-04-15 05:45:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions.
[2022-04-15 05:45:34,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 05:45:34,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 05:45:34,753 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 05:45:34,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 05:45:34,754 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-15 05:45:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions.
[2022-04-15 05:45:34,756 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10
[2022-04-15 05:45:34,757 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 05:45:34,757 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions.
[2022-04-15 05:45:34,757 INFO L479 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-15 05:45:34,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions.
[2022-04-15 05:45:34,777 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-15 05:45:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions.
[2022-04-15 05:45:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2022-04-15 05:45:34,778 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 05:45:34,778 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 05:45:34,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-15 05:45:34,779 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 05:45:34,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 05:45:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1713498874, now seen corresponding path program 1 times
[2022-04-15 05:45:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 05:45:34,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1026587495]
[2022-04-15 05:45:34,781 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 05:45:34,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1713498874, now seen corresponding path program 2 times
[2022-04-15 05:45:34,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 05:45:34,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273839129]
[2022-04-15 05:45:34,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 05:45:34,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 05:45:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 05:45:34,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 05:45:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 05:45:34,899 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-15 05:45:34,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID
[2022-04-15 05:45:34,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #53#return; {180#true} is VALID
[2022-04-15 05:45:34,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-15 05:45:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 05:45:34,918 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-15 05:45:34,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#(= ~x~0 0)} assume true; {188#(= ~x~0 0)} is VALID
[2022-04-15 05:45:34,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {188#(= ~x~0 0)} {180#true} #47#return; {188#(= ~x~0 0)} is VALID
[2022-04-15 05:45:34,920 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-15 05:45:34,920 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-15 05:45:34,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID
[2022-04-15 05:45:34,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #53#return; {180#true} is VALID
[2022-04-15 05:45:34,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret4 := main(); {180#true} is VALID
[2022-04-15 05:45:34,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume !false; {180#true} is VALID
[2022-04-15 05:45:34,922 INFO L272 TraceCheckUtils]: 6: Hoare triple {180#true} call eval(); {192#(= ~x~0 |old(~x~0)|)} is VALID
[2022-04-15 05:45:34,922 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-15 05:45:34,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {188#(= ~x~0 0)} assume true; {188#(= ~x~0 0)} is VALID
[2022-04-15 05:45:34,923 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {188#(= ~x~0 0)} {180#true} #47#return; {188#(= ~x~0 0)} is VALID
[2022-04-15 05:45:34,924 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-15 05:45:34,924 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-15 05:45:34,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {190#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {181#false} is VALID
[2022-04-15 05:45:34,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {181#false} assume !false; {181#false} is VALID
[2022-04-15 05:45:34,925 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-15 05:45:34,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 05:45:34,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273839129]
[2022-04-15 05:45:34,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273839129] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 05:45:34,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 05:45:34,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-15 05:45:34,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 05:45:34,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1026587495]
[2022-04-15 05:45:34,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1026587495] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 05:45:34,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 05:45:34,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-15 05:45:34,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456328080]
[2022-04-15 05:45:34,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 05:45:34,928 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-15 05:45:34,929 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 05:45:34,929 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-15 05:45:34,941 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-15 05:45:34,942 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-15 05:45:34,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 05:45:34,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-15 05:45:34,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-04-15 05:45:34,943 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-15 05:45:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 05:45:35,123 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions.
[2022-04-15 05:45:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-15 05:45:35,123 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-15 05:45:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 05:45:35,125 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-15 05:45:35,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions.
[2022-04-15 05:45:35,128 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-15 05:45:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions.
[2022-04-15 05:45:35,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 17 transitions.
[2022-04-15 05:45:35,150 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-15 05:45:35,150 INFO L225 Difference]: With dead ends: 17
[2022-04-15 05:45:35,150 INFO L226 Difference]: Without dead ends: 0
[2022-04-15 05:45:35,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2022-04-15 05:45:35,154 INFO L913 BasicCegarLoop]: 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-15 05:45:35,155 INFO L914 BasicCegarLoop]: 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-15 05:45:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-04-15 05:45:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-04-15 05:45:35,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 05:45:35,157 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-15 05:45:35,157 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-15 05:45:35,157 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-15 05:45:35,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 05:45:35,158 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-15 05:45:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-15 05:45:35,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 05:45:35,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 05:45:35,159 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-15 05:45:35,159 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-15 05:45:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 05:45:35,159 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-15 05:45:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-15 05:45:35,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 05:45:35,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 05:45:35,160 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 05:45:35,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 05:45:35,160 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-15 05:45:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-04-15 05:45:35,160 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14
[2022-04-15 05:45:35,160 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 05:45:35,160 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-04-15 05:45:35,161 INFO L479 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-15 05:45:35,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions.
[2022-04-15 05:45:35,162 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-15 05:45:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-15 05:45:35,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 05:45:35,164 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-15 05:45:35,165 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-15 05:45:35,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2022-04-15 05:45:35,320 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed.
[2022-04-15 05:45:35,320 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed.
[2022-04-15 05:45:35,324 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed.
[2022-04-15 05:45:35,324 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (not (= |old(~x~0)| 0))
[2022-04-15 05:45:35,324 INFO L878 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-15 05:45:35,324 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (or (not (= |old(~x~0)| 0)) (= ~x~0 |old(~x~0)|))
[2022-04-15 05:45:35,325 INFO L878 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-15 05:45:35,325 INFO L878 garLoopResultBuilder]: At program point L26-1(lines 26 30) the Hoare annotation is: (not (= |old(~x~0)| 0))
[2022-04-15 05:45:35,326 INFO L878 garLoopResultBuilder]: At program point mainEXIT(lines 24 35) the Hoare annotation is: (not (= |old(~x~0)| 0))
[2022-04-15 05:45:35,326 INFO L878 garLoopResultBuilder]: At program point mainFINAL(lines 24 35) the Hoare annotation is: (not (= |old(~x~0)| 0))
[2022-04-15 05:45:35,326 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (= ~x~0 0)
[2022-04-15 05:45:35,326 INFO L878 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-15 05:45:35,326 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= ~x~0 0)
[2022-04-15 05:45:35,326 INFO L878 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-15 05:45:35,327 INFO L878 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-15 05:45:35,327 INFO L878 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-15 05:45:35,328 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: false
[2022-04-15 05:45:35,330 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~x~0 0)
[2022-04-15 05:45:35,331 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2022-04-15 05:45:35,335 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: false
[2022-04-15 05:45:35,335 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true
[2022-04-15 05:45:35,336 INFO L878 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-15 05:45:35,336 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= ~x~0 0)))
[2022-04-15 05:45:35,336 INFO L878 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-15 05:45:35,336 INFO L878 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-15 05:45:35,336 INFO L878 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-15 05:45:35,339 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2]
[2022-04-15 05:45:35,340 INFO L177 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-15 05:45:35,343 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-15 05:45:35,350 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation
[2022-04-15 05:45:35,356 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-15 05:45:35,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:45:35 BoogieIcfgContainer
[2022-04-15 05:45:35,363 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-15 05:45:35,364 INFO L158 Benchmark]: Toolchain (without parser) took 1688.18ms. Allocated memory was 191.9MB in the beginning and 247.5MB in the end (delta: 55.6MB). Free memory was 134.4MB in the beginning and 136.2MB in the end (delta: -1.9MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB.
[2022-04-15 05:45:35,364 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 191.9MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-15 05:45:35,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.72ms. Allocated memory was 191.9MB in the beginning and 247.5MB in the end (delta: 55.6MB). Free memory was 134.1MB in the beginning and 217.9MB in the end (delta: -83.8MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB.
[2022-04-15 05:45:35,365 INFO L158 Benchmark]: Boogie Preprocessor took 23.93ms. Allocated memory is still 247.5MB. Free memory was 217.9MB in the beginning and 216.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-15 05:45:35,365 INFO L158 Benchmark]: RCFGBuilder took 182.72ms. Allocated memory is still 247.5MB. Free memory was 216.4MB in the beginning and 206.5MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB.
[2022-04-15 05:45:35,366 INFO L158 Benchmark]: TraceAbstraction took 1280.71ms. Allocated memory is still 247.5MB. Free memory was 206.0MB in the beginning and 136.2MB in the end (delta: 69.7MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB.
[2022-04-15 05:45:35,367 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.13ms. Allocated memory is still 191.9MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 195.72ms. Allocated memory was 191.9MB in the beginning and 247.5MB in the end (delta: 55.6MB). Free memory was 134.1MB in the beginning and 217.9MB in the end (delta: -83.8MB). Peak memory consumption was 7.8MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 23.93ms. Allocated memory is still 247.5MB. Free memory was 217.9MB in the beginning and 216.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 182.72ms. Allocated memory is still 247.5MB. Free memory was 216.4MB in the beginning and 206.5MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB.
* TraceAbstraction took 1280.71ms. Allocated memory is still 247.5MB. Free memory was 206.0MB in the beginning and 136.2MB in the end (delta: 69.7MB). Peak memory consumption was 70.3MB. 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.2s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.1s 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-15 05:45:35,407 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...