./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c5568751dd37ae3ac79e02a0fd7273b3ab2af9e94f13bec2f84e6a22bfe26f6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:16:01,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:16:01,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:16:01,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:16:01,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:16:01,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:16:01,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:16:01,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:16:01,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:16:01,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:16:01,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:16:01,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:16:01,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:16:01,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:16:01,691 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:16:01,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:16:01,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:16:01,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:16:01,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:16:01,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:16:01,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:16:01,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:16:01,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:16:01,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:16:01,701 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:16:01,705 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:16:01,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:16:01,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:16:01,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:16:01,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:16:01,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:16:01,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:16:01,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:16:01,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:16:01,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:16:01,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:16:01,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:16:01,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:16:01,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:16:01,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:16:01,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:16:01,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:16:01,719 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2c5568751dd37ae3ac79e02a0fd7273b3ab2af9e94f13bec2f84e6a22bfe26f6 [2024-10-11 04:16:02,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:16:02,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:16:02,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:16:02,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:16:02,247 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:16:02,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c [2024-10-11 04:16:03,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:16:04,434 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:16:04,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c [2024-10-11 04:16:04,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2b6fe599f/67c40bb97f0540b08de69b75d93fdd12/FLAG4b18dca48 [2024-10-11 04:16:04,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2b6fe599f/67c40bb97f0540b08de69b75d93fdd12 [2024-10-11 04:16:04,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:16:04,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:16:04,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:16:04,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:16:04,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:16:04,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:16:04" (1/1) ... [2024-10-11 04:16:04,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0806df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:04, skipping insertion in model container [2024-10-11 04:16:04,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:16:04" (1/1) ... [2024-10-11 04:16:04,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:16:06,302 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c[381679,381692] [2024-10-11 04:16:06,333 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c[383339,383352] [2024-10-11 04:16:06,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:16:06,586 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:16:07,336 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c[381679,381692] [2024-10-11 04:16:07,340 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c[383339,383352] [2024-10-11 04:16:07,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:16:07,398 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:16:07,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07 WrapperNode [2024-10-11 04:16:07,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:16:07,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:16:07,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:16:07,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:16:07,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07" (1/1) ... [2024-10-11 04:16:07,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07" (1/1) ... [2024-10-11 04:16:07,848 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 12759 [2024-10-11 04:16:07,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:16:07,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:16:07,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:16:07,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:16:07,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07" (1/1) ... [2024-10-11 04:16:07,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07" (1/1) ... [2024-10-11 04:16:07,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07" (1/1) ... [2024-10-11 04:16:08,013 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:16:08,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07" (1/1) ... [2024-10-11 04:16:08,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07" (1/1) ... [2024-10-11 04:16:08,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07" (1/1) ... [2024-10-11 04:16:08,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07" (1/1) ... [2024-10-11 04:16:08,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07" (1/1) ... [2024-10-11 04:16:08,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07" (1/1) ... [2024-10-11 04:16:08,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:16:08,577 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:16:08,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:16:08,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:16:08,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07" (1/1) ... [2024-10-11 04:16:08,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:16:08,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:16:08,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:16:08,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:16:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:16:08,763 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:16:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:16:08,767 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:16:08,767 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:16:08,767 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:16:08,768 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:16:08,768 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:16:08,768 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:16:08,768 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:16:08,768 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:16:08,768 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:16:08,768 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:16:08,768 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:16:08,768 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:16:08,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:16:08,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:16:08,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:16:08,905 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:16:08,907 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:16:16,239 INFO L? ?]: Removed 1711 outVars from TransFormulas that were not future-live. [2024-10-11 04:16:16,239 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:16:16,317 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:16:16,317 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-11 04:16:16,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:16:16 BoogieIcfgContainer [2024-10-11 04:16:16,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:16:16,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:16:16,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:16:16,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:16:16,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:16:04" (1/3) ... [2024-10-11 04:16:16,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:16:16, skipping insertion in model container [2024-10-11 04:16:16,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:07" (2/3) ... [2024-10-11 04:16:16,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:16:16, skipping insertion in model container [2024-10-11 04:16:16,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:16:16" (3/3) ... [2024-10-11 04:16:16,324 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.04.cil-2.c [2024-10-11 04:16:16,337 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:16:16,337 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:16:16,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:16:16,490 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;@361dfb42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:16:16,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:16:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 2295 states, 2265 states have (on average 1.8838852097130243) internal successors, (4267), 2270 states have internal predecessors, (4267), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 04:16:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:16:16,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:16,516 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, 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-10-11 04:16:16,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:16,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1308670140, now seen corresponding path program 1 times [2024-10-11 04:16:16,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:16,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795145253] [2024-10-11 04:16:16,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:16,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:16,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:16:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:16:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:16,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:16:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:16,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:16:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:16,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:16:16,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:16,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795145253] [2024-10-11 04:16:16,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795145253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:16,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:16,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:16:16,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412737580] [2024-10-11 04:16:16,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:16,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:16:16,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:16,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:16:16,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:16:16,997 INFO L87 Difference]: Start difference. First operand has 2295 states, 2265 states have (on average 1.8838852097130243) internal successors, (4267), 2270 states have internal predecessors, (4267), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:17,673 INFO L93 Difference]: Finished difference Result 4635 states and 8694 transitions. [2024-10-11 04:16:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:16:17,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2024-10-11 04:16:17,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:17,697 INFO L225 Difference]: With dead ends: 4635 [2024-10-11 04:16:17,697 INFO L226 Difference]: Without dead ends: 2340 [2024-10-11 04:16:17,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:16:17,707 INFO L432 NwaCegarLoop]: 4116 mSDtfsCounter, 425 mSDsluCounter, 12046 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 16162 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:17,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 16162 Invalid, 491 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 04:16:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2024-10-11 04:16:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2290. [2024-10-11 04:16:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2290 states, 2262 states have (on average 1.8492484526967286) internal successors, (4183), 2265 states have internal predecessors, (4183), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 04:16:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 4221 transitions. [2024-10-11 04:16:17,914 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 4221 transitions. Word has length 82 [2024-10-11 04:16:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:17,915 INFO L471 AbstractCegarLoop]: Abstraction has 2290 states and 4221 transitions. [2024-10-11 04:16:17,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 4221 transitions. [2024-10-11 04:16:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:16:17,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:17,919 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, 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-10-11 04:16:17,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:16:17,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:17,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash -425434310, now seen corresponding path program 1 times [2024-10-11 04:16:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:17,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679625239] [2024-10-11 04:16:17,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:17,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:18,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:18,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:16:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:18,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:16:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:18,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:16:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:18,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:16:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:18,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:16:18,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:18,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679625239] [2024-10-11 04:16:18,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679625239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:18,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:18,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:16:18,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378624785] [2024-10-11 04:16:18,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:18,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:16:18,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:18,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:16:18,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:16:18,151 INFO L87 Difference]: Start difference. First operand 2290 states and 4221 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:19,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:19,376 INFO L93 Difference]: Finished difference Result 2711 states and 4899 transitions. [2024-10-11 04:16:19,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:16:19,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (6), 4 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 82 [2024-10-11 04:16:19,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:19,385 INFO L225 Difference]: With dead ends: 2711 [2024-10-11 04:16:19,386 INFO L226 Difference]: Without dead ends: 2552 [2024-10-11 04:16:19,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:16:19,388 INFO L432 NwaCegarLoop]: 4097 mSDtfsCounter, 4578 mSDsluCounter, 12271 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 16368 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:19,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 16368 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:16:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2024-10-11 04:16:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2451. [2024-10-11 04:16:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 2403 states have (on average 1.834789846025801) internal successors, (4409), 2407 states have internal predecessors, (4409), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-10-11 04:16:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 4476 transitions. [2024-10-11 04:16:19,438 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 4476 transitions. Word has length 82 [2024-10-11 04:16:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:19,438 INFO L471 AbstractCegarLoop]: Abstraction has 2451 states and 4476 transitions. [2024-10-11 04:16:19,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 4476 transitions. [2024-10-11 04:16:19,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:16:19,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:19,440 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, 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-10-11 04:16:19,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:16:19,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:19,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:19,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1427533574, now seen corresponding path program 1 times [2024-10-11 04:16:19,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:19,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551356453] [2024-10-11 04:16:19,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:19,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:19,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:16:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:19,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:16:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:19,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:16:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:19,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:16:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:16:19,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:19,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551356453] [2024-10-11 04:16:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551356453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:19,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:19,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:16:19,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858361577] [2024-10-11 04:16:19,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:19,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:16:19,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:19,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:16:19,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:16:19,571 INFO L87 Difference]: Start difference. First operand 2451 states and 4476 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:21,033 INFO L93 Difference]: Finished difference Result 3086 states and 5493 transitions. [2024-10-11 04:16:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:16:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 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 82 [2024-10-11 04:16:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:21,042 INFO L225 Difference]: With dead ends: 3086 [2024-10-11 04:16:21,043 INFO L226 Difference]: Without dead ends: 2766 [2024-10-11 04:16:21,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:16:21,045 INFO L432 NwaCegarLoop]: 4202 mSDtfsCounter, 4581 mSDsluCounter, 16604 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4592 SdHoareTripleChecker+Valid, 20806 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:21,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4592 Valid, 20806 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:16:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2024-10-11 04:16:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2601. [2024-10-11 04:16:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2601 states, 2533 states have (on average 1.8211606790367154) internal successors, (4613), 2538 states have internal predecessors, (4613), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-10-11 04:16:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 4708 transitions. [2024-10-11 04:16:21,104 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 4708 transitions. Word has length 82 [2024-10-11 04:16:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:21,105 INFO L471 AbstractCegarLoop]: Abstraction has 2601 states and 4708 transitions. [2024-10-11 04:16:21,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 4708 transitions. [2024-10-11 04:16:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:16:21,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:21,107 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, 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-10-11 04:16:21,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:16:21,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:21,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:21,107 INFO L85 PathProgramCache]: Analyzing trace with hash -473593416, now seen corresponding path program 1 times [2024-10-11 04:16:21,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:21,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628878620] [2024-10-11 04:16:21,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:21,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:21,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:21,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:16:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:21,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:16:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:21,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:16:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:21,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:16:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:21,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:16:21,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:21,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628878620] [2024-10-11 04:16:21,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628878620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:21,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:21,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:16:21,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832485589] [2024-10-11 04:16:21,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:21,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:16:21,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:21,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:16:21,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:16:21,382 INFO L87 Difference]: Start difference. First operand 2601 states and 4708 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:22,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:22,758 INFO L93 Difference]: Finished difference Result 3635 states and 6361 transitions. [2024-10-11 04:16:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:16:22,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 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 82 [2024-10-11 04:16:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:22,771 INFO L225 Difference]: With dead ends: 3635 [2024-10-11 04:16:22,772 INFO L226 Difference]: Without dead ends: 3165 [2024-10-11 04:16:22,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:16:22,775 INFO L432 NwaCegarLoop]: 4106 mSDtfsCounter, 4629 mSDsluCounter, 16349 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4640 SdHoareTripleChecker+Valid, 20455 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:22,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4640 Valid, 20455 Invalid, 1367 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [75 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:16:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2024-10-11 04:16:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 2902. [2024-10-11 04:16:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2902 states, 2794 states have (on average 1.7974230493915533) internal successors, (5022), 2801 states have internal predecessors, (5022), 72 states have call successors, (72), 31 states have call predecessors, (72), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-11 04:16:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 5177 transitions. [2024-10-11 04:16:22,967 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 5177 transitions. Word has length 82 [2024-10-11 04:16:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:22,967 INFO L471 AbstractCegarLoop]: Abstraction has 2902 states and 5177 transitions. [2024-10-11 04:16:22,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 5177 transitions. [2024-10-11 04:16:22,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:16:22,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:22,970 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, 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-10-11 04:16:22,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:16:22,970 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:22,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1689747142, now seen corresponding path program 1 times [2024-10-11 04:16:22,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:22,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221958201] [2024-10-11 04:16:22,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:22,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:23,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:16:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:23,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:16:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:23,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:16:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:23,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:16:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:16:23,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:23,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221958201] [2024-10-11 04:16:23,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221958201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:23,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:23,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:16:23,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154660557] [2024-10-11 04:16:23,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:23,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:16:23,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:23,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:16:23,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:16:23,157 INFO L87 Difference]: Start difference. First operand 2902 states and 5177 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:24,279 INFO L93 Difference]: Finished difference Result 3924 states and 6821 transitions. [2024-10-11 04:16:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:16:24,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 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 82 [2024-10-11 04:16:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:24,294 INFO L225 Difference]: With dead ends: 3924 [2024-10-11 04:16:24,294 INFO L226 Difference]: Without dead ends: 3153 [2024-10-11 04:16:24,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:16:24,298 INFO L432 NwaCegarLoop]: 4084 mSDtfsCounter, 4496 mSDsluCounter, 12167 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4508 SdHoareTripleChecker+Valid, 16251 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:24,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4508 Valid, 16251 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:16:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2024-10-11 04:16:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 2902. [2024-10-11 04:16:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2902 states, 2794 states have (on average 1.7956335003579098) internal successors, (5017), 2801 states have internal predecessors, (5017), 72 states have call successors, (72), 31 states have call predecessors, (72), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-11 04:16:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 5172 transitions. [2024-10-11 04:16:24,413 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 5172 transitions. Word has length 82 [2024-10-11 04:16:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:24,414 INFO L471 AbstractCegarLoop]: Abstraction has 2902 states and 5172 transitions. [2024-10-11 04:16:24,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 5172 transitions. [2024-10-11 04:16:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:16:24,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:24,416 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, 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-10-11 04:16:24,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:16:24,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:24,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:24,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1873252728, now seen corresponding path program 1 times [2024-10-11 04:16:24,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:24,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292550858] [2024-10-11 04:16:24,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:24,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:24,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:24,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:16:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:24,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:16:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:24,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:16:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:24,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:16:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:16:24,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:24,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292550858] [2024-10-11 04:16:24,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292550858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:24,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:24,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:16:24,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126092051] [2024-10-11 04:16:24,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:24,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:16:24,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:24,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:16:24,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:16:24,548 INFO L87 Difference]: Start difference. First operand 2902 states and 5172 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:26,272 INFO L93 Difference]: Finished difference Result 4905 states and 8338 transitions. [2024-10-11 04:16:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:16:26,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 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 82 [2024-10-11 04:16:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:26,292 INFO L225 Difference]: With dead ends: 4905 [2024-10-11 04:16:26,292 INFO L226 Difference]: Without dead ends: 4134 [2024-10-11 04:16:26,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:16:26,297 INFO L432 NwaCegarLoop]: 4198 mSDtfsCounter, 4725 mSDsluCounter, 16599 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4741 SdHoareTripleChecker+Valid, 20797 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:26,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4741 Valid, 20797 Invalid, 1555 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:16:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2024-10-11 04:16:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 3506. [2024-10-11 04:16:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3506 states, 3322 states have (on average 1.7585791691751957) internal successors, (5842), 3333 states have internal predecessors, (5842), 120 states have call successors, (120), 55 states have call predecessors, (120), 62 states have return successors, (153), 125 states have call predecessors, (153), 118 states have call successors, (153) [2024-10-11 04:16:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 6115 transitions. [2024-10-11 04:16:26,432 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 6115 transitions. Word has length 82 [2024-10-11 04:16:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:26,433 INFO L471 AbstractCegarLoop]: Abstraction has 3506 states and 6115 transitions. [2024-10-11 04:16:26,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 6115 transitions. [2024-10-11 04:16:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:16:26,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:26,434 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, 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-10-11 04:16:26,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:16:26,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:26,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1818859830, now seen corresponding path program 1 times [2024-10-11 04:16:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:26,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091884738] [2024-10-11 04:16:26,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:26,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:26,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:16:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:26,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:16:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:26,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:16:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:26,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:16:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:16:26,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:26,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091884738] [2024-10-11 04:16:26,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091884738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:26,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:26,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:16:26,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468277272] [2024-10-11 04:16:26,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:26,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:16:26,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:26,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:16:26,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:16:26,564 INFO L87 Difference]: Start difference. First operand 3506 states and 6115 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:28,189 INFO L93 Difference]: Finished difference Result 7133 states and 11845 transitions. [2024-10-11 04:16:28,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:16:28,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 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 82 [2024-10-11 04:16:28,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:28,218 INFO L225 Difference]: With dead ends: 7133 [2024-10-11 04:16:28,218 INFO L226 Difference]: Without dead ends: 5758 [2024-10-11 04:16:28,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:16:28,226 INFO L432 NwaCegarLoop]: 4197 mSDtfsCounter, 4598 mSDsluCounter, 16596 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4608 SdHoareTripleChecker+Valid, 20793 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:28,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4608 Valid, 20793 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:16:28,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5758 states. [2024-10-11 04:16:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5758 to 4629. [2024-10-11 04:16:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4629 states, 4297 states have (on average 1.7095648126599954) internal successors, (7346), 4316 states have internal predecessors, (7346), 212 states have call successors, (212), 103 states have call predecessors, (212), 118 states have return successors, (307), 225 states have call predecessors, (307), 210 states have call successors, (307) [2024-10-11 04:16:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4629 states to 4629 states and 7865 transitions. [2024-10-11 04:16:28,445 INFO L78 Accepts]: Start accepts. Automaton has 4629 states and 7865 transitions. Word has length 82 [2024-10-11 04:16:28,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:28,445 INFO L471 AbstractCegarLoop]: Abstraction has 4629 states and 7865 transitions. [2024-10-11 04:16:28,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:28,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4629 states and 7865 transitions. [2024-10-11 04:16:28,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:16:28,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:28,450 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, 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-10-11 04:16:28,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:16:28,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:28,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:28,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1401463224, now seen corresponding path program 1 times [2024-10-11 04:16:28,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:28,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367637022] [2024-10-11 04:16:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:28,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:28,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:28,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:16:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:16:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:16:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:28,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:16:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:16:28,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:28,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367637022] [2024-10-11 04:16:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367637022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:28,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:28,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:16:28,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248094850] [2024-10-11 04:16:28,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:28,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:16:28,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:28,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:16:28,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:16:28,587 INFO L87 Difference]: Start difference. First operand 4629 states and 7865 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:30,507 INFO L93 Difference]: Finished difference Result 11234 states and 18285 transitions. [2024-10-11 04:16:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:16:30,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 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 82 [2024-10-11 04:16:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:30,542 INFO L225 Difference]: With dead ends: 11234 [2024-10-11 04:16:30,542 INFO L226 Difference]: Without dead ends: 8736 [2024-10-11 04:16:30,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:16:30,550 INFO L432 NwaCegarLoop]: 4198 mSDtfsCounter, 4653 mSDsluCounter, 16599 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4669 SdHoareTripleChecker+Valid, 20797 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:30,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4669 Valid, 20797 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:16:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8736 states. [2024-10-11 04:16:30,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8736 to 6954. [2024-10-11 04:16:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6954 states, 6334 states have (on average 1.6596147773918535) internal successors, (10512), 6369 states have internal predecessors, (10512), 388 states have call successors, (388), 199 states have call predecessors, (388), 230 states have return successors, (661), 417 states have call predecessors, (661), 386 states have call successors, (661) [2024-10-11 04:16:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6954 states to 6954 states and 11561 transitions. [2024-10-11 04:16:30,897 INFO L78 Accepts]: Start accepts. Automaton has 6954 states and 11561 transitions. Word has length 82 [2024-10-11 04:16:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:30,897 INFO L471 AbstractCegarLoop]: Abstraction has 6954 states and 11561 transitions. [2024-10-11 04:16:30,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 6954 states and 11561 transitions. [2024-10-11 04:16:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:16:30,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:30,902 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, 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-10-11 04:16:30,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:16:30,903 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:30,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2080735478, now seen corresponding path program 1 times [2024-10-11 04:16:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:30,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259495095] [2024-10-11 04:16:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:30,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:30,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:16:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:16:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:31,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:16:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:31,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:16:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:31,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:16:31,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:31,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259495095] [2024-10-11 04:16:31,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259495095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:31,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:31,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:16:31,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809022040] [2024-10-11 04:16:31,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:31,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:16:31,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:31,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:16:31,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:16:31,034 INFO L87 Difference]: Start difference. First operand 6954 states and 11561 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:33,233 INFO L93 Difference]: Finished difference Result 19421 states and 31383 transitions. [2024-10-11 04:16:33,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:16:33,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 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 82 [2024-10-11 04:16:33,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:33,294 INFO L225 Difference]: With dead ends: 19421 [2024-10-11 04:16:33,294 INFO L226 Difference]: Without dead ends: 14598 [2024-10-11 04:16:33,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:16:33,316 INFO L432 NwaCegarLoop]: 4198 mSDtfsCounter, 4617 mSDsluCounter, 16599 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4633 SdHoareTripleChecker+Valid, 20797 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:33,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4633 Valid, 20797 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:16:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14598 states. [2024-10-11 04:16:33,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14598 to 11603. [2024-10-11 04:16:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11603 states, 10423 states have (on average 1.618919696824331) internal successors, (16874), 10490 states have internal predecessors, (16874), 724 states have call successors, (724), 391 states have call predecessors, (724), 454 states have return successors, (1515), 785 states have call predecessors, (1515), 722 states have call successors, (1515) [2024-10-11 04:16:33,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11603 states to 11603 states and 19113 transitions. [2024-10-11 04:16:33,948 INFO L78 Accepts]: Start accepts. Automaton has 11603 states and 19113 transitions. Word has length 82 [2024-10-11 04:16:33,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:33,948 INFO L471 AbstractCegarLoop]: Abstraction has 11603 states and 19113 transitions. [2024-10-11 04:16:33,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:33,949 INFO L276 IsEmpty]: Start isEmpty. Operand 11603 states and 19113 transitions. [2024-10-11 04:16:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:16:33,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:33,959 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, 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-10-11 04:16:33,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:16:33,960 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:33,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash -252657160, now seen corresponding path program 1 times [2024-10-11 04:16:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:33,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849028107] [2024-10-11 04:16:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:34,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:34,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:16:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:34,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:16:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:34,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:16:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:34,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:16:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:16:34,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:34,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849028107] [2024-10-11 04:16:34,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849028107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:34,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:34,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:16:34,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278884943] [2024-10-11 04:16:34,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:34,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:16:34,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:34,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:16:34,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:16:34,120 INFO L87 Difference]: Start difference. First operand 11603 states and 19113 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:38,253 INFO L93 Difference]: Finished difference Result 35280 states and 57361 transitions. [2024-10-11 04:16:38,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:16:38,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 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 82 [2024-10-11 04:16:38,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:38,338 INFO L225 Difference]: With dead ends: 35280 [2024-10-11 04:16:38,338 INFO L226 Difference]: Without dead ends: 25808 [2024-10-11 04:16:38,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:16:38,373 INFO L432 NwaCegarLoop]: 4188 mSDtfsCounter, 4566 mSDsluCounter, 16587 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4576 SdHoareTripleChecker+Valid, 20775 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:38,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4576 Valid, 20775 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:16:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25808 states. [2024-10-11 04:16:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25808 to 20888. [2024-10-11 04:16:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20888 states, 18628 states have (on average 1.5920120249087395) internal successors, (29656), 18759 states have internal predecessors, (29656), 1360 states have call successors, (1360), 771 states have call predecessors, (1360), 898 states have return successors, (3673), 1485 states have call predecessors, (3673), 1358 states have call successors, (3673) [2024-10-11 04:16:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20888 states to 20888 states and 34689 transitions. [2024-10-11 04:16:40,336 INFO L78 Accepts]: Start accepts. Automaton has 20888 states and 34689 transitions. Word has length 82 [2024-10-11 04:16:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:40,336 INFO L471 AbstractCegarLoop]: Abstraction has 20888 states and 34689 transitions. [2024-10-11 04:16:40,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20888 states and 34689 transitions. [2024-10-11 04:16:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:16:40,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:40,357 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, 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-10-11 04:16:40,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:16:40,357 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:40,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash -50833226, now seen corresponding path program 1 times [2024-10-11 04:16:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:40,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974128135] [2024-10-11 04:16:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:40,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:40,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:40,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:16:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:40,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:16:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:40,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:16:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:40,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:16:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:16:40,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:40,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974128135] [2024-10-11 04:16:40,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974128135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:40,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:40,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:16:40,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021226004] [2024-10-11 04:16:40,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:40,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:16:40,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:40,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:16:40,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:16:40,493 INFO L87 Difference]: Start difference. First operand 20888 states and 34689 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:44,608 INFO L93 Difference]: Finished difference Result 54910 states and 89680 transitions. [2024-10-11 04:16:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:16:44,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (6), 4 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 82 [2024-10-11 04:16:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:44,757 INFO L225 Difference]: With dead ends: 54910 [2024-10-11 04:16:44,757 INFO L226 Difference]: Without dead ends: 36154 [2024-10-11 04:16:44,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 04:16:44,817 INFO L432 NwaCegarLoop]: 4224 mSDtfsCounter, 4757 mSDsluCounter, 12336 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4786 SdHoareTripleChecker+Valid, 16560 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:44,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4786 Valid, 16560 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:16:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36154 states. [2024-10-11 04:16:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36154 to 30017. [2024-10-11 04:16:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30017 states, 26585 states have (on average 1.5682527741207448) internal successors, (41692), 26845 states have internal predecessors, (41692), 2078 states have call successors, (2078), 1161 states have call predecessors, (2078), 1352 states have return successors, (5121), 2138 states have call predecessors, (5121), 2076 states have call successors, (5121) [2024-10-11 04:16:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30017 states to 30017 states and 48891 transitions. [2024-10-11 04:16:46,814 INFO L78 Accepts]: Start accepts. Automaton has 30017 states and 48891 transitions. Word has length 82 [2024-10-11 04:16:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:46,814 INFO L471 AbstractCegarLoop]: Abstraction has 30017 states and 48891 transitions. [2024-10-11 04:16:46,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:16:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 30017 states and 48891 transitions. [2024-10-11 04:16:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 04:16:46,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:46,874 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, 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-10-11 04:16:46,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:16:46,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:46,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:46,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1489308341, now seen corresponding path program 1 times [2024-10-11 04:16:46,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:46,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084038531] [2024-10-11 04:16:46,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:46,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:46,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:46,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:16:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:46,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:16:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:47,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:16:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:16:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 04:16:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:47,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:16:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:16:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:16:47,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:47,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084038531] [2024-10-11 04:16:47,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084038531] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:16:47,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175323939] [2024-10-11 04:16:47,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:47,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:16:47,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:16:47,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:16:47,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:16:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:47,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:16:47,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:16:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 04:16:47,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:16:47,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175323939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:47,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:16:47,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:16:47,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917283488] [2024-10-11 04:16:47,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:47,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:16:47,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:47,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:16:47,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:16:47,282 INFO L87 Difference]: Start difference. First operand 30017 states and 48891 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:16:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:51,098 INFO L93 Difference]: Finished difference Result 85190 states and 138511 transitions. [2024-10-11 04:16:51,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:16:51,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 132 [2024-10-11 04:16:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:51,330 INFO L225 Difference]: With dead ends: 85190 [2024-10-11 04:16:51,330 INFO L226 Difference]: Without dead ends: 57305 [2024-10-11 04:16:51,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:16:51,415 INFO L432 NwaCegarLoop]: 4196 mSDtfsCounter, 4169 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4169 SdHoareTripleChecker+Valid, 4415 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:51,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4169 Valid, 4415 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:16:51,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57305 states. [2024-10-11 04:16:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57305 to 57107. [2024-10-11 04:16:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57107 states, 50357 states have (on average 1.5518597215878627) internal successors, (78147), 50874 states have internal predecessors, (78147), 4048 states have call successors, (4048), 2317 states have call predecessors, (4048), 2700 states have return successors, (10009), 4043 states have call predecessors, (10009), 4046 states have call successors, (10009) [2024-10-11 04:16:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57107 states to 57107 states and 92204 transitions. [2024-10-11 04:16:55,863 INFO L78 Accepts]: Start accepts. Automaton has 57107 states and 92204 transitions. Word has length 132 [2024-10-11 04:16:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:55,863 INFO L471 AbstractCegarLoop]: Abstraction has 57107 states and 92204 transitions. [2024-10-11 04:16:55,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:16:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 57107 states and 92204 transitions. [2024-10-11 04:16:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 04:16:56,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:56,154 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, 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-10-11 04:16:56,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 04:16:56,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 04:16:56,357 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:56,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:56,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1791656555, now seen corresponding path program 1 times [2024-10-11 04:16:56,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:56,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241897309] [2024-10-11 04:16:56,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:56,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:56,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:56,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 04:16:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:56,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 04:16:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:56,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 04:16:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:56,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 04:16:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:56,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 04:16:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:56,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:16:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:56,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:16:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:16:56,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:56,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241897309] [2024-10-11 04:16:56,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241897309] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:16:56,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803060547] [2024-10-11 04:16:56,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:56,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:16:56,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:16:56,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:16:56,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:16:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:56,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:16:56,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:16:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 04:16:56,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:16:56,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803060547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:56,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:16:56,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:16:56,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623157805] [2024-10-11 04:16:56,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:56,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:16:56,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:56,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:16:56,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:16:56,754 INFO L87 Difference]: Start difference. First operand 57107 states and 92204 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:17:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:04,514 INFO L93 Difference]: Finished difference Result 165852 states and 268250 transitions. [2024-10-11 04:17:04,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:17:04,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 132 [2024-10-11 04:17:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:05,089 INFO L225 Difference]: With dead ends: 165852 [2024-10-11 04:17:05,089 INFO L226 Difference]: Without dead ends: 110877 [2024-10-11 04:17:05,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:05,242 INFO L432 NwaCegarLoop]: 4196 mSDtfsCounter, 4174 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4174 SdHoareTripleChecker+Valid, 4415 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:05,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4174 Valid, 4415 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:17:05,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110877 states.