./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/array-fpi/brs3f.c --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/array-fpi/brs3f.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a50ddc0c317f6668332af6451167549968b4421299586257d39221cfadcc25e --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 23:57:07,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 23:57:07,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 23:57:07,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 23:57:07,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 23:57:07,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 23:57:07,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 23:57:07,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 23:57:07,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 23:57:07,154 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 23:57:07,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 23:57:07,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 23:57:07,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 23:57:07,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 23:57:07,156 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 23:57:07,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 23:57:07,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 23:57:07,157 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 23:57:07,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 23:57:07,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 23:57:07,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 23:57:07,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 23:57:07,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 23:57:07,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 23:57:07,161 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 23:57:07,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 23:57:07,161 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 23:57:07,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 23:57:07,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 23:57:07,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 23:57:07,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 23:57:07,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:57:07,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 23:57:07,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 23:57:07,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 23:57:07,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 23:57:07,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 23:57:07,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 23:57:07,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 23:57:07,165 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 23:57:07,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 23:57:07,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 23:57:07,167 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a50ddc0c317f6668332af6451167549968b4421299586257d39221cfadcc25e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 23:57:07,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 23:57:07,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 23:57:07,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 23:57:07,465 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 23:57:07,465 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 23:57:07,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs3f.c [2023-11-22 23:57:08,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 23:57:08,755 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 23:57:08,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs3f.c [2023-11-22 23:57:08,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d40f0f8/23f636920a3243c6a8ab51a26e07813f/FLAG3ec394d34 [2023-11-22 23:57:08,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d40f0f8/23f636920a3243c6a8ab51a26e07813f [2023-11-22 23:57:08,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 23:57:08,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 23:57:08,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 23:57:08,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 23:57:08,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 23:57:08,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:57:08" (1/1) ... [2023-11-22 23:57:08,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8e27e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:08, skipping insertion in model container [2023-11-22 23:57:08,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:57:08" (1/1) ... [2023-11-22 23:57:08,810 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 23:57:08,932 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs3f.c[588,601] [2023-11-22 23:57:08,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:57:08,960 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 23:57:08,976 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs3f.c[588,601] [2023-11-22 23:57:08,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:57:09,002 INFO L206 MainTranslator]: Completed translation [2023-11-22 23:57:09,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:09 WrapperNode [2023-11-22 23:57:09,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 23:57:09,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 23:57:09,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 23:57:09,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 23:57:09,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:09" (1/1) ... [2023-11-22 23:57:09,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:09" (1/1) ... [2023-11-22 23:57:09,048 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2023-11-22 23:57:09,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 23:57:09,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 23:57:09,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 23:57:09,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 23:57:09,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:09" (1/1) ... [2023-11-22 23:57:09,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:09" (1/1) ... [2023-11-22 23:57:09,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:09" (1/1) ... [2023-11-22 23:57:09,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:09" (1/1) ... [2023-11-22 23:57:09,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:09" (1/1) ... [2023-11-22 23:57:09,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:09" (1/1) ... [2023-11-22 23:57:09,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:09" (1/1) ... [2023-11-22 23:57:09,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:09" (1/1) ... [2023-11-22 23:57:09,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 23:57:09,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 23:57:09,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 23:57:09,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 23:57:09,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:09" (1/1) ... [2023-11-22 23:57:09,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:57:09,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:57:09,109 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) [2023-11-22 23:57:09,153 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 [2023-11-22 23:57:09,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 23:57:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 23:57:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 23:57:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 23:57:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 23:57:09,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 23:57:09,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 23:57:09,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 23:57:09,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 23:57:09,265 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 23:57:09,267 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 23:57:09,446 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 23:57:09,466 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 23:57:09,467 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 23:57:09,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:57:09 BoogieIcfgContainer [2023-11-22 23:57:09,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 23:57:09,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 23:57:09,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 23:57:09,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 23:57:09,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:57:08" (1/3) ... [2023-11-22 23:57:09,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5071c75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:57:09, skipping insertion in model container [2023-11-22 23:57:09,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:57:09" (2/3) ... [2023-11-22 23:57:09,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5071c75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:57:09, skipping insertion in model container [2023-11-22 23:57:09,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:57:09" (3/3) ... [2023-11-22 23:57:09,474 INFO L112 eAbstractionObserver]: Analyzing ICFG brs3f.c [2023-11-22 23:57:09,504 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 23:57:09,505 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 23:57:09,537 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 23:57:09,542 INFO L357 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d6ade63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 23:57:09,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 23:57:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 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) [2023-11-22 23:57:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 23:57:09,578 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:57:09,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:57:09,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:57:09,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:57:09,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1256235845, now seen corresponding path program 1 times [2023-11-22 23:57:09,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:57:09,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103246535] [2023-11-22 23:57:09,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:57:09,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:57:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:57:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:57:09,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:57:09,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103246535] [2023-11-22 23:57:09,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103246535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:57:09,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:57:09,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 23:57:09,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253720186] [2023-11-22 23:57:09,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:57:09,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 23:57:09,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:57:09,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 23:57:09,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 23:57:09,814 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 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 has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2023-11-22 23:57:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:57:09,846 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2023-11-22 23:57:09,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 23:57:09,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) Word has length 10 [2023-11-22 23:57:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:57:09,856 INFO L225 Difference]: With dead ends: 33 [2023-11-22 23:57:09,857 INFO L226 Difference]: Without dead ends: 15 [2023-11-22 23:57:09,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 23:57:09,865 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:57:09,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:57:09,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-22 23:57:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-22 23:57:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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) [2023-11-22 23:57:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-11-22 23:57:09,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 10 [2023-11-22 23:57:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:57:09,894 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-11-22 23:57:09,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2023-11-22 23:57:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-11-22 23:57:09,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 23:57:09,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:57:09,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:57:09,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 23:57:09,896 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:57:09,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:57:09,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2065910172, now seen corresponding path program 1 times [2023-11-22 23:57:09,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:57:09,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319122719] [2023-11-22 23:57:09,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:57:09,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:57:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:57:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:57:10,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:57:10,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319122719] [2023-11-22 23:57:10,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319122719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:57:10,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:57:10,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 23:57:10,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12293134] [2023-11-22 23:57:10,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:57:10,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:57:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:57:10,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:57:10,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:57:10,071 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-22 23:57:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:57:10,125 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2023-11-22 23:57:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 23:57:10,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) Word has length 10 [2023-11-22 23:57:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:57:10,126 INFO L225 Difference]: With dead ends: 32 [2023-11-22 23:57:10,126 INFO L226 Difference]: Without dead ends: 21 [2023-11-22 23:57:10,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:57:10,127 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:57:10,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:57:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-22 23:57:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-11-22 23:57:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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) [2023-11-22 23:57:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-11-22 23:57:10,131 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2023-11-22 23:57:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:57:10,131 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-11-22 23:57:10,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-11-22 23:57:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-11-22 23:57:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-22 23:57:10,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:57:10,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:57:10,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 23:57:10,132 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:57:10,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:57:10,133 INFO L85 PathProgramCache]: Analyzing trace with hash 785079709, now seen corresponding path program 1 times [2023-11-22 23:57:10,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:57:10,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77360160] [2023-11-22 23:57:10,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:57:10,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:57:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:57:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 23:57:10,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:57:10,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77360160] [2023-11-22 23:57:10,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77360160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:57:10,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:57:10,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 23:57:10,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344544094] [2023-11-22 23:57:10,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:57:10,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:57:10,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:57:10,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:57:10,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 23:57:10,397 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-11-22 23:57:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:57:10,447 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2023-11-22 23:57:10,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 23:57:10,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) Word has length 16 [2023-11-22 23:57:10,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:57:10,450 INFO L225 Difference]: With dead ends: 26 [2023-11-22 23:57:10,452 INFO L226 Difference]: Without dead ends: 22 [2023-11-22 23:57:10,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-22 23:57:10,457 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:57:10,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 25 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:57:10,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-22 23:57:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2023-11-22 23:57:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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) [2023-11-22 23:57:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-11-22 23:57:10,463 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2023-11-22 23:57:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:57:10,466 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-11-22 23:57:10,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-11-22 23:57:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-11-22 23:57:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 23:57:10,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:57:10,467 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:57:10,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 23:57:10,467 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:57:10,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:57:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash -485999892, now seen corresponding path program 1 times [2023-11-22 23:57:10,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:57:10,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645040660] [2023-11-22 23:57:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:57:10,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:57:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:57:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:57:10,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:57:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645040660] [2023-11-22 23:57:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645040660] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:57:10,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560569708] [2023-11-22 23:57:10,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:57:10,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:57:10,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:57:10,635 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) [2023-11-22 23:57:10,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 23:57:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:57:10,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 23:57:10,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:57:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:57:10,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:57:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 23:57:10,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560569708] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 23:57:10,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 23:57:10,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-22 23:57:10,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568153909] [2023-11-22 23:57:10,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 23:57:10,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 23:57:10,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:57:10,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 23:57:10,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-22 23:57:10,886 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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) [2023-11-22 23:57:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:57:10,989 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-11-22 23:57:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 23:57:10,989 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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) Word has length 19 [2023-11-22 23:57:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:57:10,990 INFO L225 Difference]: With dead ends: 42 [2023-11-22 23:57:10,990 INFO L226 Difference]: Without dead ends: 28 [2023-11-22 23:57:10,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-22 23:57:10,997 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:57:10,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 30 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:57:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-22 23:57:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2023-11-22 23:57:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2023-11-22 23:57:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-11-22 23:57:11,008 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2023-11-22 23:57:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:57:11,008 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-22 23:57:11,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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) [2023-11-22 23:57:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-11-22 23:57:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-22 23:57:11,009 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:57:11,009 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:57:11,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 23:57:11,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:57:11,215 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:57:11,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:57:11,215 INFO L85 PathProgramCache]: Analyzing trace with hash -105964608, now seen corresponding path program 1 times [2023-11-22 23:57:11,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:57:11,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113044050] [2023-11-22 23:57:11,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:57:11,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:57:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 23:57:11,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 23:57:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 23:57:11,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 23:57:11,278 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 23:57:11,279 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 23:57:11,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 23:57:11,284 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-22 23:57:11,287 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 23:57:11,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:57:11 BoogieIcfgContainer [2023-11-22 23:57:11,312 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 23:57:11,313 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 23:57:11,313 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 23:57:11,313 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 23:57:11,314 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:57:09" (3/4) ... [2023-11-22 23:57:11,314 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-22 23:57:11,350 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 23:57:11,350 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 23:57:11,351 INFO L158 Benchmark]: Toolchain (without parser) took 2572.22ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 92.0MB in the beginning and 93.2MB in the end (delta: -1.3MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2023-11-22 23:57:11,351 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 74.2MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:57:11,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.00ms. Allocated memory is still 136.3MB. Free memory was 91.9MB in the beginning and 81.0MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-22 23:57:11,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.19ms. Allocated memory is still 136.3MB. Free memory was 81.0MB in the beginning and 79.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:57:11,352 INFO L158 Benchmark]: Boogie Preprocessor took 18.62ms. Allocated memory is still 136.3MB. Free memory was 79.4MB in the beginning and 78.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 23:57:11,352 INFO L158 Benchmark]: RCFGBuilder took 398.97ms. Allocated memory is still 136.3MB. Free memory was 77.9MB in the beginning and 65.9MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-22 23:57:11,352 INFO L158 Benchmark]: TraceAbstraction took 1843.60ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 65.0MB in the beginning and 95.3MB in the end (delta: -30.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 23:57:11,353 INFO L158 Benchmark]: Witness Printer took 37.51ms. Allocated memory is still 163.6MB. Free memory was 95.3MB in the beginning and 93.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 23:57:11,354 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory was 74.3MB in the beginning and 74.2MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.00ms. Allocated memory is still 136.3MB. Free memory was 91.9MB in the beginning and 81.0MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.19ms. Allocated memory is still 136.3MB. Free memory was 81.0MB in the beginning and 79.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.62ms. Allocated memory is still 136.3MB. Free memory was 79.4MB in the beginning and 78.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.97ms. Allocated memory is still 136.3MB. Free memory was 77.9MB in the beginning and 65.9MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1843.60ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 65.0MB in the beginning and 95.3MB in the end (delta: -30.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 37.51ms. Allocated memory is still 163.6MB. Free memory was 95.3MB in the beginning and 93.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [N=2, \old(cond)=1, cond=1] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long sum[1]; [L29] int *a = malloc(sizeof(int)*N); [L31] i=0 VAL [N=2, a={-1:0}, i=0, sum={9:0}] [L31] COND TRUE i