./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 21:44:49,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 21:44:49,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 21:44:49,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 21:44:49,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 21:44:49,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 21:44:49,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 21:44:49,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 21:44:49,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 21:44:49,497 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 21:44:49,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 21:44:49,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 21:44:49,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 21:44:49,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 21:44:49,498 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 21:44:49,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 21:44:49,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 21:44:49,499 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 21:44:49,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 21:44:49,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 21:44:49,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 21:44:49,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 21:44:49,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 21:44:49,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 21:44:49,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 21:44:49,504 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 21:44:49,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 21:44:49,505 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 21:44:49,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 21:44:49,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 21:44:49,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 21:44:49,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 21:44:49,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 21:44:49,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 21:44:49,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 21:44:49,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 21:44:49,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 21:44:49,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 21:44:49,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 21:44:49,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 21:44:49,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 21:44:49,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 21:44:49,512 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-clean/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-clean/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 -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2024-10-10 21:44:49,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 21:44:49,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 21:44:49,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 21:44:49,810 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 21:44:49,815 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 21:44:49,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-10-10 21:44:51,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 21:44:51,559 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 21:44:51,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-10-10 21:44:51,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/187b0e87a/9f6e9bfe9c2e4cc58417c71107b23bde/FLAG0334e2d4a [2024-10-10 21:44:51,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/187b0e87a/9f6e9bfe9c2e4cc58417c71107b23bde [2024-10-10 21:44:51,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 21:44:51,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 21:44:51,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 21:44:51,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 21:44:51,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 21:44:51,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 09:44:51" (1/1) ... [2024-10-10 21:44:51,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6593166c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:51, skipping insertion in model container [2024-10-10 21:44:51,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 09:44:51" (1/1) ... [2024-10-10 21:44:52,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 21:44:52,161 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/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2024-10-10 21:44:52,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 21:44:52,193 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 21:44:52,202 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/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2024-10-10 21:44:52,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 21:44:52,232 INFO L204 MainTranslator]: Completed translation [2024-10-10 21:44:52,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52 WrapperNode [2024-10-10 21:44:52,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 21:44:52,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 21:44:52,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 21:44:52,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 21:44:52,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52" (1/1) ... [2024-10-10 21:44:52,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52" (1/1) ... [2024-10-10 21:44:52,272 INFO L138 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 159 [2024-10-10 21:44:52,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 21:44:52,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 21:44:52,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 21:44:52,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 21:44:52,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52" (1/1) ... [2024-10-10 21:44:52,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52" (1/1) ... [2024-10-10 21:44:52,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52" (1/1) ... [2024-10-10 21:44:52,298 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 3, 9]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-10-10 21:44:52,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52" (1/1) ... [2024-10-10 21:44:52,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52" (1/1) ... [2024-10-10 21:44:52,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52" (1/1) ... [2024-10-10 21:44:52,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52" (1/1) ... [2024-10-10 21:44:52,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52" (1/1) ... [2024-10-10 21:44:52,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52" (1/1) ... [2024-10-10 21:44:52,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 21:44:52,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 21:44:52,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 21:44:52,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 21:44:52,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52" (1/1) ... [2024-10-10 21:44:52,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 21:44:52,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:44:52,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 21:44:52,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 21:44:52,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 21:44:52,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 21:44:52,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 21:44:52,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-10 21:44:52,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 21:44:52,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 21:44:52,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 21:44:52,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-10 21:44:52,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 21:44:52,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 21:44:52,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 21:44:52,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 21:44:52,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-10 21:44:52,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-10 21:44:52,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-10 21:44:52,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 21:44:52,472 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 21:44:52,473 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 21:44:52,660 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-10 21:44:52,660 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 21:44:52,690 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 21:44:52,690 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-10 21:44:52,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:44:52 BoogieIcfgContainer [2024-10-10 21:44:52,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 21:44:52,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 21:44:52,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 21:44:52,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 21:44:52,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 09:44:51" (1/3) ... [2024-10-10 21:44:52,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd8808b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 09:44:52, skipping insertion in model container [2024-10-10 21:44:52,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:44:52" (2/3) ... [2024-10-10 21:44:52,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd8808b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 09:44:52, skipping insertion in model container [2024-10-10 21:44:52,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:44:52" (3/3) ... [2024-10-10 21:44:52,698 INFO L112 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2024-10-10 21:44:52,711 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 21:44:52,711 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 21:44:52,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 21:44:52,759 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;@4e39844e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 21:44:52,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 21:44:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.75) internal successors, (56), 33 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:44:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-10 21:44:52,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:44:52,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:44:52,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:44:52,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:44:52,776 INFO L85 PathProgramCache]: Analyzing trace with hash -768464033, now seen corresponding path program 1 times [2024-10-10 21:44:52,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:44:52,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528956624] [2024-10-10 21:44:52,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:44:52,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:44:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:44:52,939 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-10 21:44:52,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:44:52,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528956624] [2024-10-10 21:44:52,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528956624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:44:52,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:44:52,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 21:44:52,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547205377] [2024-10-10 21:44:52,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:44:52,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 21:44:52,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:44:52,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 21:44:52,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 21:44:52,975 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.75) internal successors, (56), 33 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:53,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:44:53,052 INFO L93 Difference]: Finished difference Result 90 states and 159 transitions. [2024-10-10 21:44:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 21:44:53,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-10 21:44:53,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:44:53,062 INFO L225 Difference]: With dead ends: 90 [2024-10-10 21:44:53,062 INFO L226 Difference]: Without dead ends: 52 [2024-10-10 21:44:53,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 21:44:53,067 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 21:44:53,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 57 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 21:44:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-10 21:44:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2024-10-10 21:44:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:44:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-10-10 21:44:53,141 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 9 [2024-10-10 21:44:53,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:44:53,142 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-10-10 21:44:53,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-10-10 21:44:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 21:44:53,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:44:53,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:44:53,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 21:44:53,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:44:53,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:44:53,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1876649111, now seen corresponding path program 1 times [2024-10-10 21:44:53,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:44:53,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275474512] [2024-10-10 21:44:53,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:44:53,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:44:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:44:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 21:44:53,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:44:53,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275474512] [2024-10-10 21:44:53,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275474512] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:44:53,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001263400] [2024-10-10 21:44:53,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:44:53,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:44:53,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:44:53,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:44:53,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 21:44:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:44:53,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 21:44:53,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:44:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 21:44:53,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:44:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 21:44:53,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001263400] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:44:53,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:44:53,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-10 21:44:53,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583281278] [2024-10-10 21:44:53,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:44:53,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 21:44:53,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:44:53,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 21:44:53,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 21:44:53,343 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:44:53,499 INFO L93 Difference]: Finished difference Result 134 states and 194 transitions. [2024-10-10 21:44:53,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 21:44:53,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-10 21:44:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:44:53,503 INFO L225 Difference]: With dead ends: 134 [2024-10-10 21:44:53,503 INFO L226 Difference]: Without dead ends: 100 [2024-10-10 21:44:53,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 21:44:53,505 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 70 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 21:44:53,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 114 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 21:44:53,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-10 21:44:53,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 40. [2024-10-10 21:44:53,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:44:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-10-10 21:44:53,514 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 10 [2024-10-10 21:44:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:44:53,514 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-10-10 21:44:53,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-10-10 21:44:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 21:44:53,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:44:53,515 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:44:53,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 21:44:53,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:44:53,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:44:53,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:44:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash -212673057, now seen corresponding path program 2 times [2024-10-10 21:44:53,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:44:53,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208587012] [2024-10-10 21:44:53,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:44:53,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:44:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:44:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-10 21:44:53,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:44:53,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208587012] [2024-10-10 21:44:53,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208587012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:44:53,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:44:53,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 21:44:53,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680891176] [2024-10-10 21:44:53,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:44:53,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 21:44:53,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:44:53,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 21:44:53,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:44:53,859 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:44:53,903 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2024-10-10 21:44:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 21:44:53,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-10 21:44:53,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:44:53,905 INFO L225 Difference]: With dead ends: 80 [2024-10-10 21:44:53,905 INFO L226 Difference]: Without dead ends: 45 [2024-10-10 21:44:53,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:44:53,906 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:44:53,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 67 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:44:53,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-10 21:44:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-10 21:44:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-10 21:44:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-10-10 21:44:53,914 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 13 [2024-10-10 21:44:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:44:53,914 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-10-10 21:44:53,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-10-10 21:44:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 21:44:53,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:44:53,915 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:44:53,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 21:44:53,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:44:53,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:44:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash 514848562, now seen corresponding path program 1 times [2024-10-10 21:44:53,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:44:53,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748205297] [2024-10-10 21:44:53,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:44:53,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:44:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:44:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-10 21:44:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:44:54,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748205297] [2024-10-10 21:44:54,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748205297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:44:54,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:44:54,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 21:44:54,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767700849] [2024-10-10 21:44:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:44:54,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 21:44:54,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:44:54,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 21:44:54,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 21:44:54,006 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:44:54,036 INFO L93 Difference]: Finished difference Result 97 states and 128 transitions. [2024-10-10 21:44:54,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 21:44:54,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-10 21:44:54,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:44:54,038 INFO L225 Difference]: With dead ends: 97 [2024-10-10 21:44:54,038 INFO L226 Difference]: Without dead ends: 62 [2024-10-10 21:44:54,039 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-10 21:44:54,040 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:44:54,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 62 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:44:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-10 21:44:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2024-10-10 21:44:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-10 21:44:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2024-10-10 21:44:54,049 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 23 [2024-10-10 21:44:54,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:44:54,049 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2024-10-10 21:44:54,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2024-10-10 21:44:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 21:44:54,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:44:54,050 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:44:54,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 21:44:54,050 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:44:54,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:44:54,051 INFO L85 PathProgramCache]: Analyzing trace with hash -384617796, now seen corresponding path program 1 times [2024-10-10 21:44:54,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:44:54,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822389691] [2024-10-10 21:44:54,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:44:54,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:44:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:44:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-10 21:44:54,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:44:54,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822389691] [2024-10-10 21:44:54,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822389691] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:44:54,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844434003] [2024-10-10 21:44:54,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:44:54,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:44:54,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:44:54,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:44:54,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 21:44:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:44:54,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 21:44:54,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:44:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 21:44:54,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:44:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 21:44:54,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844434003] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:44:54,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:44:54,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2024-10-10 21:44:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277282525] [2024-10-10 21:44:54,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:44:54,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-10 21:44:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:44:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-10 21:44:54,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-10-10 21:44:54,365 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:44:54,962 INFO L93 Difference]: Finished difference Result 331 states and 489 transitions. [2024-10-10 21:44:54,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-10 21:44:54,963 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-10 21:44:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:44:54,966 INFO L225 Difference]: With dead ends: 331 [2024-10-10 21:44:54,966 INFO L226 Difference]: Without dead ends: 291 [2024-10-10 21:44:54,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=396, Invalid=726, Unknown=0, NotChecked=0, Total=1122 [2024-10-10 21:44:54,969 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 461 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 21:44:54,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 152 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 21:44:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-10 21:44:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 67. [2024-10-10 21:44:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:44:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2024-10-10 21:44:54,998 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 24 [2024-10-10 21:44:54,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:44:54,998 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2024-10-10 21:44:54,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2024-10-10 21:44:54,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 21:44:54,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:44:55,000 INFO L215 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:44:55,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 21:44:55,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:44:55,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:44:55,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:44:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 134478898, now seen corresponding path program 2 times [2024-10-10 21:44:55,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:44:55,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13983723] [2024-10-10 21:44:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:44:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:44:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:44:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-10 21:44:55,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:44:55,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13983723] [2024-10-10 21:44:55,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13983723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:44:55,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:44:55,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 21:44:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633750180] [2024-10-10 21:44:55,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:44:55,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 21:44:55,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:44:55,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 21:44:55,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:44:55,377 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:44:55,409 INFO L93 Difference]: Finished difference Result 106 states and 139 transitions. [2024-10-10 21:44:55,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 21:44:55,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-10 21:44:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:44:55,411 INFO L225 Difference]: With dead ends: 106 [2024-10-10 21:44:55,411 INFO L226 Difference]: Without dead ends: 73 [2024-10-10 21:44:55,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:44:55,412 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:44:55,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:44:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-10 21:44:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-10-10 21:44:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 65 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:44:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2024-10-10 21:44:55,423 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 31 [2024-10-10 21:44:55,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:44:55,423 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2024-10-10 21:44:55,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2024-10-10 21:44:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 21:44:55,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:44:55,425 INFO L215 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:44:55,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 21:44:55,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:44:55,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:44:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1887315780, now seen corresponding path program 1 times [2024-10-10 21:44:55,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:44:55,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617999773] [2024-10-10 21:44:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:44:55,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:44:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:44:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-10 21:44:55,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:44:55,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617999773] [2024-10-10 21:44:55,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617999773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:44:55,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:44:55,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 21:44:55,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587528517] [2024-10-10 21:44:55,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:44:55,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 21:44:55,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:44:55,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 21:44:55,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:44:55,561 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:55,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:44:55,586 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2024-10-10 21:44:55,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 21:44:55,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-10 21:44:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:44:55,587 INFO L225 Difference]: With dead ends: 79 [2024-10-10 21:44:55,587 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 21:44:55,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 21:44:55,588 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:44:55,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:44:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 21:44:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 21:44:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-10 21:44:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 21:44:55,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2024-10-10 21:44:55,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:44:55,590 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 21:44:55,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 21:44:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 21:44:55,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 21:44:55,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 21:44:55,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 21:44:55,596 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2024-10-10 21:44:55,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 21:44:55,667 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 21:44:55,679 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~n~0 [2024-10-10 21:44:55,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 09:44:55 BoogieIcfgContainer [2024-10-10 21:44:55,682 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 21:44:55,683 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 21:44:55,683 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 21:44:55,683 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 21:44:55,684 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:44:52" (3/4) ... [2024-10-10 21:44:55,685 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 21:44:55,688 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-10 21:44:55,691 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-10 21:44:55,692 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-10 21:44:55,692 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 21:44:55,692 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 21:44:55,770 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 21:44:55,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 21:44:55,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 21:44:55,771 INFO L158 Benchmark]: Toolchain (without parser) took 3796.95ms. Allocated memory was 153.1MB in the beginning and 245.4MB in the end (delta: 92.3MB). Free memory was 103.2MB in the beginning and 203.5MB in the end (delta: -100.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 21:44:55,771 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 153.1MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 21:44:55,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.63ms. Allocated memory is still 153.1MB. Free memory was 103.2MB in the beginning and 89.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 21:44:55,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.98ms. Allocated memory is still 153.1MB. Free memory was 89.9MB in the beginning and 88.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 21:44:55,772 INFO L158 Benchmark]: Boogie Preprocessor took 42.94ms. Allocated memory is still 153.1MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 21:44:55,772 INFO L158 Benchmark]: RCFGBuilder took 370.88ms. Allocated memory is still 153.1MB. Free memory was 85.8MB in the beginning and 66.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-10 21:44:55,773 INFO L158 Benchmark]: TraceAbstraction took 2989.97ms. Allocated memory was 153.1MB in the beginning and 245.4MB in the end (delta: 92.3MB). Free memory was 66.3MB in the beginning and 208.8MB in the end (delta: -142.4MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2024-10-10 21:44:55,773 INFO L158 Benchmark]: Witness Printer took 87.72ms. Allocated memory is still 245.4MB. Free memory was 208.8MB in the beginning and 203.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 21:44:55,774 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 153.1MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.63ms. Allocated memory is still 153.1MB. Free memory was 103.2MB in the beginning and 89.9MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.98ms. Allocated memory is still 153.1MB. Free memory was 89.9MB in the beginning and 88.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.94ms. Allocated memory is still 153.1MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 370.88ms. Allocated memory is still 153.1MB. Free memory was 85.8MB in the beginning and 66.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2989.97ms. Allocated memory was 153.1MB in the beginning and 245.4MB in the end (delta: 92.3MB). Free memory was 66.3MB in the beginning and 208.8MB in the end (delta: -142.4MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Witness Printer took 87.72ms. Allocated memory is still 245.4MB. Free memory was 208.8MB in the beginning and 203.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~n~0 * 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 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 623 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 585 mSDsluCounter, 567 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 363 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 471 IncrementalHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 204 mSDtfsCounter, 471 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=6, InterpolantAutomatonStates: 58, 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, 7 MinimizatonAttempts, 318 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 304 SizeOfPredicates, 0 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 148/172 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((n == 0) && (x == 0)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((n == 0) && (x == 0)) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (n == 0) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((n == 0) && (x == 0)) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (n == 0) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((size == 0) && (i == 0)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (n == 0) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: 0 Ensures: 0 RESULT: Ultimate proved your program to be correct! [2024-10-10 21:44:55,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Result: TRUE