./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/xcsp/AllInterval-005.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/xcsp/AllInterval-005.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9f3ee9eee9186ec2e7139b6da07915cfbf3926b7d28b3dac4ebf3fd8205beb2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 08:51:59,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 08:51:59,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 08:51:59,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 08:51:59,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 08:51:59,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 08:51:59,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 08:51:59,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 08:51:59,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 08:51:59,146 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 08:51:59,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 08:51:59,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 08:51:59,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 08:51:59,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 08:51:59,148 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 08:51:59,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 08:51:59,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 08:51:59,149 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 08:51:59,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 08:51:59,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 08:51:59,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 08:51:59,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 08:51:59,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 08:51:59,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 08:51:59,151 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 08:51:59,151 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 08:51:59,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 08:51:59,152 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 08:51:59,152 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 08:51:59,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 08:51:59,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 08:51:59,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 08:51:59,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:51:59,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 08:51:59,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 08:51:59,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 08:51:59,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 08:51:59,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 08:51:59,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 08:51:59,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 08:51:59,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 08:51:59,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 08:51:59,155 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 -> a9f3ee9eee9186ec2e7139b6da07915cfbf3926b7d28b3dac4ebf3fd8205beb2 [2024-11-16 08:51:59,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 08:51:59,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 08:51:59,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 08:51:59,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 08:51:59,353 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 08:51:59,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-005.c [2024-11-16 08:52:00,540 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 08:52:00,707 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 08:52:00,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-005.c [2024-11-16 08:52:00,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1654fc218/862dad23fae64aa4906e412773dd6d51/FLAGc03115b5c [2024-11-16 08:52:00,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1654fc218/862dad23fae64aa4906e412773dd6d51 [2024-11-16 08:52:00,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 08:52:00,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 08:52:00,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 08:52:00,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 08:52:00,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 08:52:00,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:00,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20fcc1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00, skipping insertion in model container [2024-11-16 08:52:00,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:00,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 08:52:00,900 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/xcsp/AllInterval-005.c[2566,2579] [2024-11-16 08:52:00,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:52:00,915 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 08:52:00,931 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/xcsp/AllInterval-005.c[2566,2579] [2024-11-16 08:52:00,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:52:00,942 INFO L204 MainTranslator]: Completed translation [2024-11-16 08:52:00,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00 WrapperNode [2024-11-16 08:52:00,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 08:52:00,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 08:52:00,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 08:52:00,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 08:52:00,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:00,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:00,968 INFO L138 Inliner]: procedures = 13, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 108 [2024-11-16 08:52:00,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 08:52:00,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 08:52:00,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 08:52:00,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 08:52:00,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:00,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:00,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:00,987 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 08:52:00,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:00,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:00,993 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:00,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:00,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:00,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:00,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 08:52:00,997 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 08:52:00,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 08:52:00,997 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 08:52:00,998 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00" (1/1) ... [2024-11-16 08:52:01,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:52:01,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:52:01,031 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-16 08:52:01,033 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-16 08:52:01,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 08:52:01,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 08:52:01,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 08:52:01,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 08:52:01,069 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2024-11-16 08:52:01,069 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2024-11-16 08:52:01,123 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 08:52:01,124 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 08:52:01,290 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 08:52:01,290 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 08:52:01,306 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 08:52:01,307 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 08:52:01,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:52:01 BoogieIcfgContainer [2024-11-16 08:52:01,308 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 08:52:01,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 08:52:01,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 08:52:01,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 08:52:01,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:52:00" (1/3) ... [2024-11-16 08:52:01,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a49eaf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:52:01, skipping insertion in model container [2024-11-16 08:52:01,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:52:00" (2/3) ... [2024-11-16 08:52:01,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a49eaf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:52:01, skipping insertion in model container [2024-11-16 08:52:01,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:52:01" (3/3) ... [2024-11-16 08:52:01,314 INFO L112 eAbstractionObserver]: Analyzing ICFG AllInterval-005.c [2024-11-16 08:52:01,327 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 08:52:01,327 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 08:52:01,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 08:52:01,390 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;@cb50d1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 08:52:01,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 08:52:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 08:52:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-16 08:52:01,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:52:01,412 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:52:01,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:52:01,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:52:01,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1954935193, now seen corresponding path program 1 times [2024-11-16 08:52:01,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:52:01,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211559682] [2024-11-16 08:52:01,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:52:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:52:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 08:52:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-16 08:52:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 08:52:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 08:52:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 08:52:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 08:52:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 08:52:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 08:52:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 08:52:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 08:52:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 08:52:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 08:52:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 08:52:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 08:52:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 08:52:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 08:52:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 08:52:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 08:52:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 08:52:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 08:52:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 08:52:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 08:52:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 08:52:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 08:52:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 08:52:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-16 08:52:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-16 08:52:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 08:52:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 08:52:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 08:52:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-16 08:52:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 08:52:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 08:52:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-16 08:52:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-16 08:52:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-16 08:52:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-16 08:52:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-16 08:52:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:52:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2024-11-16 08:52:01,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:52:01,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211559682] [2024-11-16 08:52:01,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211559682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:52:01,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:52:01,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 08:52:01,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421484253] [2024-11-16 08:52:01,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:52:01,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 08:52:01,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:52:01,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 08:52:01,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 08:52:01,778 INFO L87 Difference]: Start difference. First operand has 63 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-16 08:52:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:52:01,800 INFO L93 Difference]: Finished difference Result 119 states and 231 transitions. [2024-11-16 08:52:01,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 08:52:01,802 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 206 [2024-11-16 08:52:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:52:01,807 INFO L225 Difference]: With dead ends: 119 [2024-11-16 08:52:01,807 INFO L226 Difference]: Without dead ends: 59 [2024-11-16 08:52:01,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 08:52:01,813 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:52:01,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:52:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-16 08:52:01,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-16 08:52:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 08:52:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 95 transitions. [2024-11-16 08:52:01,848 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 95 transitions. Word has length 206 [2024-11-16 08:52:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:52:01,848 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 95 transitions. [2024-11-16 08:52:01,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-16 08:52:01,849 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 95 transitions. [2024-11-16 08:52:01,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-16 08:52:01,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:52:01,854 INFO L215 NwaCegarLoop]: trace histogram [38, 38, 38, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:52:01,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 08:52:01,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:52:01,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:52:01,855 INFO L85 PathProgramCache]: Analyzing trace with hash -795770877, now seen corresponding path program 1 times [2024-11-16 08:52:01,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:52:01,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135283804] [2024-11-16 08:52:01,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:52:01,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:52:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 08:52:02,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 08:52:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 08:52:02,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 08:52:02,298 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 08:52:02,299 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 08:52:02,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 08:52:02,303 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-16 08:52:02,356 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 08:52:02,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:52:02 BoogieIcfgContainer [2024-11-16 08:52:02,359 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 08:52:02,359 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 08:52:02,359 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 08:52:02,359 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 08:52:02,360 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:52:01" (3/4) ... [2024-11-16 08:52:02,360 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 08:52:02,444 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 08:52:02,444 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 08:52:02,445 INFO L158 Benchmark]: Toolchain (without parser) took 1709.36ms. Allocated memory is still 180.4MB. Free memory was 149.6MB in the beginning and 82.5MB in the end (delta: 67.0MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2024-11-16 08:52:02,445 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 08:52:02,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.36ms. Allocated memory is still 180.4MB. Free memory was 149.6MB in the beginning and 137.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 08:52:02,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.76ms. Allocated memory is still 180.4MB. Free memory was 136.1MB in the beginning and 135.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:52:02,446 INFO L158 Benchmark]: Boogie Preprocessor took 27.75ms. Allocated memory is still 180.4MB. Free memory was 135.0MB in the beginning and 132.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:52:02,446 INFO L158 Benchmark]: IcfgBuilder took 310.87ms. Allocated memory is still 180.4MB. Free memory was 132.9MB in the beginning and 118.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 08:52:02,446 INFO L158 Benchmark]: TraceAbstraction took 1049.13ms. Allocated memory is still 180.4MB. Free memory was 117.2MB in the beginning and 88.8MB in the end (delta: 28.4MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2024-11-16 08:52:02,447 INFO L158 Benchmark]: Witness Printer took 85.52ms. Allocated memory is still 180.4MB. Free memory was 88.8MB in the beginning and 82.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 08:52:02,448 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 130.0MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.36ms. Allocated memory is still 180.4MB. Free memory was 149.6MB in the beginning and 137.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.76ms. Allocated memory is still 180.4MB. Free memory was 136.1MB in the beginning and 135.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.75ms. Allocated memory is still 180.4MB. Free memory was 135.0MB in the beginning and 132.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 310.87ms. Allocated memory is still 180.4MB. Free memory was 132.9MB in the beginning and 118.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1049.13ms. Allocated memory is still 180.4MB. Free memory was 117.2MB in the beginning and 88.8MB in the end (delta: 28.4MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Witness Printer took 85.52ms. Allocated memory is still 180.4MB. Free memory was 88.8MB in the beginning and 82.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 93]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L29] RET assume(var0 >= 0) VAL [var0=1] [L30] CALL assume(var0 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L30] RET assume(var0 <= 4) VAL [var0=1] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L33] RET assume(var1 >= 0) VAL [var0=1, var1=2] [L34] CALL assume(var1 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L34] RET assume(var1 <= 4) VAL [var0=1, var1=2] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L37] RET assume(var2 >= 0) VAL [var0=1, var1=2, var2=4] [L38] CALL assume(var2 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L38] RET assume(var2 <= 4) VAL [var0=1, var1=2, var2=4] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L41] RET assume(var3 >= 0) VAL [var0=1, var1=2, var2=4, var3=0] [L42] CALL assume(var3 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L42] RET assume(var3 <= 4) VAL [var0=1, var1=2, var2=4, var3=0] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L45] RET assume(var4 >= 0) VAL [var0=1, var1=2, var2=4, var3=0, var4=3] [L46] CALL assume(var4 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L46] RET assume(var4 <= 4) VAL [var0=1, var1=2, var2=4, var3=0, var4=3] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L49] RET assume(var5 >= 1) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1] [L50] CALL assume(var5 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L50] RET assume(var5 <= 4) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L53] RET assume(var6 >= 1) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2] [L54] CALL assume(var6 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L54] RET assume(var6 <= 4) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L57] RET assume(var7 >= 1) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4] [L58] CALL assume(var7 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET assume(var7 <= 4) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L61] RET assume(var8 >= 1) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L62] CALL assume(var8 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L62] RET assume(var8 <= 4) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L63] int myvar0 = 1; VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L64] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L64] RET assume(var0 != var1) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L65] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L65] RET assume(var0 != var2) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L66] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L66] RET assume(var0 != var3) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L67] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L67] RET assume(var0 != var4) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L68] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L68] RET assume(var1 != var2) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L69] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L69] RET assume(var1 != var3) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L70] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L70] RET assume(var1 != var4) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L71] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L71] RET assume(var2 != var3) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L72] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L72] RET assume(var2 != var4) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L73] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L73] RET assume(var3 != var4) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L74] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L74] RET assume(var5 != var6) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L75] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L75] RET assume(var5 != var7) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L76] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L76] RET assume(var5 != var8) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L77] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L77] RET assume(var6 != var7) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L78] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L78] RET assume(var6 != var8) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L79] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L79] RET assume(var7 != var8) VAL [var0=1, var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3] [L80] int var_for_abs; [L81] var_for_abs = var0 - var1 [L82] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L83] CALL assume(var5 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L83] RET assume(var5 == var_for_abs) VAL [var1=2, var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L84] var_for_abs = var1 - var2 [L85] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L86] CALL assume(var6 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L86] RET assume(var6 == var_for_abs) VAL [var2=4, var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L87] var_for_abs = var2 - var3 [L88] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=4] [L89] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET assume(var7 == var_for_abs) VAL [var3=0, var4=3, var5=1, var6=2, var7=4, var8=3, var_for_abs=4] [L90] var_for_abs = var3 - var4 [L91] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L92] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1] [L92] RET assume(var8 == var_for_abs) VAL [var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L93] reach_error() VAL [var5=1, var6=2, var7=4, var8=3, var_for_abs=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 38, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 95 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2812/2812 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-16 08:52:02,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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