/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/trex04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:04:56,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:04:56,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:04:57,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:04:57,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:04:57,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:04:57,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:04:57,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:04:57,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:04:57,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:04:57,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:04:57,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:04:57,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:04:57,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:04:57,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:04:57,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:04:57,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:04:57,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:04:57,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:04:57,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:04:57,062 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:04:57,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:04:57,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:04:57,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:04:57,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:04:57,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:04:57,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:04:57,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:04:57,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:04:57,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:04:57,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:04:57,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:04:57,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:04:57,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:04:57,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:04:57,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:04:57,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:04:57,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:04:57,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:04:57,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:04:57,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:04:57,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:04:57,077 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:04:57,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:04:57,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:04:57,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:04:57,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:04:57,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:04:57,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:04:57,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:04:57,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:04:57,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:04:57,106 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:04:57,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:04:57,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:04:57,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:04:57,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:04:57,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:04:57,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:04:57,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:04:57,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:04:57,107 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:04:57,107 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:04:57,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:04:57,108 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:04:57,108 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 12:04:57,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:04:57,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:04:57,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:04:57,512 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:04:57,512 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:04:57,514 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/trex04.c [2022-04-15 12:04:57,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14bc3106e/6f5dfb4c1c3a49c68ebf567c0f620402/FLAGd6a07bbdf [2022-04-15 12:04:58,149 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:04:58,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/trex04.c [2022-04-15 12:04:58,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14bc3106e/6f5dfb4c1c3a49c68ebf567c0f620402/FLAGd6a07bbdf [2022-04-15 12:04:58,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14bc3106e/6f5dfb4c1c3a49c68ebf567c0f620402 [2022-04-15 12:04:58,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:04:58,515 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:04:58,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:04:58,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:04:58,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:04:58,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:04:58" (1/1) ... [2022-04-15 12:04:58,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7780ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:58, skipping insertion in model container [2022-04-15 12:04:58,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:04:58" (1/1) ... [2022-04-15 12:04:58,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:04:58,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:04:58,773 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/trex04.c[405,418] [2022-04-15 12:04:58,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:04:58,845 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:04:58,862 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/trex04.c[405,418] [2022-04-15 12:04:58,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:04:58,898 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:04:58,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:58 WrapperNode [2022-04-15 12:04:58,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:04:58,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:04:58,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:04:58,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:04:58,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:58" (1/1) ... [2022-04-15 12:04:58,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:58" (1/1) ... [2022-04-15 12:04:58,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:58" (1/1) ... [2022-04-15 12:04:58,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:58" (1/1) ... [2022-04-15 12:04:58,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:58" (1/1) ... [2022-04-15 12:04:58,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:58" (1/1) ... [2022-04-15 12:04:58,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:58" (1/1) ... [2022-04-15 12:04:58,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:04:58,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:04:58,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:04:58,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:04:58,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:58" (1/1) ... [2022-04-15 12:04:58,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:04:58,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:04:58,980 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 12:04:59,014 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 12:04:59,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:04:59,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:04:59,046 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:04:59,051 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:04:59,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:04:59,057 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2022-04-15 12:04:59,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:04:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:04:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:04:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:04:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:04:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:04:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:04:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 12:04:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:04:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2022-04-15 12:04:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:04:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:04:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:04:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:04:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:04:59,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:04:59,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:04:59,148 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:04:59,149 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:04:59,403 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:04:59,409 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:04:59,409 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:04:59,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:59 BoogieIcfgContainer [2022-04-15 12:04:59,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:04:59,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:04:59,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:04:59,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:04:59,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:04:58" (1/3) ... [2022-04-15 12:04:59,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c465c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:04:59, skipping insertion in model container [2022-04-15 12:04:59,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:58" (2/3) ... [2022-04-15 12:04:59,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c465c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:04:59, skipping insertion in model container [2022-04-15 12:04:59,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:59" (3/3) ... [2022-04-15 12:04:59,427 INFO L111 eAbstractionObserver]: Analyzing ICFG trex04.c [2022-04-15 12:04:59,431 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:04:59,431 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:04:59,479 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:04:59,486 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 12:04:59,487 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:04:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.55) internal successors, (31), 24 states have internal predecessors, (31), 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 12:04:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:04:59,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:04:59,512 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:04:59,513 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:04:59,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:04:59,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1661240883, now seen corresponding path program 1 times [2022-04-15 12:04:59,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:04:59,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2002922331] [2022-04-15 12:04:59,535 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:04:59,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1661240883, now seen corresponding path program 2 times [2022-04-15 12:04:59,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:04:59,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335159441] [2022-04-15 12:04:59,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:04:59,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:04:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:04:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:04:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:04:59,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-15 12:04:59,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 12:04:59,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-15 12:04:59,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:04:59,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-15 12:04:59,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 12:04:59,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-15 12:04:59,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret13 := main(); {34#true} is VALID [2022-04-15 12:04:59,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} ~d~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~x~0 := #t~nondet8;havoc #t~nondet8; {34#true} is VALID [2022-04-15 12:04:59,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !!(~x~0 <= 1000000 && ~x~0 >= -1000000);~c1~1 := #t~nondet9;havoc #t~nondet9;~c2~1 := #t~nondet10;havoc #t~nondet10; {34#true} is VALID [2022-04-15 12:04:59,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} assume !(0 != ~c1~1 % 256); {34#true} is VALID [2022-04-15 12:04:59,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume !(0 != ~c2~1 % 256); {34#true} is VALID [2022-04-15 12:04:59,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#true} ~c1~1 := #t~nondet11;havoc #t~nondet11;~c2~1 := #t~nondet12;havoc #t~nondet12; {34#true} is VALID [2022-04-15 12:04:59,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#true} assume !(0 != ~c1~1 % 256); {34#true} is VALID [2022-04-15 12:04:59,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#true} assume 0 != ~c2~1 % 256;~d~0 := ~d~0 - 1; {34#true} is VALID [2022-04-15 12:04:59,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-15 12:04:59,842 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~x~0 <= 0 then 1 else 0)); {35#false} is VALID [2022-04-15 12:04:59,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-15 12:04:59,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-15 12:04:59,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-15 12:04:59,843 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 12:04:59,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:04:59,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335159441] [2022-04-15 12:04:59,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335159441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:04:59,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:04:59,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:04:59,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:04:59,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2002922331] [2022-04-15 12:04:59,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2002922331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:04:59,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:04:59,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:04:59,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136293429] [2022-04-15 12:04:59,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:04:59,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2022-04-15 12:04:59,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:04:59,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 12:04:59,905 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 12:04:59,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:04:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:04:59,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:04:59,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:04:59,956 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.55) internal successors, (31), 24 states have internal predecessors, (31), 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 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 12:05:00,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:00,176 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-04-15 12:05:00,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:05:00,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2022-04-15 12:05:00,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 12:05:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-15 12:05:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 12:05:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-15 12:05:00,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-04-15 12:05:00,348 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 12:05:00,362 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:05:00,363 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:05:00,365 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 12:05:00,367 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:05:00,376 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:05:00,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:05:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 12:05:00,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:00,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:05:00,419 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:05:00,420 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:05:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:00,424 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-15 12:05:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 12:05:00,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:00,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:00,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 12:05:00,425 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 12:05:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:00,433 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-15 12:05:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 12:05:00,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:00,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:00,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:00,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:05:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-15 12:05:00,438 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2022-04-15 12:05:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:00,438 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-15 12:05:00,439 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 12:05:00,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 32 transitions. [2022-04-15 12:05:00,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:05:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 12:05:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:05:00,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:05:00,562 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:05:00,562 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:05:00,562 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:05:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:05:00,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1664934967, now seen corresponding path program 1 times [2022-04-15 12:05:00,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:00,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [841593018] [2022-04-15 12:05:00,570 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:05:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1664934967, now seen corresponding path program 2 times [2022-04-15 12:05:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:05:00,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622458185] [2022-04-15 12:05:00,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:05:00,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:05:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:05:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:05:00,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {226#true} is VALID [2022-04-15 12:05:00,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#true} assume true; {226#true} is VALID [2022-04-15 12:05:00,815 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {226#true} {226#true} #92#return; {226#true} is VALID [2022-04-15 12:05:00,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {226#true} call ULTIMATE.init(); {234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:05:00,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {226#true} is VALID [2022-04-15 12:05:00,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {226#true} assume true; {226#true} is VALID [2022-04-15 12:05:00,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {226#true} {226#true} #92#return; {226#true} is VALID [2022-04-15 12:05:00,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {226#true} call #t~ret13 := main(); {226#true} is VALID [2022-04-15 12:05:00,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {226#true} ~d~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~x~0 := #t~nondet8;havoc #t~nondet8; {226#true} is VALID [2022-04-15 12:05:00,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {226#true} assume !!(~x~0 <= 1000000 && ~x~0 >= -1000000);~c1~1 := #t~nondet9;havoc #t~nondet9;~c2~1 := #t~nondet10;havoc #t~nondet10; {226#true} is VALID [2022-04-15 12:05:00,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#true} assume !(0 != ~c1~1 % 256); {226#true} is VALID [2022-04-15 12:05:00,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {226#true} assume !(0 != ~c2~1 % 256); {226#true} is VALID [2022-04-15 12:05:00,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {226#true} ~c1~1 := #t~nondet11;havoc #t~nondet11;~c2~1 := #t~nondet12;havoc #t~nondet12; {226#true} is VALID [2022-04-15 12:05:00,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {226#true} assume !(0 != ~c1~1 % 256); {226#true} is VALID [2022-04-15 12:05:00,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#true} assume 0 != ~c2~1 % 256;~d~0 := ~d~0 - 1; {226#true} is VALID [2022-04-15 12:05:00,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#true} assume !(~x~0 > 0); {231#(<= main_~x~0 0)} is VALID [2022-04-15 12:05:00,819 INFO L272 TraceCheckUtils]: 13: Hoare triple {231#(<= main_~x~0 0)} call __VERIFIER_assert((if ~x~0 <= 0 then 1 else 0)); {232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:05:00,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {232#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {233#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:05:00,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {233#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {227#false} is VALID [2022-04-15 12:05:00,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {227#false} assume !false; {227#false} is VALID [2022-04-15 12:05:00,821 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 12:05:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:05:00,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622458185] [2022-04-15 12:05:00,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622458185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:00,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:00,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:05:00,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:05:00,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [841593018] [2022-04-15 12:05:00,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [841593018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:05:00,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:05:00,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:05:00,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482654764] [2022-04-15 12:05:00,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:05:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-15 12:05:00,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:05:00,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 12:05:00,860 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 12:05:00,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:05:00,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:05:00,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:05:00,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:05:00,863 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 12:05:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:01,082 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-15 12:05:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:05:01,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-15 12:05:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:05:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 12:05:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 12:05:01,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 12:05:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 12:05:01,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-15 12:05:01,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:05:01,138 INFO L225 Difference]: With dead ends: 25 [2022-04-15 12:05:01,139 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:05:01,139 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:05:01,140 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:05:01,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 44 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:05:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:05:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:05:01,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:05:01,142 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 12:05:01,142 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 12:05:01,143 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 12:05:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:01,143 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:05:01,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:05:01,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:01,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:01,143 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 12:05:01,143 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 12:05:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:05:01,144 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:05:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:05:01,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:01,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:05:01,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:05:01,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:05:01,144 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 12:05:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:05:01,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-15 12:05:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:05:01,145 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:05:01,145 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 12:05:01,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:05:01,145 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 12:05:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:05:01,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:05:01,149 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:05:01,149 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:05:01,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:05:01,213 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 12:05:01,213 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 12:05:01,213 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 12:05:01,214 INFO L885 garLoopResultBuilder]: At program point fooEXIT(lines 18 25) the Hoare annotation is: true [2022-04-15 12:05:01,214 INFO L885 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-15 12:05:01,214 INFO L885 garLoopResultBuilder]: At program point L23-1(lines 18 25) the Hoare annotation is: true [2022-04-15 12:05:01,214 INFO L885 garLoopResultBuilder]: At program point fooENTRY(lines 18 25) the Hoare annotation is: true [2022-04-15 12:05:01,214 INFO L885 garLoopResultBuilder]: At program point L22-2(lines 19 25) the Hoare annotation is: true [2022-04-15 12:05:01,214 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-15 12:05:01,215 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-15 12:05:01,215 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-15 12:05:01,215 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-15 12:05:01,215 INFO L885 garLoopResultBuilder]: At program point L35-2(line 35) the Hoare annotation is: true [2022-04-15 12:05:01,215 INFO L885 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: true [2022-04-15 12:05:01,215 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 27 48) the Hoare annotation is: true [2022-04-15 12:05:01,215 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 27 48) the Hoare annotation is: true [2022-04-15 12:05:01,216 INFO L885 garLoopResultBuilder]: At program point L42-1(lines 28 48) the Hoare annotation is: true [2022-04-15 12:05:01,216 INFO L878 garLoopResultBuilder]: At program point L42-2(lines 42 45) the Hoare annotation is: (<= main_~x~0 0) [2022-04-15 12:05:01,216 INFO L885 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: true [2022-04-15 12:05:01,216 INFO L885 garLoopResultBuilder]: At program point L34-2(lines 28 48) the Hoare annotation is: true [2022-04-15 12:05:01,216 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 27 48) the Hoare annotation is: true [2022-04-15 12:05:01,216 INFO L885 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: true [2022-04-15 12:05:01,216 INFO L885 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: true [2022-04-15 12:05:01,217 INFO L885 garLoopResultBuilder]: At program point L39-3(lines 28 48) the Hoare annotation is: true [2022-04-15 12:05:01,217 INFO L885 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-04-15 12:05:01,217 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:05:01,217 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 12:05:01,217 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:05:01,217 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:05:01,217 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:05:01,217 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:05:01,217 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:05:01,218 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 14) the Hoare annotation is: true [2022-04-15 12:05:01,218 INFO L878 garLoopResultBuilder]: At program point L11(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:05:01,218 INFO L878 garLoopResultBuilder]: At program point L10(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:05:01,218 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 14) the Hoare annotation is: true [2022-04-15 12:05:01,218 INFO L885 garLoopResultBuilder]: At program point L10-2(lines 9 14) the Hoare annotation is: true [2022-04-15 12:05:01,218 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:05:01,221 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-15 12:05:01,222 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:05:01,225 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:05:01,226 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 12:05:01,227 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:05:01,227 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 12:05:01,227 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 12:05:01,227 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-15 12:05:01,228 INFO L163 areAnnotationChecker]: CFG has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 12:05:01,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:05:01 BoogieIcfgContainer [2022-04-15 12:05:01,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:05:01,234 INFO L158 Benchmark]: Toolchain (without parser) took 2719.37ms. Allocated memory was 186.6MB in the beginning and 239.1MB in the end (delta: 52.4MB). Free memory was 162.0MB in the beginning and 201.6MB in the end (delta: -39.5MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-04-15 12:05:01,235 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 186.6MB. Free memory was 149.5MB in the beginning and 149.3MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:05:01,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.80ms. Allocated memory was 186.6MB in the beginning and 239.1MB in the end (delta: 52.4MB). Free memory was 162.0MB in the beginning and 213.5MB in the end (delta: -51.4MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-04-15 12:05:01,235 INFO L158 Benchmark]: Boogie Preprocessor took 51.71ms. Allocated memory is still 239.1MB. Free memory was 213.5MB in the beginning and 212.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:05:01,236 INFO L158 Benchmark]: RCFGBuilder took 459.55ms. Allocated memory is still 239.1MB. Free memory was 211.5MB in the beginning and 199.5MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:05:01,236 INFO L158 Benchmark]: TraceAbstraction took 1820.59ms. Allocated memory is still 239.1MB. Free memory was 198.9MB in the beginning and 201.6MB in the end (delta: -2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:05:01,237 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.14ms. Allocated memory is still 186.6MB. Free memory was 149.5MB in the beginning and 149.3MB in the end (delta: 134.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 369.80ms. Allocated memory was 186.6MB in the beginning and 239.1MB in the end (delta: 52.4MB). Free memory was 162.0MB in the beginning and 213.5MB in the end (delta: -51.4MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.71ms. Allocated memory is still 239.1MB. Free memory was 213.5MB in the beginning and 212.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 459.55ms. Allocated memory is still 239.1MB. Free memory was 211.5MB in the beginning and 199.5MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1820.59ms. Allocated memory is still 239.1MB. Free memory was 198.9MB in the beginning and 201.6MB in the end (delta: -2.7MB). There was no memory consumed. 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: 11]: 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 7 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 63 mSDtfsCounter, 80 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 42 PreInvPairs, 49 NumberOfFragments, 50 HoareAnnotationTreeSize, 42 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 31 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 18]: Procedure Contract for foo Derived contract for procedure foo: 1 - ProcedureContractResult [Line: 27]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 12:05:01,287 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...