./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-sets/test_add-1.i --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/ldv-sets/test_add-1.i -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 ed7fc1ee8e8624c54bbfaff1033820d20aa5fb88ac8eae06fb8e7107f72c3762 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 20:58:01,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 20:58:01,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 20:58:01,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 20:58:01,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 20:58:01,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 20:58:01,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 20:58:01,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 20:58:01,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 20:58:01,799 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 20:58:01,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 20:58:01,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 20:58:01,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 20:58:01,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 20:58:01,802 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 20:58:01,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 20:58:01,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 20:58:01,802 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 20:58:01,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 20:58:01,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 20:58:01,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 20:58:01,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 20:58:01,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 20:58:01,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 20:58:01,804 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 20:58:01,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 20:58:01,804 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 20:58:01,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 20:58:01,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 20:58:01,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 20:58:01,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 20:58:01,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 20:58:01,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 20:58:01,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 20:58:01,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 20:58:01,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 20:58:01,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 20:58:01,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 20:58:01,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 20:58:01,808 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 20:58:01,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 20:58:01,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 20:58:01,809 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 -> ed7fc1ee8e8624c54bbfaff1033820d20aa5fb88ac8eae06fb8e7107f72c3762 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 20:58:02,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 20:58:02,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 20:58:02,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 20:58:02,038 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 20:58:02,039 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 20:58:02,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_add-1.i [2023-11-22 20:58:03,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 20:58:03,230 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 20:58:03,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_add-1.i [2023-11-22 20:58:03,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dfb773f3/2bf32b680904443da22bb2eeaf8a3bc8/FLAG7db7e0df5 [2023-11-22 20:58:03,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dfb773f3/2bf32b680904443da22bb2eeaf8a3bc8 [2023-11-22 20:58:03,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 20:58:03,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 20:58:03,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 20:58:03,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 20:58:03,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 20:58:03,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:58:03" (1/1) ... [2023-11-22 20:58:03,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f4efc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03, skipping insertion in model container [2023-11-22 20:58:03,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:58:03" (1/1) ... [2023-11-22 20:58:03,304 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 20:58:03,531 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_add-1.i[25792,25805] [2023-11-22 20:58:03,535 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 20:58:03,542 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 20:58:03,590 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_add-1.i[25792,25805] [2023-11-22 20:58:03,591 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 20:58:03,613 INFO L206 MainTranslator]: Completed translation [2023-11-22 20:58:03,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03 WrapperNode [2023-11-22 20:58:03,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 20:58:03,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 20:58:03,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 20:58:03,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 20:58:03,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03" (1/1) ... [2023-11-22 20:58:03,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03" (1/1) ... [2023-11-22 20:58:03,645 INFO L138 Inliner]: procedures = 135, calls = 46, calls flagged for inlining = 11, calls inlined = 7, statements flattened = 56 [2023-11-22 20:58:03,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 20:58:03,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 20:58:03,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 20:58:03,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 20:58:03,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03" (1/1) ... [2023-11-22 20:58:03,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03" (1/1) ... [2023-11-22 20:58:03,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03" (1/1) ... [2023-11-22 20:58:03,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03" (1/1) ... [2023-11-22 20:58:03,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03" (1/1) ... [2023-11-22 20:58:03,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03" (1/1) ... [2023-11-22 20:58:03,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03" (1/1) ... [2023-11-22 20:58:03,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03" (1/1) ... [2023-11-22 20:58:03,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 20:58:03,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 20:58:03,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 20:58:03,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 20:58:03,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03" (1/1) ... [2023-11-22 20:58:03,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 20:58:03,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:58:03,694 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 20:58:03,699 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 20:58:03,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 20:58:03,735 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-11-22 20:58:03,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-11-22 20:58:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 20:58:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 20:58:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 20:58:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 20:58:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-11-22 20:58:03,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-11-22 20:58:03,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 20:58:03,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-22 20:58:03,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 20:58:03,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 20:58:03,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 20:58:03,822 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 20:58:03,823 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 20:58:03,997 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 20:58:04,025 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 20:58:04,025 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 20:58:04,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:58:04 BoogieIcfgContainer [2023-11-22 20:58:04,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 20:58:04,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 20:58:04,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 20:58:04,029 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 20:58:04,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:58:03" (1/3) ... [2023-11-22 20:58:04,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3dd3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:58:04, skipping insertion in model container [2023-11-22 20:58:04,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:03" (2/3) ... [2023-11-22 20:58:04,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3dd3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:58:04, skipping insertion in model container [2023-11-22 20:58:04,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:58:04" (3/3) ... [2023-11-22 20:58:04,032 INFO L112 eAbstractionObserver]: Analyzing ICFG test_add-1.i [2023-11-22 20:58:04,047 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 20:58:04,047 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 20:58:04,081 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 20:58:04,086 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;@54088be0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 20:58:04,086 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 20:58:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 20:58:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 20:58:04,095 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:58:04,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:58:04,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:58:04,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:58:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1189995814, now seen corresponding path program 1 times [2023-11-22 20:58:04,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:58:04,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447813692] [2023-11-22 20:58:04,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:58:04,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:58:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:04,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:58:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:04,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 20:58:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-22 20:58:04,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:58:04,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447813692] [2023-11-22 20:58:04,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447813692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:58:04,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 20:58:04,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 20:58:04,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844801609] [2023-11-22 20:58:04,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:58:04,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 20:58:04,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:58:04,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 20:58:04,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 20:58:04,315 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 20:58:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:58:04,355 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2023-11-22 20:58:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 20:58:04,358 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-22 20:58:04,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:58:04,363 INFO L225 Difference]: With dead ends: 46 [2023-11-22 20:58:04,363 INFO L226 Difference]: Without dead ends: 22 [2023-11-22 20:58:04,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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 20:58:04,370 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 20:58:04,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 20:58:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-22 20:58:04,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-22 20:58:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 20:58:04,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-22 20:58:04,405 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2023-11-22 20:58:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:58:04,406 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-22 20:58:04,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 20:58:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-22 20:58:04,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 20:58:04,407 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:58:04,407 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:58:04,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 20:58:04,408 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:58:04,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:58:04,409 INFO L85 PathProgramCache]: Analyzing trace with hash -664723558, now seen corresponding path program 1 times [2023-11-22 20:58:04,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:58:04,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019597322] [2023-11-22 20:58:04,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:58:04,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:58:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:04,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:58:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:04,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 20:58:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 20:58:04,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:58:04,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019597322] [2023-11-22 20:58:04,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019597322] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:58:04,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063878543] [2023-11-22 20:58:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:58:04,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:58:04,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:58:04,540 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 20:58:04,591 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 20:58:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:04,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 20:58:04,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:58:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 20:58:04,714 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 20:58:04,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063878543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:58:04,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 20:58:04,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-22 20:58:04,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585821741] [2023-11-22 20:58:04,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:58:04,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 20:58:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:58:04,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 20:58:04,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 20:58:04,724 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2023-11-22 20:58:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:58:04,764 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2023-11-22 20:58:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 20:58:04,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 19 [2023-11-22 20:58:04,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:58:04,767 INFO L225 Difference]: With dead ends: 38 [2023-11-22 20:58:04,767 INFO L226 Difference]: Without dead ends: 26 [2023-11-22 20:58:04,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 20:58:04,770 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 20:58:04,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 20:58:04,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-22 20:58:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-22 20:58:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-22 20:58:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-22 20:58:04,782 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2023-11-22 20:58:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:58:04,782 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-22 20:58:04,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2023-11-22 20:58:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-22 20:58:04,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 20:58:04,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:58:04,785 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 20:58:04,799 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 20:58:04,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:58:04,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:58:04,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:58:04,996 INFO L85 PathProgramCache]: Analyzing trace with hash 646247313, now seen corresponding path program 1 times [2023-11-22 20:58:04,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:58:04,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986882665] [2023-11-22 20:58:04,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:58:04,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:58:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:05,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:58:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:05,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 20:58:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 20:58:05,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:58:05,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986882665] [2023-11-22 20:58:05,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986882665] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:58:05,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265481276] [2023-11-22 20:58:05,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:58:05,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:58:05,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:58:05,294 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 20:58:05,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 20:58:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:05,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 20:58:05,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:58:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 20:58:05,365 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 20:58:05,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265481276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:58:05,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 20:58:05,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-11-22 20:58:05,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414934394] [2023-11-22 20:58:05,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:58:05,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 20:58:05,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:58:05,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 20:58:05,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-22 20:58:05,367 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 20:58:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:58:05,393 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-11-22 20:58:05,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 20:58:05,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-22 20:58:05,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:58:05,395 INFO L225 Difference]: With dead ends: 30 [2023-11-22 20:58:05,395 INFO L226 Difference]: Without dead ends: 26 [2023-11-22 20:58:05,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-22 20:58:05,396 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 20:58:05,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 20:58:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-22 20:58:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-22 20:58:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-22 20:58:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-11-22 20:58:05,399 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 19 [2023-11-22 20:58:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:58:05,399 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-11-22 20:58:05,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 20:58:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-11-22 20:58:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 20:58:05,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:58:05,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:58:05,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 20:58:05,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-22 20:58:05,612 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:58:05,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:58:05,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2074116678, now seen corresponding path program 1 times [2023-11-22 20:58:05,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:58:05,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6558795] [2023-11-22 20:58:05,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:58:05,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:58:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:05,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 20:58:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:05,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 20:58:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 20:58:05,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 20:58:05,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6558795] [2023-11-22 20:58:05,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6558795] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 20:58:05,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470796760] [2023-11-22 20:58:05,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:58:05,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:58:05,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 20:58:05,802 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 20:58:05,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 20:58:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 20:58:05,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-22 20:58:05,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 20:58:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 20:58:05,973 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 20:58:05,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470796760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 20:58:05,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 20:58:05,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2023-11-22 20:58:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664453083] [2023-11-22 20:58:05,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 20:58:05,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 20:58:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 20:58:05,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 20:58:05,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-22 20:58:05,975 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 20:58:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 20:58:06,072 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2023-11-22 20:58:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 20:58:06,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-22 20:58:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 20:58:06,074 INFO L225 Difference]: With dead ends: 63 [2023-11-22 20:58:06,074 INFO L226 Difference]: Without dead ends: 26 [2023-11-22 20:58:06,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-22 20:58:06,077 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 20:58:06,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 73 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 20:58:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-22 20:58:06,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-22 20:58:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 20:58:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2023-11-22 20:58:06,087 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2023-11-22 20:58:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 20:58:06,087 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2023-11-22 20:58:06,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 20:58:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2023-11-22 20:58:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 20:58:06,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 20:58:06,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 20:58:06,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-22 20:58:06,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 20:58:06,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 20:58:06,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 20:58:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash -499984423, now seen corresponding path program 1 times [2023-11-22 20:58:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 20:58:06,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062231347] [2023-11-22 20:58:06,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 20:58:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 20:58:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 20:58:06,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 20:58:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 20:58:06,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 20:58:06,388 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 20:58:06,389 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 20:58:06,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 20:58:06,393 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-22 20:58:06,396 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 20:58:06,425 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated [2023-11-22 20:58:06,426 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem6 [2023-11-22 20:58:06,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem6 [2023-11-22 20:58:06,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated [2023-11-22 20:58:06,428 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret33 could not be translated [2023-11-22 20:58:06,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 08:58:06 BoogieIcfgContainer [2023-11-22 20:58:06,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 20:58:06,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 20:58:06,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 20:58:06,439 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 20:58:06,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:58:04" (3/4) ... [2023-11-22 20:58:06,440 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-22 20:58:06,446 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated [2023-11-22 20:58:06,451 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem6 [2023-11-22 20:58:06,452 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem6 [2023-11-22 20:58:06,452 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated [2023-11-22 20:58:06,452 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret33 could not be translated [2023-11-22 20:58:06,477 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 20:58:06,477 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 20:58:06,478 INFO L158 Benchmark]: Toolchain (without parser) took 3210.61ms. Allocated memory is still 169.9MB. Free memory was 103.1MB in the beginning and 116.1MB in the end (delta: -13.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 20:58:06,478 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 20:58:06,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.92ms. Allocated memory is still 169.9MB. Free memory was 103.1MB in the beginning and 129.1MB in the end (delta: -26.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 20:58:06,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.68ms. Allocated memory is still 169.9MB. Free memory was 129.1MB in the beginning and 127.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 20:58:06,478 INFO L158 Benchmark]: Boogie Preprocessor took 20.47ms. Allocated memory is still 169.9MB. Free memory was 127.1MB in the beginning and 125.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 20:58:06,479 INFO L158 Benchmark]: RCFGBuilder took 358.62ms. Allocated memory is still 169.9MB. Free memory was 125.9MB in the beginning and 109.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-22 20:58:06,479 INFO L158 Benchmark]: TraceAbstraction took 2410.82ms. Allocated memory is still 169.9MB. Free memory was 108.2MB in the beginning and 118.2MB in the end (delta: -10.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 20:58:06,479 INFO L158 Benchmark]: Witness Printer took 39.07ms. Allocated memory is still 169.9MB. Free memory was 118.2MB in the beginning and 116.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 20:58:06,480 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.15ms. Allocated memory is still 96.5MB. Free memory is still 43.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.92ms. Allocated memory is still 169.9MB. Free memory was 103.1MB in the beginning and 129.1MB in the end (delta: -26.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.68ms. Allocated memory is still 169.9MB. Free memory was 129.1MB in the beginning and 127.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.47ms. Allocated memory is still 169.9MB. Free memory was 127.1MB in the beginning and 125.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 358.62ms. Allocated memory is still 169.9MB. Free memory was 125.9MB in the beginning and 109.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2410.82ms. Allocated memory is still 169.9MB. Free memory was 108.2MB in the beginning and 118.2MB in the end (delta: -10.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 39.07ms. Allocated memory is still 169.9MB. Free memory was 118.2MB in the beginning and 116.1MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret33 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret33 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 667]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L662] struct ldv_list_head s1 = { &(s1), &(s1) }; [L671] CALL foo() [L665] int j = __VERIFIER_nondet_int(); [L666] CALL ldv_set_add(j, &s1) [L633] CALL, EXPR ldv_is_in_set(new, s) VAL [\old(e)=0, s1={3:0}, s={3:0}] [L651] struct ldv_list_element *m; [L652] EXPR (s)->next [L652] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L652] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [L652] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [L652] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) [L652] COND FALSE !(&m->list != (s)) VAL [\old(e)=0, e=0, m={3:-4}, s1={3:0}, s={3:0}, s={3:0}] [L657] return 0; VAL [\old(e)=0, \result=0, e=0, m={3:-4}, s1={3:0}, s={3:0}, s={3:0}] [L633] RET, EXPR ldv_is_in_set(new, s) VAL [\old(new)=0, new=0, s1={3:0}, s={3:0}, s={3:0}] [L633] COND TRUE !ldv_is_in_set(new, s) [L634] struct ldv_list_element *le; [L635] CALL, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) [L576] void *ptr = malloc(size); [L577] CALL assume_abort_if_not(ptr!=0) [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, s1={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; [L635] RET, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) [L635] EXPR le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)) [L636] EXPR le->e = new [L637] CALL, EXPR ldv_list_add(&le->list, s) [L605] EXPR head->next VAL [head={3:0}, head={3:0}, new={-1:4}, new={-1:4}, s1={3:0}] [L605] CALL __ldv_list_add(new, head, head->next) VAL [new={-1:4}, next={3:0}, prev={3:0}, s1={3:0}] [L593] next->prev = new [L594] new->next = next [L595] new->prev = prev [L596] prev->next = new [L605] RET __ldv_list_add(new, head, head->next) VAL [head={3:0}, head={3:0}, new={-1:4}, new={-1:4}, s1={3:0}] [L637] RET, EXPR ldv_list_add(&le->list, s) [L633-L638] { struct ldv_list_element *le; le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)); le->e = new; ldv_list_add(&le->list, s); } VAL [\old(new)=0, new=0, s1={3:0}, s={3:0}, s={3:0}] [L666] RET ldv_set_add(j, &s1) [L667] CALL ldv_is_in_set(j, &s1) VAL [\old(e)=0, s1={3:0}, s={3:0}] [L651] struct ldv_list_element *m; [L652] EXPR (s)->next [L652] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L652] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [L652] { const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );} [L652] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) [L652] COND TRUE &m->list != (s) [L653] EXPR m->e VAL [\old(e)=0, e=0, m={-1:0}, s1={3:0}, s={3:0}, s={3:0}] [L653] COND TRUE m->e == e [L654] return 1; VAL [\old(e)=0, \result=1, e=0, m={-1:0}, s1={3:0}, s={3:0}, s={3:0}] [L667] RET ldv_is_in_set(j, &s1) VAL [j=0, s1={3:0}] [L667] COND TRUE ldv_is_in_set(j, &s1) [L667] reach_error() VAL [j=0, s1={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 77 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 493 SizeOfPredicates, 8 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 24/33 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-22 20:58:06,500 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE