/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:25:18,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:25:18,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:25:18,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:25:18,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:25:18,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:25:18,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:25:18,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:25:18,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:25:18,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:25:18,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:25:18,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:25:18,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:25:18,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:25:18,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:25:18,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:25:18,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:25:18,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:25:18,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:25:18,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:25:18,196 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:25:18,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:25:18,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:25:18,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:25:18,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:25:18,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:25:18,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:25:18,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:25:18,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:25:18,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:25:18,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:25:18,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:25:18,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:25:18,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:25:18,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:25:18,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:25:18,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:25:18,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:25:18,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:25:18,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:25:18,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:25:18,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:25:18,217 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 12:25:18,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:25:18,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:25:18,243 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:25:18,243 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:25:18,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:25:18,244 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:25:18,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:25:18,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:25:18,245 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:25:18,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:25:18,246 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:25:18,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:25:18,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:25:18,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:25:18,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:25:18,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:25:18,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:25:18,247 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:25:18,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:25:18,247 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:25:18,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:25:18,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:25:18,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:25:18,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:25:18,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:25:18,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:25:18,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:25:18,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:25:18,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:25:18,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:25:18,249 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:25:18,249 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:25:18,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:25:18,249 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-07 12:25:18,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:25:18,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:25:18,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:25:18,503 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:25:18,505 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:25:18,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_1.c [2022-04-07 12:25:18,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0366a519c/0a02c5876a764e5cb1ca108ed1eb4f00/FLAG8d11d4f94 [2022-04-07 12:25:18,889 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:25:18,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_1.c [2022-04-07 12:25:18,894 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0366a519c/0a02c5876a764e5cb1ca108ed1eb4f00/FLAG8d11d4f94 [2022-04-07 12:25:18,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0366a519c/0a02c5876a764e5cb1ca108ed1eb4f00 [2022-04-07 12:25:18,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:25:18,907 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:25:18,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:25:18,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:25:18,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:25:18,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:25:18" (1/1) ... [2022-04-07 12:25:18,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2904b4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:25:18, skipping insertion in model container [2022-04-07 12:25:18,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:25:18" (1/1) ... [2022-04-07 12:25:18,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:25:18,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:25:19,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_1.c[676,689] [2022-04-07 12:25:19,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:25:19,096 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:25:19,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_1.c[676,689] [2022-04-07 12:25:19,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:25:19,124 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:25:19,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:25:19 WrapperNode [2022-04-07 12:25:19,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:25:19,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:25:19,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:25:19,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:25:19,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:25:19" (1/1) ... [2022-04-07 12:25:19,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:25:19" (1/1) ... [2022-04-07 12:25:19,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:25:19" (1/1) ... [2022-04-07 12:25:19,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:25:19" (1/1) ... [2022-04-07 12:25:19,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:25:19" (1/1) ... [2022-04-07 12:25:19,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:25:19" (1/1) ... [2022-04-07 12:25:19,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:25:19" (1/1) ... [2022-04-07 12:25:19,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:25:19,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:25:19,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:25:19,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:25:19,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:25:19" (1/1) ... [2022-04-07 12:25:19,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:25:19,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:25:19,178 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-07 12:25:19,180 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-07 12:25:19,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:25:19,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:25:19,212 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:25:19,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:25:19,212 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:25:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:25:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:25:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:25:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:25:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:25:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:25:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:25:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:25:19,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:25:19,264 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:25:19,265 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:25:19,334 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:25:19,340 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:25:19,340 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:25:19,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:25:19 BoogieIcfgContainer [2022-04-07 12:25:19,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:25:19,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:25:19,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:25:19,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:25:19,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:25:18" (1/3) ... [2022-04-07 12:25:19,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6e2232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:25:19, skipping insertion in model container [2022-04-07 12:25:19,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:25:19" (2/3) ... [2022-04-07 12:25:19,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6e2232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:25:19, skipping insertion in model container [2022-04-07 12:25:19,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:25:19" (3/3) ... [2022-04-07 12:25:19,349 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_1.c [2022-04-07 12:25:19,353 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:25:19,353 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:25:19,388 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:25:19,394 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-07 12:25:19,394 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:25:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 12:25:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-07 12:25:19,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:25:19,415 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:25:19,415 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:25:19,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:25:19,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1887993331, now seen corresponding path program 1 times [2022-04-07 12:25:19,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:25:19,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067993412] [2022-04-07 12:25:19,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:25:19,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:25:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:19,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:25:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:19,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {19#true} is VALID [2022-04-07 12:25:19,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-07 12:25:19,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19#true} {19#true} #32#return; {19#true} is VALID [2022-04-07 12:25:19,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {24#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:25:19,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {19#true} is VALID [2022-04-07 12:25:19,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-07 12:25:19,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #32#return; {19#true} is VALID [2022-04-07 12:25:19,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret5 := main(); {19#true} is VALID [2022-04-07 12:25:19,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#true} ~a~0 := 6;~a~0 := 0; {19#true} is VALID [2022-04-07 12:25:19,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {19#true} assume !true; {20#false} is VALID [2022-04-07 12:25:19,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#false} assume !(6 == ~a~0); {20#false} is VALID [2022-04-07 12:25:19,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-04-07 12:25:19,605 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-07 12:25:19,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:25:19,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067993412] [2022-04-07 12:25:19,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067993412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:25:19,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:25:19,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 12:25:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875153667] [2022-04-07 12:25:19,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:25:19,612 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-07 12:25:19,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:25:19,616 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:19,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:19,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 12:25:19,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:25:19,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 12:25:19,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:25:19,679 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:19,766 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-07 12:25:19,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 12:25:19,766 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-07 12:25:19,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:25:19,767 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-07 12:25:19,781 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:19,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-07 12:25:19,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-04-07 12:25:19,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:19,842 INFO L225 Difference]: With dead ends: 24 [2022-04-07 12:25:19,842 INFO L226 Difference]: Without dead ends: 11 [2022-04-07 12:25:19,845 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-07 12:25:19,848 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:25:19,849 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:25:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-04-07 12:25:19,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-04-07 12:25:19,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:25:19,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:19,873 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:19,873 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:19,876 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-07 12:25:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-07 12:25:19,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:19,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:19,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11 states. [2022-04-07 12:25:19,877 INFO L87 Difference]: Start difference. First operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11 states. [2022-04-07 12:25:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:19,879 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-07 12:25:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-07 12:25:19,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:19,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:19,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:25:19,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:25:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-04-07 12:25:19,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-04-07 12:25:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:25:19,883 INFO L478 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-04-07 12:25:19,884 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-07 12:25:19,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-07 12:25:19,884 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:25:19,885 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:25:19,885 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:25:19,885 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:25:19,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:25:19,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1887999097, now seen corresponding path program 1 times [2022-04-07 12:25:19,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:25:19,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424445763] [2022-04-07 12:25:19,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:25:19,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:25:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:19,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:25:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:19,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {94#true} is VALID [2022-04-07 12:25:19,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {94#true} assume true; {94#true} is VALID [2022-04-07 12:25:19,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94#true} {94#true} #32#return; {94#true} is VALID [2022-04-07 12:25:19,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {94#true} call ULTIMATE.init(); {100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:25:19,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {94#true} is VALID [2022-04-07 12:25:19,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {94#true} assume true; {94#true} is VALID [2022-04-07 12:25:19,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94#true} {94#true} #32#return; {94#true} is VALID [2022-04-07 12:25:19,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {94#true} call #t~ret5 := main(); {94#true} is VALID [2022-04-07 12:25:19,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {94#true} ~a~0 := 6;~a~0 := 0; {99#(= main_~a~0 0)} is VALID [2022-04-07 12:25:19,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {99#(= main_~a~0 0)} assume !(~a~0 < 6); {95#false} is VALID [2022-04-07 12:25:19,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {95#false} assume !(6 == ~a~0); {95#false} is VALID [2022-04-07 12:25:19,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {95#false} assume !false; {95#false} is VALID [2022-04-07 12:25:19,948 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-07 12:25:19,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:25:19,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424445763] [2022-04-07 12:25:19,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424445763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:25:19,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:25:19,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 12:25:19,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758202019] [2022-04-07 12:25:19,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:25:19,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-07 12:25:19,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:25:19,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:19,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:19,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 12:25:19,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:25:19,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 12:25:19,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 12:25:19,962 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:20,009 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-07 12:25:20,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 12:25:20,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-07 12:25:20,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:25:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-04-07 12:25:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-04-07 12:25:20,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2022-04-07 12:25:20,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:20,041 INFO L225 Difference]: With dead ends: 16 [2022-04-07 12:25:20,041 INFO L226 Difference]: Without dead ends: 13 [2022-04-07 12:25:20,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:25:20,044 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:25:20,045 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:25:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-07 12:25:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-04-07 12:25:20,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:25:20,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:20,048 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:20,049 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:20,050 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 12:25:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 12:25:20,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:20,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:20,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-07 12:25:20,051 INFO L87 Difference]: Start difference. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-07 12:25:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:20,052 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 12:25:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 12:25:20,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:20,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:20,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:25:20,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:25:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-07 12:25:20,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2022-04-07 12:25:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:25:20,054 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-07 12:25:20,055 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-07 12:25:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 12:25:20,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:25:20,055 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:25:20,056 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 12:25:20,056 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:25:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:25:20,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1889274843, now seen corresponding path program 1 times [2022-04-07 12:25:20,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:25:20,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363241487] [2022-04-07 12:25:20,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:25:20,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:25:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:25:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:20,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {171#true} is VALID [2022-04-07 12:25:20,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-07 12:25:20,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #32#return; {171#true} is VALID [2022-04-07 12:25:20,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:25:20,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {171#true} is VALID [2022-04-07 12:25:20,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-07 12:25:20,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #32#return; {171#true} is VALID [2022-04-07 12:25:20,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret5 := main(); {171#true} is VALID [2022-04-07 12:25:20,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} ~a~0 := 6;~a~0 := 0; {176#(= main_~a~0 0)} is VALID [2022-04-07 12:25:20,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#(= main_~a~0 0)} assume !!(~a~0 < 6); {176#(= main_~a~0 0)} is VALID [2022-04-07 12:25:20,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {176#(= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {177#(<= main_~a~0 1)} is VALID [2022-04-07 12:25:20,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {177#(<= main_~a~0 1)} assume !(~a~0 < 6); {172#false} is VALID [2022-04-07 12:25:20,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {172#false} assume !(6 == ~a~0); {172#false} is VALID [2022-04-07 12:25:20,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-04-07 12:25:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:25:20,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:25:20,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363241487] [2022-04-07 12:25:20,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363241487] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:25:20,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834283018] [2022-04-07 12:25:20,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:25:20,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:25:20,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:25:20,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:25:20,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 12:25:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:20,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 12:25:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:20,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:25:20,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {171#true} is VALID [2022-04-07 12:25:20,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {171#true} is VALID [2022-04-07 12:25:20,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-07 12:25:20,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #32#return; {171#true} is VALID [2022-04-07 12:25:20,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret5 := main(); {171#true} is VALID [2022-04-07 12:25:20,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} ~a~0 := 6;~a~0 := 0; {197#(<= main_~a~0 0)} is VALID [2022-04-07 12:25:20,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#(<= main_~a~0 0)} assume !!(~a~0 < 6); {197#(<= main_~a~0 0)} is VALID [2022-04-07 12:25:20,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#(<= main_~a~0 0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {177#(<= main_~a~0 1)} is VALID [2022-04-07 12:25:20,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {177#(<= main_~a~0 1)} assume !(~a~0 < 6); {172#false} is VALID [2022-04-07 12:25:20,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {172#false} assume !(6 == ~a~0); {172#false} is VALID [2022-04-07 12:25:20,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-04-07 12:25:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:25:20,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:25:20,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-04-07 12:25:20,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {172#false} assume !(6 == ~a~0); {172#false} is VALID [2022-04-07 12:25:20,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#(< main_~a~0 6)} assume !(~a~0 < 6); {172#false} is VALID [2022-04-07 12:25:20,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(< main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {219#(< main_~a~0 6)} is VALID [2022-04-07 12:25:20,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(< main_~a~0 5)} assume !!(~a~0 < 6); {223#(< main_~a~0 5)} is VALID [2022-04-07 12:25:20,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} ~a~0 := 6;~a~0 := 0; {223#(< main_~a~0 5)} is VALID [2022-04-07 12:25:20,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret5 := main(); {171#true} is VALID [2022-04-07 12:25:20,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #32#return; {171#true} is VALID [2022-04-07 12:25:20,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-07 12:25:20,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {171#true} is VALID [2022-04-07 12:25:20,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {171#true} is VALID [2022-04-07 12:25:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:25:20,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834283018] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:25:20,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 12:25:20,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-07 12:25:20,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921516804] [2022-04-07 12:25:20,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 12:25:20,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 12:25:20,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:25:20,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 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-07 12:25:20,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:20,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:25:20,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:25:20,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:25:20,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:25:20,452 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 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-07 12:25:20,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:20,581 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-07 12:25:20,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:25:20,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 12:25:20,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:25:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 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-07 12:25:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-07 12:25:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 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-07 12:25:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-07 12:25:20,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 23 transitions. [2022-04-07 12:25:20,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:20,615 INFO L225 Difference]: With dead ends: 21 [2022-04-07 12:25:20,615 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 12:25:20,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:25:20,619 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:25:20,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 26 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:25:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 12:25:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-07 12:25:20,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:25:20,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:20,631 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:20,631 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:20,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:20,633 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-07 12:25:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-07 12:25:20,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:20,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:20,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-07 12:25:20,636 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-07 12:25:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:20,638 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-07 12:25:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-07 12:25:20,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:20,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:20,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:25:20,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:25:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-07 12:25:20,642 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2022-04-07 12:25:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:25:20,642 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-07 12:25:20,643 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (3), 2 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-07 12:25:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-07 12:25:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:25:20,644 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:25:20,644 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:25:20,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 12:25:20,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:25:20,867 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:25:20,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:25:20,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1240133887, now seen corresponding path program 2 times [2022-04-07 12:25:20,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:25:20,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622458185] [2022-04-07 12:25:20,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:25:20,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:25:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:20,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:25:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:25:20,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {348#true} is VALID [2022-04-07 12:25:20,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-07 12:25:20,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #32#return; {348#true} is VALID [2022-04-07 12:25:20,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:25:20,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {348#true} is VALID [2022-04-07 12:25:20,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-07 12:25:20,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #32#return; {348#true} is VALID [2022-04-07 12:25:20,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret5 := main(); {348#true} is VALID [2022-04-07 12:25:20,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} ~a~0 := 6;~a~0 := 0; {348#true} is VALID [2022-04-07 12:25:20,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {348#true} assume !!(~a~0 < 6); {348#true} is VALID [2022-04-07 12:25:20,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#true} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {348#true} is VALID [2022-04-07 12:25:20,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {348#true} assume !!(~a~0 < 6); {348#true} is VALID [2022-04-07 12:25:20,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {348#true} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {348#true} is VALID [2022-04-07 12:25:20,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {348#true} assume !!(~a~0 < 6); {348#true} is VALID [2022-04-07 12:25:20,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {348#true} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {348#true} is VALID [2022-04-07 12:25:20,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {348#true} assume !!(~a~0 < 6); {353#(<= main_~a~0 5)} is VALID [2022-04-07 12:25:20,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {353#(<= main_~a~0 5)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {354#(<= main_~a~0 6)} is VALID [2022-04-07 12:25:20,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {354#(<= main_~a~0 6)} assume !(~a~0 < 6); {355#(and (<= main_~a~0 6) (< 5 main_~a~0))} is VALID [2022-04-07 12:25:20,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {355#(and (<= main_~a~0 6) (< 5 main_~a~0))} assume !(6 == ~a~0); {349#false} is VALID [2022-04-07 12:25:20,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-07 12:25:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-07 12:25:20,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:25:20,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622458185] [2022-04-07 12:25:20,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622458185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:25:20,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:25:20,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 12:25:20,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102452607] [2022-04-07 12:25:20,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:25:20,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 12:25:20,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:25:20,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:20,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:20,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:25:20,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:25:20,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:25:20,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:25:20,975 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:21,044 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-07 12:25:21,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:25:21,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 12:25:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:25:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-07 12:25:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-07 12:25:21,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 12 transitions. [2022-04-07 12:25:21,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:25:21,060 INFO L225 Difference]: With dead ends: 18 [2022-04-07 12:25:21,061 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 12:25:21,063 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-07 12:25:21,068 INFO L913 BasicCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:25:21,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 18 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:25:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 12:25:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 12:25:21,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:25:21,070 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-07 12:25:21,070 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-07 12:25:21,070 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-07 12:25:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:21,070 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:25:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:25:21,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:21,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:21,071 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-07 12:25:21,071 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-07 12:25:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:25:21,071 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:25:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:25:21,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:21,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:25:21,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:25:21,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:25:21,072 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-07 12:25:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 12:25:21,072 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-07 12:25:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:25:21,072 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 12:25:21,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 12:25:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:25:21,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:25:21,075 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 12:25:21,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 12:25:21,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 12:25:21,134 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-07 12:25:21,135 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-07 12:25:21,135 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-07 12:25:21,135 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:25:21,135 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-07 12:25:21,135 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:25:21,135 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:25:21,135 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 12:25:21,136 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 12:25:21,136 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:25:21,136 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 23) no Hoare annotation was computed. [2022-04-07 12:25:21,136 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 15 26) the Hoare annotation is: true [2022-04-07 12:25:21,136 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 15 26) no Hoare annotation was computed. [2022-04-07 12:25:21,136 INFO L882 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-04-07 12:25:21,136 INFO L882 garLoopResultBuilder]: For program point L22-1(lines 22 24) no Hoare annotation was computed. [2022-04-07 12:25:21,136 INFO L882 garLoopResultBuilder]: For program point L19-2(lines 19 21) no Hoare annotation was computed. [2022-04-07 12:25:21,136 INFO L878 garLoopResultBuilder]: At program point L19-3(lines 19 21) the Hoare annotation is: (<= main_~a~0 6) [2022-04-07 12:25:21,137 INFO L882 garLoopResultBuilder]: For program point L19-4(lines 15 26) no Hoare annotation was computed. [2022-04-07 12:25:21,137 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 15 26) no Hoare annotation was computed. [2022-04-07 12:25:21,139 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-07 12:25:21,141 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 12:25:21,144 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 12:25:21,144 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:25:21,146 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 12:25:21,146 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:25:21,146 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:25:21,146 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2022-04-07 12:25:21,146 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2022-04-07 12:25:21,146 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-07 12:25:21,146 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 12:25:21,146 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:25:21,146 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2022-04-07 12:25:21,146 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2022-04-07 12:25:21,147 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-07 12:25:21,147 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 12:25:21,147 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 12:25:21,147 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-07 12:25:21,147 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 12:25:21,147 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 12:25:21,147 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 12:25:21,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:25:21 BoogieIcfgContainer [2022-04-07 12:25:21,153 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 12:25:21,155 INFO L158 Benchmark]: Toolchain (without parser) took 2247.71ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 126.9MB in the beginning and 107.0MB in the end (delta: 19.8MB). Peak memory consumption was 73.8MB. Max. memory is 8.0GB. [2022-04-07 12:25:21,155 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 12:25:21,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.29ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 126.6MB in the beginning and 212.9MB in the end (delta: -86.3MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2022-04-07 12:25:21,155 INFO L158 Benchmark]: Boogie Preprocessor took 21.69ms. Allocated memory is still 240.1MB. Free memory was 212.9MB in the beginning and 211.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 12:25:21,156 INFO L158 Benchmark]: RCFGBuilder took 193.24ms. Allocated memory is still 240.1MB. Free memory was 211.4MB in the beginning and 200.9MB in the end (delta: 10.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-07 12:25:21,156 INFO L158 Benchmark]: TraceAbstraction took 1810.11ms. Allocated memory is still 240.1MB. Free memory was 200.4MB in the beginning and 107.0MB in the end (delta: 93.3MB). Peak memory consumption was 93.3MB. Max. memory is 8.0GB. [2022-04-07 12:25:21,157 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 186.6MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.29ms. Allocated memory was 186.6MB in the beginning and 240.1MB in the end (delta: 53.5MB). Free memory was 126.6MB in the beginning and 212.9MB in the end (delta: -86.3MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.69ms. Allocated memory is still 240.1MB. Free memory was 212.9MB in the beginning and 211.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 193.24ms. Allocated memory is still 240.1MB. Free memory was 211.4MB in the beginning and 200.9MB in the end (delta: 10.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1810.11ms. Allocated memory is still 240.1MB. Free memory was 200.4MB in the beginning and 107.0MB in the end (delta: 93.3MB). Peak memory consumption was 93.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: 23]: 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 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 40 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=3, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 9 NumberOfFragments, 13 HoareAnnotationTreeSize, 5 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 13 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 47 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 16/19 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: a <= 6 RESULT: Ultimate proved your program to be correct! [2022-04-07 12:25:21,190 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...