./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/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 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:49:08,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:49:08,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:49:08,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:49:08,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:49:08,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:49:08,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:49:08,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:49:08,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:49:08,821 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:49:08,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:49:08,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:49:08,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:49:08,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:49:08,822 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:49:08,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:49:08,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:49:08,823 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:49:08,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:49:08,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:49:08,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:49:08,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:49:08,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:49:08,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:49:08,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:49:08,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:49:08,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:49:08,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:49:08,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:49:08,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:49:08,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:49:08,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:49:08,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:49:08,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:49:08,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:49:08,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:49:08,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:49:08,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:49:08,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:49:08,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:49:08,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:49:08,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:49:08,832 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 [2024-11-08 13:49:09,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:49:09,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:49:09,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:49:09,122 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:49:09,122 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:49:09,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_add-1.i [2024-11-08 13:49:10,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:49:10,767 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:49:10,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-1.i [2024-11-08 13:49:10,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc6207cd/d738f54153d448c4b0855597e050fa13/FLAG2d0b0b5b8 [2024-11-08 13:49:10,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc6207cd/d738f54153d448c4b0855597e050fa13 [2024-11-08 13:49:10,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:49:10,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:49:10,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:49:10,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:49:10,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:49:10,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:49:10" (1/1) ... [2024-11-08 13:49:10,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78421937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:10, skipping insertion in model container [2024-11-08 13:49:10,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:49:10" (1/1) ... [2024-11-08 13:49:10,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:49:11,229 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-1.i[25792,25805] [2024-11-08 13:49:11,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:49:11,247 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:49:11,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_add-1.i[25792,25805] [2024-11-08 13:49:11,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:49:11,348 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:49:11,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11 WrapperNode [2024-11-08 13:49:11,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:49:11,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:49:11,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:49:11,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:49:11,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11" (1/1) ... [2024-11-08 13:49:11,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11" (1/1) ... [2024-11-08 13:49:11,389 INFO L138 Inliner]: procedures = 135, calls = 46, calls flagged for inlining = 11, calls inlined = 7, statements flattened = 56 [2024-11-08 13:49:11,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:49:11,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:49:11,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:49:11,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:49:11,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11" (1/1) ... [2024-11-08 13:49:11,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11" (1/1) ... [2024-11-08 13:49:11,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11" (1/1) ... [2024-11-08 13:49:11,421 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 5 writes are split as follows [0, 5]. [2024-11-08 13:49:11,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11" (1/1) ... [2024-11-08 13:49:11,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11" (1/1) ... [2024-11-08 13:49:11,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11" (1/1) ... [2024-11-08 13:49:11,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11" (1/1) ... [2024-11-08 13:49:11,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11" (1/1) ... [2024-11-08 13:49:11,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11" (1/1) ... [2024-11-08 13:49:11,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:49:11,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:49:11,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:49:11,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:49:11,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11" (1/1) ... [2024-11-08 13:49:11,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:49:11,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:49:11,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:49:11,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:49:11,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:49:11,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:49:11,518 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-08 13:49:11,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-08 13:49:11,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:49:11,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:49:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:49:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:49:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:49:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:49:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-08 13:49:11,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-08 13:49:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:49:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:49:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:49:11,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:49:11,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:49:11,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:49:11,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:49:11,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:49:11,640 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:49:11,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:49:11,804 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-08 13:49:11,804 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:49:11,823 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:49:11,823 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 13:49:11,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:49:11 BoogieIcfgContainer [2024-11-08 13:49:11,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:49:11,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:49:11,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:49:11,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:49:11,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:49:10" (1/3) ... [2024-11-08 13:49:11,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6721e2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:49:11, skipping insertion in model container [2024-11-08 13:49:11,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:11" (2/3) ... [2024-11-08 13:49:11,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6721e2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:49:11, skipping insertion in model container [2024-11-08 13:49:11,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:49:11" (3/3) ... [2024-11-08 13:49:11,831 INFO L112 eAbstractionObserver]: Analyzing ICFG test_add-1.i [2024-11-08 13:49:11,845 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:49:11,845 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:49:11,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:49:11,898 INFO L333 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, 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;@465b312a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:49:11,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:49:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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) [2024-11-08 13:49:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 13:49:11,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:11,910 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:11,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:11,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1385480168, now seen corresponding path program 1 times [2024-11-08 13:49:11,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:11,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876417607] [2024-11-08 13:49:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:11,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:12,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:49:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:12,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 13:49:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:49:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:12,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876417607] [2024-11-08 13:49:12,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876417607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:49:12,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687292155] [2024-11-08 13:49:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:12,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:49:12,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:49:12,600 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) [2024-11-08 13:49:12,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:49:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:12,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 13:49:12,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:49:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:12,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:49:12,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687292155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:49:12,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 13:49:12,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-11-08 13:49:12,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279622406] [2024-11-08 13:49:12,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:49:12,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:49:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:13,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:49:13,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 13:49:13,007 INFO L87 Difference]: Start difference. First operand has 31 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 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 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-11-08 13:49:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:13,247 INFO L93 Difference]: Finished difference Result 84 states and 106 transitions. [2024-11-08 13:49:13,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:49:13,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2024-11-08 13:49:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:13,258 INFO L225 Difference]: With dead ends: 84 [2024-11-08 13:49:13,259 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 13:49:13,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-08 13:49:13,268 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 64 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:13,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 119 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:49:13,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 13:49:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2024-11-08 13:49:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:49:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-08 13:49:13,318 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 20 [2024-11-08 13:49:13,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:13,319 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-08 13:49:13,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-11-08 13:49:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-08 13:49:13,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 13:49:13,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:13,322 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:13,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 13:49:13,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-08 13:49:13,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:13,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:13,525 INFO L85 PathProgramCache]: Analyzing trace with hash 23912952, now seen corresponding path program 1 times [2024-11-08 13:49:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:13,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150177500] [2024-11-08 13:49:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:13,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:49:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:13,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 13:49:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:49:13,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:13,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150177500] [2024-11-08 13:49:13,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150177500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:49:13,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164874452] [2024-11-08 13:49:13,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:13,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:49:13,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:49:13,635 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) [2024-11-08 13:49:13,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 13:49:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:13,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 13:49:13,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:49:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:13,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:49:13,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164874452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:49:13,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 13:49:13,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-08 13:49:13,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901172513] [2024-11-08 13:49:13,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:49:13,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:49:13,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:13,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:49:13,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:49:13,725 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-08 13:49:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:13,744 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-11-08 13:49:13,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:49:13,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 20 [2024-11-08 13:49:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:13,747 INFO L225 Difference]: With dead ends: 45 [2024-11-08 13:49:13,748 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 13:49:13,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:49:13,749 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:13,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:49:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 13:49:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-11-08 13:49:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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) [2024-11-08 13:49:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-08 13:49:13,756 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 20 [2024-11-08 13:49:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:13,757 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-08 13:49:13,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-08 13:49:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-08 13:49:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 13:49:13,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:13,759 INFO L215 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, 1, 1, 1, 1] [2024-11-08 13:49:13,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 13:49:13,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-08 13:49:13,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:13,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash -4137308, now seen corresponding path program 1 times [2024-11-08 13:49:13,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:13,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544304754] [2024-11-08 13:49:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:49:14,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 13:49:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:49:14,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 13:49:14,086 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 13:49:14,087 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 13:49:14,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:49:14,092 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 13:49:14,128 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 13:49:14,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 01:49:14 BoogieIcfgContainer [2024-11-08 13:49:14,133 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 13:49:14,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 13:49:14,134 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 13:49:14,134 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 13:49:14,135 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:49:11" (3/4) ... [2024-11-08 13:49:14,136 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 13:49:14,189 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 13:49:14,189 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 13:49:14,193 INFO L158 Benchmark]: Toolchain (without parser) took 3390.62ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 141.9MB in the beginning and 129.2MB in the end (delta: 12.7MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2024-11-08 13:49:14,194 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:49:14,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.47ms. Allocated memory is still 172.0MB. Free memory was 141.2MB in the beginning and 119.5MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 13:49:14,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.59ms. Allocated memory is still 172.0MB. Free memory was 119.5MB in the beginning and 118.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:49:14,195 INFO L158 Benchmark]: Boogie Preprocessor took 47.60ms. Allocated memory is still 172.0MB. Free memory was 117.4MB in the beginning and 115.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:49:14,195 INFO L158 Benchmark]: RCFGBuilder took 385.52ms. Allocated memory is still 172.0MB. Free memory was 115.2MB in the beginning and 99.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 13:49:14,195 INFO L158 Benchmark]: TraceAbstraction took 2307.40ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 98.5MB in the beginning and 132.4MB in the end (delta: -33.9MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2024-11-08 13:49:14,196 INFO L158 Benchmark]: Witness Printer took 55.52ms. Allocated memory is still 207.6MB. Free memory was 132.4MB in the beginning and 129.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 13:49:14,200 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.18ms. Allocated memory is still 121.6MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.47ms. Allocated memory is still 172.0MB. Free memory was 141.2MB in the beginning and 119.5MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.59ms. Allocated memory is still 172.0MB. Free memory was 119.5MB in the beginning and 118.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.60ms. Allocated memory is still 172.0MB. Free memory was 117.4MB in the beginning and 115.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.52ms. Allocated memory is still 172.0MB. Free memory was 115.2MB in the beginning and 99.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2307.40ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 98.5MB in the beginning and 132.4MB in the end (delta: -33.9MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. * Witness Printer took 55.52ms. Allocated memory is still 207.6MB. Free memory was 132.4MB in the beginning and 129.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 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) }; [L662] struct ldv_list_head s1 = { &(s1), &(s1) }; [L662] struct ldv_list_head s1 = { &(s1), &(s1) }; VAL [s1={3:0}] [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)=-1, \old(s)={3:0}, s1={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] 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)=-1, \old(s)={3:0}, e=-1, s1={3:0}] [L657] return 0; VAL [\old(e)=-1, \old(s)={3:0}, \result=0, e=-1, s1={3:0}] [L633] RET, EXPR ldv_is_in_set(new, s) VAL [new=-1, s1={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 [s1={3:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\result={-2:0}, s1={3:0}] [L635] RET, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) [L635] le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)) [L636] le->e = new [L637] CALL ldv_list_add(&le->list, s) [L605] EXPR head->next VAL [s1={3:0}] [L605] CALL __ldv_list_add(new, head, head->next) VAL [\old(new)={-2:4}, \old(next)={3:0}, \old(prev)={3:0}, s1={3:0}] [L593] next->prev = new [L594] new->next = next [L595] new->prev = prev [L596] prev->next = new VAL [\old(new)={-2:4}, \old(next)={3:0}, \old(prev)={3:0}, s1={3:0}] [L605] RET __ldv_list_add(new, head, head->next) VAL [head={3:0}, new={-2:4}, s1={3:0}] [L637] RET ldv_list_add(&le->list, s) [L666] RET ldv_set_add(j, &s1) [L667] CALL ldv_is_in_set(j, &s1) VAL [\old(e)=-1, \old(s)={3:0}, s1={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] 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)=-1, \old(s)={3:0}, e=-1, m={-2:0}, s1={3:0}, s={3:0}] [L653] COND TRUE m->e == e [L654] return 1; VAL [\old(e)=-1, \old(s)={3:0}, \result=1, m={-2:0}, s1={3:0}, s={3:0}] [L667] RET ldv_is_in_set(j, &s1) VAL [j=-1, s1={3:0}] [L667] COND TRUE ldv_is_in_set(j, &s1) [L667] reach_error() VAL [j=-1, s1={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 65 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=1, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 379 SizeOfPredicates, 6 NumberOfNonLiveVariables, 220 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 14/20 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! [2024-11-08 13:49:14,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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