./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.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 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:40:41,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:40:41,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:40:41,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:40:41,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:40:41,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:40:41,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:40:41,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:40:41,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:40:41,841 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:40:41,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:40:41,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:40:41,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:40:41,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:40:41,845 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:40:41,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:40:41,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:40:41,846 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:40:41,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:40:41,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:40:41,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:40:41,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:40:41,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:40:41,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:40:41,850 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:40:41,851 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:40:41,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:40:41,851 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:40:41,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:40:41,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:40:41,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:40:41,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:40:41,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:40:41,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:40:41,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:40:41,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:40:41,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:40:41,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:40:41,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:40:41,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:40:41,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:40:41,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:40:41,857 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 -> 75f53c568c86c59ddc62d2fd150ff0a5ed9b51ea17cada3ff1a95dec57d9167c [2024-10-13 22:40:42,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:40:42,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:40:42,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:40:42,147 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:40:42,148 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:40:42,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2024-10-13 22:40:43,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:40:43,709 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:40:43,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c [2024-10-13 22:40:43,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3d47a7a/c1c702f3e479480ba6e0dd568472b4b3/FLAG3187e50cb [2024-10-13 22:40:44,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3d47a7a/c1c702f3e479480ba6e0dd568472b4b3 [2024-10-13 22:40:44,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:40:44,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:40:44,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:40:44,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:40:44,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:40:44,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f60de00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44, skipping insertion in model container [2024-10-13 22:40:44,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:40:44,346 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c[5305,5318] [2024-10-13 22:40:44,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:40:44,368 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:40:44,404 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-2.c[5305,5318] [2024-10-13 22:40:44,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:40:44,430 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:40:44,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44 WrapperNode [2024-10-13 22:40:44,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:40:44,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:40:44,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:40:44,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:40:44,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,473 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 198 [2024-10-13 22:40:44,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:40:44,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:40:44,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:40:44,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:40:44,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,502 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-10-13 22:40:44,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:40:44,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:40:44,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:40:44,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:40:44,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44" (1/1) ... [2024-10-13 22:40:44,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:40:44,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:40:44,573 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-10-13 22:40:44,576 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-10-13 22:40:44,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:40:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:40:44,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:40:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:40:44,710 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:40:44,712 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:40:45,032 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-13 22:40:45,033 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:40:45,074 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:40:45,078 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 22:40:45,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:40:45 BoogieIcfgContainer [2024-10-13 22:40:45,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:40:45,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:40:45,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:40:45,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:40:45,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:40:44" (1/3) ... [2024-10-13 22:40:45,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26262866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:40:45, skipping insertion in model container [2024-10-13 22:40:45,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:40:44" (2/3) ... [2024-10-13 22:40:45,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26262866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:40:45, skipping insertion in model container [2024-10-13 22:40:45,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:40:45" (3/3) ... [2024-10-13 22:40:45,090 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2024-10-13 22:40:45,106 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:40:45,107 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:40:45,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:40:45,184 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;@6ea30c5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:40:45,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:40:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 49 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:45,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 22:40:45,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:45,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:40:45,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:45,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:45,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1808029715, now seen corresponding path program 1 times [2024-10-13 22:40:45,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281468273] [2024-10-13 22:40:45,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:45,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:45,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:45,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281468273] [2024-10-13 22:40:45,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281468273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:45,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:45,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:45,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342390410] [2024-10-13 22:40:45,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:45,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:45,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:45,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:45,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:45,484 INFO L87 Difference]: Start difference. First operand has 50 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 49 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:45,550 INFO L93 Difference]: Finished difference Result 102 states and 189 transitions. [2024-10-13 22:40:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:45,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-13 22:40:45,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:45,560 INFO L225 Difference]: With dead ends: 102 [2024-10-13 22:40:45,560 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 22:40:45,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:45,566 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 70 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:45,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 177 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 22:40:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2024-10-13 22:40:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.9180327868852458) internal successors, (117), 61 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 117 transitions. [2024-10-13 22:40:45,601 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 117 transitions. Word has length 20 [2024-10-13 22:40:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:45,601 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 117 transitions. [2024-10-13 22:40:45,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 117 transitions. [2024-10-13 22:40:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 22:40:45,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:45,602 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:40:45,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:40:45,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:45,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:45,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1808022523, now seen corresponding path program 1 times [2024-10-13 22:40:45,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:45,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573825720] [2024-10-13 22:40:45,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:45,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:45,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:45,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573825720] [2024-10-13 22:40:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573825720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:45,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:45,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:45,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021868659] [2024-10-13 22:40:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:45,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:45,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:45,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:45,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:45,729 INFO L87 Difference]: Start difference. First operand 62 states and 117 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:45,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:45,766 INFO L93 Difference]: Finished difference Result 154 states and 290 transitions. [2024-10-13 22:40:45,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:45,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-13 22:40:45,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:45,768 INFO L225 Difference]: With dead ends: 154 [2024-10-13 22:40:45,768 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 22:40:45,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:45,769 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 71 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:45,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 221 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 22:40:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-10-13 22:40:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.9) internal successors, (171), 90 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 171 transitions. [2024-10-13 22:40:45,784 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 171 transitions. Word has length 20 [2024-10-13 22:40:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:45,784 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 171 transitions. [2024-10-13 22:40:45,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 171 transitions. [2024-10-13 22:40:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 22:40:45,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:45,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:40:45,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:40:45,786 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:45,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:45,790 INFO L85 PathProgramCache]: Analyzing trace with hash 898589679, now seen corresponding path program 1 times [2024-10-13 22:40:45,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:45,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893230595] [2024-10-13 22:40:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:45,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:45,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:45,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893230595] [2024-10-13 22:40:45,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893230595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:45,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:45,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:45,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40281361] [2024-10-13 22:40:45,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:45,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:45,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:45,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:45,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:45,885 INFO L87 Difference]: Start difference. First operand 91 states and 171 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:45,913 INFO L93 Difference]: Finished difference Result 142 states and 260 transitions. [2024-10-13 22:40:45,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:45,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-13 22:40:45,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:45,915 INFO L225 Difference]: With dead ends: 142 [2024-10-13 22:40:45,915 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 22:40:45,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:45,917 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:45,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 195 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:45,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 22:40:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-10-13 22:40:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.858695652173913) internal successors, (171), 92 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 171 transitions. [2024-10-13 22:40:45,927 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 171 transitions. Word has length 20 [2024-10-13 22:40:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:45,927 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 171 transitions. [2024-10-13 22:40:45,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 171 transitions. [2024-10-13 22:40:45,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 22:40:45,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:45,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:40:45,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:40:45,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:45,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:45,930 INFO L85 PathProgramCache]: Analyzing trace with hash 898596871, now seen corresponding path program 1 times [2024-10-13 22:40:45,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:45,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143747880] [2024-10-13 22:40:45,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:45,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:40:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:40:45,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:40:45,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143747880] [2024-10-13 22:40:45,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143747880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:40:45,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:40:45,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:40:45,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818827725] [2024-10-13 22:40:45,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:40:45,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:40:45,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:40:45,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:40:45,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:45,991 INFO L87 Difference]: Start difference. First operand 93 states and 171 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:46,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:40:46,009 INFO L93 Difference]: Finished difference Result 215 states and 397 transitions. [2024-10-13 22:40:46,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:40:46,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-13 22:40:46,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:40:46,011 INFO L225 Difference]: With dead ends: 215 [2024-10-13 22:40:46,011 INFO L226 Difference]: Without dead ends: 126 [2024-10-13 22:40:46,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:40:46,017 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 70 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:40:46,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 122 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:40:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-13 22:40:46,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-10-13 22:40:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.8373983739837398) internal successors, (226), 123 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 226 transitions. [2024-10-13 22:40:46,039 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 226 transitions. Word has length 20 [2024-10-13 22:40:46,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:40:46,040 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 226 transitions. [2024-10-13 22:40:46,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:40:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 226 transitions. [2024-10-13 22:40:46,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 22:40:46,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:40:46,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:40:46,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 22:40:46,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:40:46,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:40:46,042 INFO L85 PathProgramCache]: Analyzing trace with hash -122471483, now seen corresponding path program 1 times [2024-10-13 22:40:46,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:40:46,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578339739] [2024-10-13 22:40:46,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:40:46,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:40:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 22:40:46,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 22:40:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 22:40:46,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 22:40:46,115 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 22:40:46,117 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 22:40:46,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 22:40:46,123 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 22:40:46,179 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 22:40:46,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:40:46 BoogieIcfgContainer [2024-10-13 22:40:46,185 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 22:40:46,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 22:40:46,189 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 22:40:46,189 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 22:40:46,190 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:40:45" (3/4) ... [2024-10-13 22:40:46,190 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 22:40:46,286 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 22:40:46,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 22:40:46,286 INFO L158 Benchmark]: Toolchain (without parser) took 2184.54ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 90.1MB in the beginning and 151.6MB in the end (delta: -61.5MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2024-10-13 22:40:46,286 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 142.6MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:40:46,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.75ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 77.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 22:40:46,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.32ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 75.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 22:40:46,287 INFO L158 Benchmark]: Boogie Preprocessor took 40.40ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 73.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 22:40:46,287 INFO L158 Benchmark]: RCFGBuilder took 562.47ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 73.2MB in the beginning and 138.9MB in the end (delta: -65.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-10-13 22:40:46,288 INFO L158 Benchmark]: TraceAbstraction took 1104.81ms. Allocated memory is still 184.5MB. Free memory was 137.9MB in the beginning and 72.9MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-13 22:40:46,288 INFO L158 Benchmark]: Witness Printer took 98.12ms. Allocated memory is still 184.5MB. Free memory was 72.9MB in the beginning and 151.6MB in the end (delta: -78.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 22:40:46,295 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.21ms. Allocated memory is still 142.6MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.75ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 77.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.32ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 75.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.40ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 73.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 562.47ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 73.2MB in the beginning and 138.9MB in the end (delta: -65.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1104.81ms. Allocated memory is still 184.5MB. Free memory was 137.9MB in the beginning and 72.9MB in the end (delta: 65.0MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Witness Printer took 98.12ms. Allocated memory is still 184.5MB. Free memory was 72.9MB in the beginning and 151.6MB in the end (delta: -78.8MB). 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: 219]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L51] int cond; VAL [p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L88] COND FALSE !(p1 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L92] COND FALSE !(p2 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L96] COND FALSE !(p3 != 0) VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L100] COND TRUE p4 != 0 [L101] lk4 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L104] COND TRUE p5 != 0 [L105] lk5 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L108] COND TRUE p6 != 0 [L109] lk6 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L112] COND TRUE p7 != 0 [L113] lk7 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L116] COND TRUE p8 != 0 [L117] lk8 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L120] COND TRUE p9 != 0 [L121] lk9 = 1 VAL [lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L124] COND TRUE p10 != 0 [L125] lk10 = 1 VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L128] COND FALSE !(p11 != 0) VAL [lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L132] COND TRUE p12 != 0 [L133] lk12 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L136] COND TRUE p13 != 0 [L137] lk13 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L140] COND TRUE p14 != 0 [L141] lk14 = 1 VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L146] COND FALSE !(p1 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p2=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L151] COND FALSE !(p2 != 0) VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] [L219] reach_error() VAL [lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=1, p11=0, p12=1, p13=1, p14=1, p1=0, p3=0, p4=1, p5=1, p6=1, p7=1, p8=1, p9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 280 mSDsluCounter, 715 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 280 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 435 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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-10-13 22:40:46,346 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