./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-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 a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 15:39:08,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 15:39:08,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 15:39:08,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 15:39:08,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 15:39:08,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 15:39:08,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 15:39:08,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 15:39:08,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 15:39:08,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 15:39:08,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 15:39:08,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 15:39:08,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 15:39:08,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 15:39:08,321 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 15:39:08,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 15:39:08,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 15:39:08,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 15:39:08,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 15:39:08,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 15:39:08,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 15:39:08,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 15:39:08,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 15:39:08,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 15:39:08,323 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 15:39:08,323 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 15:39:08,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 15:39:08,323 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 15:39:08,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 15:39:08,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 15:39:08,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 15:39:08,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 15:39:08,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 15:39:08,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 15:39:08,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 15:39:08,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 15:39:08,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 15:39:08,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 15:39:08,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 15:39:08,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 15:39:08,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 15:39:08,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 15:39:08,328 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 -> a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 [2024-11-18 15:39:08,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 15:39:08,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 15:39:08,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 15:39:08,572 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 15:39:08,572 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 15:39:08,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c [2024-11-18 15:39:09,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 15:39:10,405 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 15:39:10,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c [2024-11-18 15:39:10,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea3aa141/4f9d2983d0e2445f97ffed322d1e7cd1/FLAGf9d07f95d [2024-11-18 15:39:10,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea3aa141/4f9d2983d0e2445f97ffed322d1e7cd1 [2024-11-18 15:39:10,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 15:39:10,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 15:39:10,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 15:39:10,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 15:39:10,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 15:39:10,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:39:10" (1/1) ... [2024-11-18 15:39:10,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7e2143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:10, skipping insertion in model container [2024-11-18 15:39:10,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:39:10" (1/1) ... [2024-11-18 15:39:10,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 15:39:12,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2024-11-18 15:39:12,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2024-11-18 15:39:12,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 15:39:12,304 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 15:39:12,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2024-11-18 15:39:12,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2024-11-18 15:39:12,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 15:39:12,931 INFO L204 MainTranslator]: Completed translation [2024-11-18 15:39:12,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12 WrapperNode [2024-11-18 15:39:12,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 15:39:12,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 15:39:12,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 15:39:12,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 15:39:12,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12" (1/1) ... [2024-11-18 15:39:13,051 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12" (1/1) ... [2024-11-18 15:39:13,267 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12579 [2024-11-18 15:39:13,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 15:39:13,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 15:39:13,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 15:39:13,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 15:39:13,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12" (1/1) ... [2024-11-18 15:39:13,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12" (1/1) ... [2024-11-18 15:39:13,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12" (1/1) ... [2024-11-18 15:39:13,492 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 15:39:13,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12" (1/1) ... [2024-11-18 15:39:13,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12" (1/1) ... [2024-11-18 15:39:13,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12" (1/1) ... [2024-11-18 15:39:13,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12" (1/1) ... [2024-11-18 15:39:13,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12" (1/1) ... [2024-11-18 15:39:13,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12" (1/1) ... [2024-11-18 15:39:13,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 15:39:13,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 15:39:13,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 15:39:13,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 15:39:13,782 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12" (1/1) ... [2024-11-18 15:39:13,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 15:39:13,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:39:13,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 15:39:13,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 15:39:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 15:39:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-18 15:39:13,857 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-18 15:39:13,857 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-18 15:39:13,858 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-18 15:39:13,858 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-18 15:39:13,858 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-18 15:39:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-18 15:39:13,859 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-18 15:39:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-18 15:39:13,859 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-18 15:39:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-18 15:39:13,859 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-18 15:39:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 15:39:13,859 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-18 15:39:13,859 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-18 15:39:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 15:39:13,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 15:39:13,950 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 15:39:13,952 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 15:39:20,160 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-11-18 15:39:20,160 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 15:39:20,222 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 15:39:20,222 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-18 15:39:20,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:39:20 BoogieIcfgContainer [2024-11-18 15:39:20,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 15:39:20,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 15:39:20,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 15:39:20,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 15:39:20,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:39:10" (1/3) ... [2024-11-18 15:39:20,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79564b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:39:20, skipping insertion in model container [2024-11-18 15:39:20,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:39:12" (2/3) ... [2024-11-18 15:39:20,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79564b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:39:20, skipping insertion in model container [2024-11-18 15:39:20,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:39:20" (3/3) ... [2024-11-18 15:39:20,235 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.01.cil-2.c [2024-11-18 15:39:20,253 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 15:39:20,254 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-18 15:39:20,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 15:39:20,379 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;@32c99840, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 15:39:20,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-18 15:39:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 2300 states, 2273 states have (on average 1.8583369995600527) internal successors, (4224), 2278 states have internal predecessors, (4224), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-18 15:39:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 15:39:20,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:20,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:20,400 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:20,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash -628171245, now seen corresponding path program 1 times [2024-11-18 15:39:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:20,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977053200] [2024-11-18 15:39:20,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:20,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:39:20,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:20,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977053200] [2024-11-18 15:39:20,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977053200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:20,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:39:20,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 15:39:20,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056880204] [2024-11-18 15:39:20,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:20,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 15:39:20,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:20,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 15:39:20,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 15:39:20,771 INFO L87 Difference]: Start difference. First operand has 2300 states, 2273 states have (on average 1.8583369995600527) internal successors, (4224), 2278 states have internal predecessors, (4224), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:39:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:21,182 INFO L93 Difference]: Finished difference Result 4699 states and 8671 transitions. [2024-11-18 15:39:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 15:39:21,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 15:39:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:21,212 INFO L225 Difference]: With dead ends: 4699 [2024-11-18 15:39:21,213 INFO L226 Difference]: Without dead ends: 2338 [2024-11-18 15:39:21,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:21,230 INFO L432 NwaCegarLoop]: 4151 mSDtfsCounter, 4257 mSDsluCounter, 8352 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4266 SdHoareTripleChecker+Valid, 12503 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:21,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4266 Valid, 12503 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 15:39:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2024-11-18 15:39:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2329. [2024-11-18 15:39:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2287 states have (on average 1.8369042413642327) internal successors, (4201), 2291 states have internal predecessors, (4201), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2024-11-18 15:39:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 4254 transitions. [2024-11-18 15:39:21,373 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 4254 transitions. Word has length 58 [2024-11-18 15:39:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:21,374 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 4254 transitions. [2024-11-18 15:39:21,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:39:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 4254 transitions. [2024-11-18 15:39:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 15:39:21,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:21,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:21,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 15:39:21,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:21,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:21,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1166087951, now seen corresponding path program 1 times [2024-11-18 15:39:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:21,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95482475] [2024-11-18 15:39:21,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:21,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:39:21,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:21,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95482475] [2024-11-18 15:39:21,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95482475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:21,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:39:21,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 15:39:21,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444284060] [2024-11-18 15:39:21,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:21,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 15:39:21,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 15:39:21,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:21,527 INFO L87 Difference]: Start difference. First operand 2329 states and 4254 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:39:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:21,927 INFO L93 Difference]: Finished difference Result 2645 states and 4705 transitions. [2024-11-18 15:39:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 15:39:21,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 15:39:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:21,937 INFO L225 Difference]: With dead ends: 2645 [2024-11-18 15:39:21,937 INFO L226 Difference]: Without dead ends: 2446 [2024-11-18 15:39:21,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 15:39:21,940 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4177 mSDsluCounter, 12432 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4186 SdHoareTripleChecker+Valid, 16590 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:21,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4186 Valid, 16590 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 15:39:21,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2024-11-18 15:39:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2421. [2024-11-18 15:39:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2362 states have (on average 1.8238780694326842) internal successors, (4308), 2367 states have internal predecessors, (4308), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2024-11-18 15:39:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4384 transitions. [2024-11-18 15:39:22,012 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4384 transitions. Word has length 58 [2024-11-18 15:39:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:22,012 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 4384 transitions. [2024-11-18 15:39:22,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:39:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4384 transitions. [2024-11-18 15:39:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 15:39:22,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:22,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:22,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 15:39:22,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:22,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:22,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2059574289, now seen corresponding path program 1 times [2024-11-18 15:39:22,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:22,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659491936] [2024-11-18 15:39:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:22,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:39:22,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:22,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659491936] [2024-11-18 15:39:22,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659491936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:22,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:39:22,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 15:39:22,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555055471] [2024-11-18 15:39:22,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:22,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 15:39:22,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:22,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 15:39:22,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:22,137 INFO L87 Difference]: Start difference. First operand 2421 states and 4384 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:39:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:22,542 INFO L93 Difference]: Finished difference Result 2949 states and 5135 transitions. [2024-11-18 15:39:22,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 15:39:22,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 15:39:22,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:22,553 INFO L225 Difference]: With dead ends: 2949 [2024-11-18 15:39:22,553 INFO L226 Difference]: Without dead ends: 2658 [2024-11-18 15:39:22,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 15:39:22,556 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4216 mSDsluCounter, 12409 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4227 SdHoareTripleChecker+Valid, 16561 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:22,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4227 Valid, 16561 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 15:39:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-11-18 15:39:22,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2604. [2024-11-18 15:39:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2604 states, 2511 states have (on average 1.8004778972520907) internal successors, (4521), 2520 states have internal predecessors, (4521), 55 states have call successors, (55), 31 states have call predecessors, (55), 36 states have return successors, (69), 56 states have call predecessors, (69), 53 states have call successors, (69) [2024-11-18 15:39:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2604 states to 2604 states and 4645 transitions. [2024-11-18 15:39:22,624 INFO L78 Accepts]: Start accepts. Automaton has 2604 states and 4645 transitions. Word has length 58 [2024-11-18 15:39:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:22,624 INFO L471 AbstractCegarLoop]: Abstraction has 2604 states and 4645 transitions. [2024-11-18 15:39:22,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:39:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 4645 transitions. [2024-11-18 15:39:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 15:39:22,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:22,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:22,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 15:39:22,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:22,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:22,627 INFO L85 PathProgramCache]: Analyzing trace with hash 10186447, now seen corresponding path program 1 times [2024-11-18 15:39:22,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:22,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161170369] [2024-11-18 15:39:22,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:22,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:39:22,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:22,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161170369] [2024-11-18 15:39:22,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161170369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:22,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:39:22,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 15:39:22,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648747976] [2024-11-18 15:39:22,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:22,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 15:39:22,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:22,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 15:39:22,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:22,718 INFO L87 Difference]: Start difference. First operand 2604 states and 4645 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:39:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:23,144 INFO L93 Difference]: Finished difference Result 3488 states and 5914 transitions. [2024-11-18 15:39:23,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 15:39:23,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 15:39:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:23,157 INFO L225 Difference]: With dead ends: 3488 [2024-11-18 15:39:23,157 INFO L226 Difference]: Without dead ends: 3014 [2024-11-18 15:39:23,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 15:39:23,161 INFO L432 NwaCegarLoop]: 4146 mSDtfsCounter, 4169 mSDsluCounter, 12399 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4177 SdHoareTripleChecker+Valid, 16545 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:23,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4177 Valid, 16545 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 15:39:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2024-11-18 15:39:23,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 2927. [2024-11-18 15:39:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2766 states have (on average 1.759580621836587) internal successors, (4867), 2789 states have internal predecessors, (4867), 87 states have call successors, (87), 53 states have call predecessors, (87), 72 states have return successors, (149), 92 states have call predecessors, (149), 85 states have call successors, (149) [2024-11-18 15:39:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 5103 transitions. [2024-11-18 15:39:23,246 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 5103 transitions. Word has length 58 [2024-11-18 15:39:23,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:23,248 INFO L471 AbstractCegarLoop]: Abstraction has 2927 states and 5103 transitions. [2024-11-18 15:39:23,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:39:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 5103 transitions. [2024-11-18 15:39:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-18 15:39:23,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:23,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:23,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 15:39:23,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:23,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash -887206831, now seen corresponding path program 1 times [2024-11-18 15:39:23,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:23,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544730318] [2024-11-18 15:39:23,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:23,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 15:39:23,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:23,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544730318] [2024-11-18 15:39:23,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544730318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:23,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 15:39:23,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 15:39:23,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722215538] [2024-11-18 15:39:23,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:23,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:39:23,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:23,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:39:23,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 15:39:23,311 INFO L87 Difference]: Start difference. First operand 2927 states and 5103 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:39:23,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:23,455 INFO L93 Difference]: Finished difference Result 4160 states and 6876 transitions. [2024-11-18 15:39:23,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:39:23,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-18 15:39:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:23,468 INFO L225 Difference]: With dead ends: 4160 [2024-11-18 15:39:23,469 INFO L226 Difference]: Without dead ends: 3364 [2024-11-18 15:39:23,473 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-11-18 15:39:23,474 INFO L432 NwaCegarLoop]: 4227 mSDtfsCounter, 4208 mSDsluCounter, 4170 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4208 SdHoareTripleChecker+Valid, 8397 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:23,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4208 Valid, 8397 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:39:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2024-11-18 15:39:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 3341. [2024-11-18 15:39:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3341 states, 3095 states have (on average 1.7101777059773828) internal successors, (5293), 3129 states have internal predecessors, (5293), 136 states have call successors, (136), 83 states have call predecessors, (136), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2024-11-18 15:39:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 5640 transitions. [2024-11-18 15:39:23,585 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 5640 transitions. Word has length 58 [2024-11-18 15:39:23,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:23,585 INFO L471 AbstractCegarLoop]: Abstraction has 3341 states and 5640 transitions. [2024-11-18 15:39:23,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 15:39:23,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 5640 transitions. [2024-11-18 15:39:23,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-18 15:39:23,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:23,588 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:23,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 15:39:23,589 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:23,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1808175973, now seen corresponding path program 1 times [2024-11-18 15:39:23,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:23,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736058388] [2024-11-18 15:39:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:23,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-18 15:39:23,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736058388] [2024-11-18 15:39:23,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736058388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:39:23,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536971734] [2024-11-18 15:39:23,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:23,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:23,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:39:23,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 15:39:23,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 15:39:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:23,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 15:39:23,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:39:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 15:39:23,775 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:39:23,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536971734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:23,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:39:23,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 15:39:23,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983692688] [2024-11-18 15:39:23,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:23,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:39:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:23,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:39:23,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:23,777 INFO L87 Difference]: Start difference. First operand 3341 states and 5640 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-18 15:39:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:23,875 INFO L93 Difference]: Finished difference Result 5640 states and 8870 transitions. [2024-11-18 15:39:23,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:39:23,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-11-18 15:39:23,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:23,892 INFO L225 Difference]: With dead ends: 5640 [2024-11-18 15:39:23,893 INFO L226 Difference]: Without dead ends: 4431 [2024-11-18 15:39:23,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:23,898 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 115 mSDsluCounter, 4109 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 8341 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:23,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 8341 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:39:23,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4431 states. [2024-11-18 15:39:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4431 to 4431. [2024-11-18 15:39:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4431 states, 3962 states have (on average 1.627208480565371) internal successors, (6447), 4023 states have internal predecessors, (6447), 255 states have call successors, (255), 161 states have call predecessors, (255), 212 states have return successors, (440), 262 states have call predecessors, (440), 253 states have call successors, (440) [2024-11-18 15:39:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4431 states to 4431 states and 7142 transitions. [2024-11-18 15:39:24,041 INFO L78 Accepts]: Start accepts. Automaton has 4431 states and 7142 transitions. Word has length 94 [2024-11-18 15:39:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:24,041 INFO L471 AbstractCegarLoop]: Abstraction has 4431 states and 7142 transitions. [2024-11-18 15:39:24,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-18 15:39:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 4431 states and 7142 transitions. [2024-11-18 15:39:24,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-18 15:39:24,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:24,051 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:24,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 15:39:24,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-18 15:39:24,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:24,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:24,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2088529656, now seen corresponding path program 1 times [2024-11-18 15:39:24,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:24,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545498548] [2024-11-18 15:39:24,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:24,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-18 15:39:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545498548] [2024-11-18 15:39:24,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545498548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:39:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301806678] [2024-11-18 15:39:24,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:24,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:24,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:39:24,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 15:39:24,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 15:39:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:24,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 15:39:24,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:39:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 15:39:24,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:39:24,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301806678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:24,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:39:24,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-18 15:39:24,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525172530] [2024-11-18 15:39:24,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:24,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:39:24,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:24,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:39:24,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:24,536 INFO L87 Difference]: Start difference. First operand 4431 states and 7142 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 15:39:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:24,764 INFO L93 Difference]: Finished difference Result 8887 states and 13323 transitions. [2024-11-18 15:39:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:39:24,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 121 [2024-11-18 15:39:24,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:24,802 INFO L225 Difference]: With dead ends: 8887 [2024-11-18 15:39:24,802 INFO L226 Difference]: Without dead ends: 6591 [2024-11-18 15:39:24,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:24,812 INFO L432 NwaCegarLoop]: 4131 mSDtfsCounter, 4038 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4038 SdHoareTripleChecker+Valid, 4264 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:24,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4038 Valid, 4264 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:39:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6591 states. [2024-11-18 15:39:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6591 to 6531. [2024-11-18 15:39:25,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6531 states, 5640 states have (on average 1.5398936170212767) internal successors, (8685), 5758 states have internal predecessors, (8685), 475 states have call successors, (475), 311 states have call predecessors, (475), 414 states have return successors, (816), 477 states have call predecessors, (816), 473 states have call successors, (816) [2024-11-18 15:39:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6531 states to 6531 states and 9976 transitions. [2024-11-18 15:39:25,053 INFO L78 Accepts]: Start accepts. Automaton has 6531 states and 9976 transitions. Word has length 121 [2024-11-18 15:39:25,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:25,055 INFO L471 AbstractCegarLoop]: Abstraction has 6531 states and 9976 transitions. [2024-11-18 15:39:25,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 15:39:25,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6531 states and 9976 transitions. [2024-11-18 15:39:25,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-18 15:39:25,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:25,067 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:25,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 15:39:25,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-18 15:39:25,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:25,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:25,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1607628711, now seen corresponding path program 1 times [2024-11-18 15:39:25,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:25,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385168679] [2024-11-18 15:39:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-18 15:39:25,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:25,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385168679] [2024-11-18 15:39:25,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385168679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:39:25,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39238942] [2024-11-18 15:39:25,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:25,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:25,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:39:25,333 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 15:39:25,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 15:39:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:25,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 15:39:25,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:39:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-18 15:39:25,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:39:25,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39238942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:25,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:39:25,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 15:39:25,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035526338] [2024-11-18 15:39:25,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:25,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:39:25,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:25,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:39:25,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:25,468 INFO L87 Difference]: Start difference. First operand 6531 states and 9976 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 15:39:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:25,623 INFO L93 Difference]: Finished difference Result 9933 states and 14621 transitions. [2024-11-18 15:39:25,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:39:25,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 138 [2024-11-18 15:39:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:25,646 INFO L225 Difference]: With dead ends: 9933 [2024-11-18 15:39:25,646 INFO L226 Difference]: Without dead ends: 6859 [2024-11-18 15:39:25,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:25,657 INFO L432 NwaCegarLoop]: 4136 mSDtfsCounter, 4059 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4059 SdHoareTripleChecker+Valid, 4277 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:25,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4059 Valid, 4277 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:39:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6859 states. [2024-11-18 15:39:25,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6859 to 6821. [2024-11-18 15:39:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6821 states, 5898 states have (on average 1.513903017972194) internal successors, (8929), 6016 states have internal predecessors, (8929), 481 states have call successors, (481), 337 states have call predecessors, (481), 440 states have return successors, (848), 483 states have call predecessors, (848), 479 states have call successors, (848) [2024-11-18 15:39:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 10258 transitions. [2024-11-18 15:39:25,996 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 10258 transitions. Word has length 138 [2024-11-18 15:39:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:25,997 INFO L471 AbstractCegarLoop]: Abstraction has 6821 states and 10258 transitions. [2024-11-18 15:39:25,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 15:39:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 10258 transitions. [2024-11-18 15:39:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-18 15:39:26,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:26,008 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:26,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 15:39:26,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:26,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:26,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:26,214 INFO L85 PathProgramCache]: Analyzing trace with hash -247267866, now seen corresponding path program 1 times [2024-11-18 15:39:26,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:26,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320059316] [2024-11-18 15:39:26,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:26,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-18 15:39:26,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:26,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320059316] [2024-11-18 15:39:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320059316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:39:26,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836413284] [2024-11-18 15:39:26,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:26,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:26,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:39:26,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 15:39:26,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 15:39:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:26,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 15:39:26,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:39:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-18 15:39:26,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:39:26,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836413284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:26,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:39:26,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 15:39:26,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494449496] [2024-11-18 15:39:26,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:26,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:39:26,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:26,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:39:26,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:26,395 INFO L87 Difference]: Start difference. First operand 6821 states and 10258 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-18 15:39:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:26,674 INFO L93 Difference]: Finished difference Result 15833 states and 22512 transitions. [2024-11-18 15:39:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:39:26,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 139 [2024-11-18 15:39:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:26,718 INFO L225 Difference]: With dead ends: 15833 [2024-11-18 15:39:26,718 INFO L226 Difference]: Without dead ends: 11149 [2024-11-18 15:39:26,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:26,735 INFO L432 NwaCegarLoop]: 4226 mSDtfsCounter, 126 mSDsluCounter, 4106 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 8332 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:26,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 8332 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:39:26,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11149 states. [2024-11-18 15:39:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11149 to 11133. [2024-11-18 15:39:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11133 states, 9340 states have (on average 1.4279443254817987) internal successors, (13337), 9574 states have internal predecessors, (13337), 927 states have call successors, (927), 657 states have call predecessors, (927), 864 states have return successors, (1806), 933 states have call predecessors, (1806), 925 states have call successors, (1806) [2024-11-18 15:39:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11133 states to 11133 states and 16070 transitions. [2024-11-18 15:39:27,366 INFO L78 Accepts]: Start accepts. Automaton has 11133 states and 16070 transitions. Word has length 139 [2024-11-18 15:39:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:27,367 INFO L471 AbstractCegarLoop]: Abstraction has 11133 states and 16070 transitions. [2024-11-18 15:39:27,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-18 15:39:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 11133 states and 16070 transitions. [2024-11-18 15:39:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 15:39:27,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:27,387 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:27,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 15:39:27,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:27,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:27,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:27,589 INFO L85 PathProgramCache]: Analyzing trace with hash -795398658, now seen corresponding path program 1 times [2024-11-18 15:39:27,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:27,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494587664] [2024-11-18 15:39:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:27,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:39:27,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:27,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494587664] [2024-11-18 15:39:27,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494587664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:39:27,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241408834] [2024-11-18 15:39:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:27,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:27,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:39:27,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 15:39:27,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 15:39:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:27,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 15:39:27,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:39:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-18 15:39:27,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:39:27,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241408834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:27,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:39:27,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 15:39:27,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126178431] [2024-11-18 15:39:27,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:27,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:39:27,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:27,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:39:27,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:27,779 INFO L87 Difference]: Start difference. First operand 11133 states and 16070 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-18 15:39:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:28,275 INFO L93 Difference]: Finished difference Result 15807 states and 22674 transitions. [2024-11-18 15:39:28,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:39:28,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 140 [2024-11-18 15:39:28,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:28,329 INFO L225 Difference]: With dead ends: 15807 [2024-11-18 15:39:28,329 INFO L226 Difference]: Without dead ends: 11169 [2024-11-18 15:39:28,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:28,352 INFO L432 NwaCegarLoop]: 4195 mSDtfsCounter, 111 mSDsluCounter, 4100 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 8295 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:28,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 8295 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:39:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11169 states. [2024-11-18 15:39:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11169 to 11109. [2024-11-18 15:39:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11109 states, 9316 states have (on average 1.4148776298840704) internal successors, (13181), 9550 states have internal predecessors, (13181), 927 states have call successors, (927), 657 states have call predecessors, (927), 864 states have return successors, (1806), 933 states have call predecessors, (1806), 925 states have call successors, (1806) [2024-11-18 15:39:28,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11109 states to 11109 states and 15914 transitions. [2024-11-18 15:39:28,914 INFO L78 Accepts]: Start accepts. Automaton has 11109 states and 15914 transitions. Word has length 140 [2024-11-18 15:39:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:28,914 INFO L471 AbstractCegarLoop]: Abstraction has 11109 states and 15914 transitions. [2024-11-18 15:39:28,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-18 15:39:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 11109 states and 15914 transitions. [2024-11-18 15:39:28,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 15:39:28,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:28,931 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:28,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 15:39:29,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-18 15:39:29,132 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:29,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:29,133 INFO L85 PathProgramCache]: Analyzing trace with hash -746004992, now seen corresponding path program 1 times [2024-11-18 15:39:29,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:29,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191509723] [2024-11-18 15:39:29,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:29,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:29,188 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:39:29,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:29,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191509723] [2024-11-18 15:39:29,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191509723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:39:29,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025444116] [2024-11-18 15:39:29,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:29,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:29,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:39:29,191 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 15:39:29,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 15:39:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:29,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 15:39:29,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:39:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-18 15:39:29,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:39:29,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025444116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:29,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:39:29,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 15:39:29,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742541611] [2024-11-18 15:39:29,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:29,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:39:29,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:29,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:39:29,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:29,301 INFO L87 Difference]: Start difference. First operand 11109 states and 15914 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-18 15:39:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:29,606 INFO L93 Difference]: Finished difference Result 17681 states and 24964 transitions. [2024-11-18 15:39:29,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:39:29,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 140 [2024-11-18 15:39:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:29,640 INFO L225 Difference]: With dead ends: 17681 [2024-11-18 15:39:29,641 INFO L226 Difference]: Without dead ends: 9769 [2024-11-18 15:39:29,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:29,661 INFO L432 NwaCegarLoop]: 4113 mSDtfsCounter, 4089 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4089 SdHoareTripleChecker+Valid, 4137 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:29,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4089 Valid, 4137 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:39:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9769 states. [2024-11-18 15:39:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9769 to 9337. [2024-11-18 15:39:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9337 states, 7950 states have (on average 1.4026415094339624) internal successors, (11151), 8072 states have internal predecessors, (11151), 755 states have call successors, (755), 535 states have call predecessors, (755), 630 states have return successors, (1162), 745 states have call predecessors, (1162), 753 states have call successors, (1162) [2024-11-18 15:39:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9337 states to 9337 states and 13068 transitions. [2024-11-18 15:39:29,977 INFO L78 Accepts]: Start accepts. Automaton has 9337 states and 13068 transitions. Word has length 140 [2024-11-18 15:39:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:29,978 INFO L471 AbstractCegarLoop]: Abstraction has 9337 states and 13068 transitions. [2024-11-18 15:39:29,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-18 15:39:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 9337 states and 13068 transitions. [2024-11-18 15:39:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 15:39:29,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:29,988 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:30,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 15:39:30,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:30,190 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:30,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:30,190 INFO L85 PathProgramCache]: Analyzing trace with hash 330406047, now seen corresponding path program 1 times [2024-11-18 15:39:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:30,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454118994] [2024-11-18 15:39:30,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:30,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:39:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454118994] [2024-11-18 15:39:30,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454118994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:39:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644603075] [2024-11-18 15:39:30,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:30,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:30,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:39:30,252 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 15:39:30,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 15:39:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:30,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 15:39:30,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:39:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-18 15:39:30,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:39:30,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644603075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:30,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:39:30,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-18 15:39:30,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194663342] [2024-11-18 15:39:30,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:30,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 15:39:30,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:30,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 15:39:30,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 15:39:30,425 INFO L87 Difference]: Start difference. First operand 9337 states and 13068 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-18 15:39:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:30,734 INFO L93 Difference]: Finished difference Result 12117 states and 16715 transitions. [2024-11-18 15:39:30,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:39:30,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2024-11-18 15:39:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:30,763 INFO L225 Difference]: With dead ends: 12117 [2024-11-18 15:39:30,763 INFO L226 Difference]: Without dead ends: 7421 [2024-11-18 15:39:30,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-18 15:39:30,777 INFO L432 NwaCegarLoop]: 4059 mSDtfsCounter, 4108 mSDsluCounter, 8073 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4116 SdHoareTripleChecker+Valid, 12132 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:30,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4116 Valid, 12132 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:39:30,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7421 states. [2024-11-18 15:39:30,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7421 to 7397. [2024-11-18 15:39:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7397 states, 6400 states have (on average 1.42515625) internal successors, (9121), 6454 states have internal predecessors, (9121), 567 states have call successors, (567), 397 states have call predecessors, (567), 428 states have return successors, (766), 553 states have call predecessors, (766), 565 states have call successors, (766) [2024-11-18 15:39:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7397 states to 7397 states and 10454 transitions. [2024-11-18 15:39:31,026 INFO L78 Accepts]: Start accepts. Automaton has 7397 states and 10454 transitions. Word has length 141 [2024-11-18 15:39:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:31,026 INFO L471 AbstractCegarLoop]: Abstraction has 7397 states and 10454 transitions. [2024-11-18 15:39:31,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-18 15:39:31,027 INFO L276 IsEmpty]: Start isEmpty. Operand 7397 states and 10454 transitions. [2024-11-18 15:39:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 15:39:31,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:31,033 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:31,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-18 15:39:31,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:31,237 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:31,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:31,237 INFO L85 PathProgramCache]: Analyzing trace with hash -292875555, now seen corresponding path program 1 times [2024-11-18 15:39:31,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:31,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200377109] [2024-11-18 15:39:31,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:39:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:31,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200377109] [2024-11-18 15:39:31,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200377109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:39:31,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332652047] [2024-11-18 15:39:31,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:31,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:31,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:39:31,301 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 15:39:31,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 15:39:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:31,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 15:39:31,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:39:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-18 15:39:31,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:39:31,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332652047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:31,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:39:31,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-18 15:39:31,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624006993] [2024-11-18 15:39:31,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:31,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 15:39:31,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:31,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 15:39:31,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 15:39:31,492 INFO L87 Difference]: Start difference. First operand 7397 states and 10454 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-18 15:39:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:31,818 INFO L93 Difference]: Finished difference Result 11699 states and 15964 transitions. [2024-11-18 15:39:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 15:39:31,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2024-11-18 15:39:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:31,845 INFO L225 Difference]: With dead ends: 11699 [2024-11-18 15:39:31,846 INFO L226 Difference]: Without dead ends: 7025 [2024-11-18 15:39:31,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-18 15:39:31,858 INFO L432 NwaCegarLoop]: 4057 mSDtfsCounter, 4146 mSDsluCounter, 8068 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4155 SdHoareTripleChecker+Valid, 12125 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:31,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4155 Valid, 12125 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:39:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2024-11-18 15:39:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 5263. [2024-11-18 15:39:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5263 states, 4686 states have (on average 1.479726845924029) internal successors, (6934), 4716 states have internal predecessors, (6934), 331 states have call successors, (331), 229 states have call predecessors, (331), 244 states have return successors, (439), 321 states have call predecessors, (439), 329 states have call successors, (439) [2024-11-18 15:39:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 7704 transitions. [2024-11-18 15:39:32,041 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 7704 transitions. Word has length 141 [2024-11-18 15:39:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:32,042 INFO L471 AbstractCegarLoop]: Abstraction has 5263 states and 7704 transitions. [2024-11-18 15:39:32,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-18 15:39:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 7704 transitions. [2024-11-18 15:39:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-18 15:39:32,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:32,046 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:32,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-18 15:39:32,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-18 15:39:32,246 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:32,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:32,247 INFO L85 PathProgramCache]: Analyzing trace with hash -174434081, now seen corresponding path program 1 times [2024-11-18 15:39:32,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:32,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990921392] [2024-11-18 15:39:32,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:32,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:39:32,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:32,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990921392] [2024-11-18 15:39:32,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990921392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:39:32,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841985228] [2024-11-18 15:39:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:32,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:32,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:39:32,305 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 15:39:32,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 15:39:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:32,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 15:39:32,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:39:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-18 15:39:32,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 15:39:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:39:32,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841985228] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 15:39:32,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 15:39:32,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2024-11-18 15:39:32,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238873174] [2024-11-18 15:39:32,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:32,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 15:39:32,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:32,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 15:39:32,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 15:39:32,569 INFO L87 Difference]: Start difference. First operand 5263 states and 7704 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 15:39:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:32,878 INFO L93 Difference]: Finished difference Result 9208 states and 12352 transitions. [2024-11-18 15:39:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 15:39:32,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 141 [2024-11-18 15:39:32,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:32,904 INFO L225 Difference]: With dead ends: 9208 [2024-11-18 15:39:32,904 INFO L226 Difference]: Without dead ends: 7712 [2024-11-18 15:39:32,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 15:39:32,911 INFO L432 NwaCegarLoop]: 4207 mSDtfsCounter, 4184 mSDsluCounter, 4159 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4184 SdHoareTripleChecker+Valid, 8366 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:32,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4184 Valid, 8366 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 15:39:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7712 states. [2024-11-18 15:39:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7712 to 6410. [2024-11-18 15:39:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6410 states, 5625 states have (on average 1.4195555555555555) internal successors, (7985), 5659 states have internal predecessors, (7985), 451 states have call successors, (451), 309 states have call predecessors, (451), 332 states have return successors, (597), 445 states have call predecessors, (597), 449 states have call successors, (597) [2024-11-18 15:39:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6410 states to 6410 states and 9033 transitions. [2024-11-18 15:39:33,142 INFO L78 Accepts]: Start accepts. Automaton has 6410 states and 9033 transitions. Word has length 141 [2024-11-18 15:39:33,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:33,143 INFO L471 AbstractCegarLoop]: Abstraction has 6410 states and 9033 transitions. [2024-11-18 15:39:33,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 15:39:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 6410 states and 9033 transitions. [2024-11-18 15:39:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-18 15:39:33,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:33,147 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:33,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-18 15:39:33,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-18 15:39:33,348 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:33,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:33,349 INFO L85 PathProgramCache]: Analyzing trace with hash 132066951, now seen corresponding path program 1 times [2024-11-18 15:39:33,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:33,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163853768] [2024-11-18 15:39:33,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:33,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:39:33,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:33,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163853768] [2024-11-18 15:39:33,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163853768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:39:33,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810486436] [2024-11-18 15:39:33,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:33,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:33,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:39:33,417 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 15:39:33,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-18 15:39:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:33,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 15:39:33,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:39:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-18 15:39:33,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:39:33,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810486436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:33,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:39:33,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 15:39:33,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251873709] [2024-11-18 15:39:33,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:33,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 15:39:33,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:33,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 15:39:33,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:33,517 INFO L87 Difference]: Start difference. First operand 6410 states and 9033 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 15:39:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:33,764 INFO L93 Difference]: Finished difference Result 8469 states and 11470 transitions. [2024-11-18 15:39:33,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 15:39:33,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 145 [2024-11-18 15:39:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:33,783 INFO L225 Difference]: With dead ends: 8469 [2024-11-18 15:39:33,784 INFO L226 Difference]: Without dead ends: 6414 [2024-11-18 15:39:33,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 15:39:33,795 INFO L432 NwaCegarLoop]: 4105 mSDtfsCounter, 0 mSDsluCounter, 4094 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8199 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:33,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8199 Invalid, 12 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:39:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6414 states. [2024-11-18 15:39:33,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6414 to 6414. [2024-11-18 15:39:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6414 states, 5629 states have (on average 1.4192574169479482) internal successors, (7989), 5663 states have internal predecessors, (7989), 451 states have call successors, (451), 309 states have call predecessors, (451), 332 states have return successors, (597), 445 states have call predecessors, (597), 449 states have call successors, (597) [2024-11-18 15:39:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6414 states to 6414 states and 9037 transitions. [2024-11-18 15:39:34,021 INFO L78 Accepts]: Start accepts. Automaton has 6414 states and 9037 transitions. Word has length 145 [2024-11-18 15:39:34,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:34,022 INFO L471 AbstractCegarLoop]: Abstraction has 6414 states and 9037 transitions. [2024-11-18 15:39:34,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-18 15:39:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 6414 states and 9037 transitions. [2024-11-18 15:39:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 15:39:34,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:34,026 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:34,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-18 15:39:34,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-18 15:39:34,231 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:34,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:34,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1028348356, now seen corresponding path program 1 times [2024-11-18 15:39:34,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:34,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396507638] [2024-11-18 15:39:34,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:34,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:39:34,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:34,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396507638] [2024-11-18 15:39:34,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396507638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:39:34,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434885781] [2024-11-18 15:39:34,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:34,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:34,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:39:34,296 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 15:39:34,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-18 15:39:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:34,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 15:39:34,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:39:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-18 15:39:34,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:39:34,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434885781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:34,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:39:34,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-18 15:39:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868114826] [2024-11-18 15:39:34,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:34,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 15:39:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:34,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 15:39:34,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 15:39:34,401 INFO L87 Difference]: Start difference. First operand 6414 states and 9037 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 15:39:34,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:34,557 INFO L93 Difference]: Finished difference Result 8562 states and 11621 transitions. [2024-11-18 15:39:34,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 15:39:34,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 146 [2024-11-18 15:39:34,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:34,574 INFO L225 Difference]: With dead ends: 8562 [2024-11-18 15:39:34,575 INFO L226 Difference]: Without dead ends: 4996 [2024-11-18 15:39:34,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 15:39:34,581 INFO L432 NwaCegarLoop]: 4103 mSDtfsCounter, 0 mSDsluCounter, 12303 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16406 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:34,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16406 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:39:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4996 states. [2024-11-18 15:39:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4996 to 4996. [2024-11-18 15:39:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4996 states, 4459 states have (on average 1.4772370486656201) internal successors, (6587), 4485 states have internal predecessors, (6587), 307 states have call successors, (307), 205 states have call predecessors, (307), 228 states have return successors, (361), 309 states have call predecessors, (361), 305 states have call successors, (361) [2024-11-18 15:39:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 7255 transitions. [2024-11-18 15:39:34,740 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 7255 transitions. Word has length 146 [2024-11-18 15:39:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:34,740 INFO L471 AbstractCegarLoop]: Abstraction has 4996 states and 7255 transitions. [2024-11-18 15:39:34,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 15:39:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 7255 transitions. [2024-11-18 15:39:34,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 15:39:34,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:34,744 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:34,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-18 15:39:34,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-18 15:39:34,948 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:34,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:34,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1397305092, now seen corresponding path program 1 times [2024-11-18 15:39:34,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:34,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110794244] [2024-11-18 15:39:34,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:34,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 15:39:35,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 15:39:35,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110794244] [2024-11-18 15:39:35,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110794244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 15:39:35,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266139028] [2024-11-18 15:39:35,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:35,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 15:39:35,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 15:39:35,015 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 15:39:35,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-18 15:39:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 15:39:35,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 15:39:35,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 15:39:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-18 15:39:35,106 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 15:39:35,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266139028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 15:39:35,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 15:39:35,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-18 15:39:35,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236757144] [2024-11-18 15:39:35,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 15:39:35,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 15:39:35,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 15:39:35,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 15:39:35,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 15:39:35,108 INFO L87 Difference]: Start difference. First operand 4996 states and 7255 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 15:39:35,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 15:39:35,237 INFO L93 Difference]: Finished difference Result 6720 states and 9259 transitions. [2024-11-18 15:39:35,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 15:39:35,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 146 [2024-11-18 15:39:35,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 15:39:35,249 INFO L225 Difference]: With dead ends: 6720 [2024-11-18 15:39:35,250 INFO L226 Difference]: Without dead ends: 2926 [2024-11-18 15:39:35,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 15:39:35,256 INFO L432 NwaCegarLoop]: 4101 mSDtfsCounter, 0 mSDsluCounter, 12297 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16398 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 15:39:35,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16398 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 15:39:35,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2024-11-18 15:39:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2926. [2024-11-18 15:39:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2779 states have (on average 1.6854983807124866) internal successors, (4684), 2787 states have internal predecessors, (4684), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2024-11-18 15:39:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4855 transitions. [2024-11-18 15:39:35,331 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4855 transitions. Word has length 146 [2024-11-18 15:39:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 15:39:35,332 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4855 transitions. [2024-11-18 15:39:35,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 15:39:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4855 transitions. [2024-11-18 15:39:35,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 15:39:35,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 15:39:35,334 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:35,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-18 15:39:35,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-18 15:39:35,535 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 15:39:35,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 15:39:35,535 INFO L85 PathProgramCache]: Analyzing trace with hash -707496704, now seen corresponding path program 1 times [2024-11-18 15:39:35,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 15:39:35,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819274071] [2024-11-18 15:39:35,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 15:39:35,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 15:39:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 15:39:35,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 15:39:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 15:39:35,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 15:39:35,595 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 15:39:35,596 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-18 15:39:35,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-18 15:39:35,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-18 15:39:35,602 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 15:39:35,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 15:39:35,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:39:35 BoogieIcfgContainer [2024-11-18 15:39:35,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 15:39:35,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 15:39:35,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 15:39:35,694 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 15:39:35,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:39:20" (3/4) ... [2024-11-18 15:39:35,695 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 15:39:35,780 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 15:39:35,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 15:39:35,780 INFO L158 Benchmark]: Toolchain (without parser) took 25303.97ms. Allocated memory was 163.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 104.7MB in the beginning and 725.0MB in the end (delta: -620.2MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-18 15:39:35,780 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 43.4MB in the beginning and 43.2MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 15:39:35,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2455.13ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 104.7MB in the beginning and 81.1MB in the end (delta: 23.7MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. [2024-11-18 15:39:35,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 334.64ms. Allocated memory is still 243.3MB. Free memory was 81.1MB in the beginning and 72.3MB in the end (delta: 8.7MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-11-18 15:39:35,781 INFO L158 Benchmark]: Boogie Preprocessor took 510.81ms. Allocated memory was 243.3MB in the beginning and 354.4MB in the end (delta: 111.1MB). Free memory was 72.3MB in the beginning and 181.9MB in the end (delta: -109.6MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2024-11-18 15:39:35,781 INFO L158 Benchmark]: RCFGBuilder took 6442.80ms. Allocated memory was 354.4MB in the beginning and 1.1GB in the end (delta: 794.8MB). Free memory was 181.9MB in the beginning and 816.8MB in the end (delta: -634.9MB). Peak memory consumption was 353.9MB. Max. memory is 16.1GB. [2024-11-18 15:39:35,781 INFO L158 Benchmark]: TraceAbstraction took 15468.97ms. Allocated memory was 1.1GB in the beginning and 2.1GB in the end (delta: 962.6MB). Free memory was 815.8MB in the beginning and 743.9MB in the end (delta: 71.9MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-18 15:39:35,781 INFO L158 Benchmark]: Witness Printer took 85.72ms. Allocated memory is still 2.1GB. Free memory was 743.9MB in the beginning and 725.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-18 15:39:35,783 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.17ms. Allocated memory is still 96.5MB. Free memory was 43.4MB in the beginning and 43.2MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2455.13ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 104.7MB in the beginning and 81.1MB in the end (delta: 23.7MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 334.64ms. Allocated memory is still 243.3MB. Free memory was 81.1MB in the beginning and 72.3MB in the end (delta: 8.7MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 510.81ms. Allocated memory was 243.3MB in the beginning and 354.4MB in the end (delta: 111.1MB). Free memory was 72.3MB in the beginning and 181.9MB in the end (delta: -109.6MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * RCFGBuilder took 6442.80ms. Allocated memory was 354.4MB in the beginning and 1.1GB in the end (delta: 794.8MB). Free memory was 181.9MB in the beginning and 816.8MB in the end (delta: -634.9MB). Peak memory consumption was 353.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15468.97ms. Allocated memory was 1.1GB in the beginning and 2.1GB in the end (delta: 962.6MB). Free memory was 815.8MB in the beginning and 743.9MB in the end (delta: 71.9MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 85.72ms. Allocated memory is still 2.1GB. Free memory was 743.9MB in the beginning and 725.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11133]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2300 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46057 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46003 mSDsluCounter, 181868 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111369 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1857 IncrementalHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 70499 mSDtfsCounter, 1857 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1866 GetRequests, 1782 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11133occurred in iteration=9, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 3892 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3700 NumberOfCodeBlocks, 3700 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3665 ConstructedInterpolants, 0 QuantifiedInterpolants, 4734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5097 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 30 InterpolantComputations, 17 PerfectInterpolantSequences, 1657/1918 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-18 15:39:35,813 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