./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_label49+token_ring.09.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16b6a38408403620534e0fd3420fc5cec7a59a0b00c704b760a1c7da59bda35b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 23:32:48,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 23:32:48,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 23:32:48,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 23:32:48,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 23:32:48,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 23:32:48,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 23:32:48,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 23:32:48,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 23:32:48,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 23:32:48,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 23:32:48,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 23:32:48,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 23:32:48,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 23:32:48,738 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 23:32:48,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 23:32:48,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 23:32:48,742 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 23:32:48,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 23:32:48,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 23:32:48,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 23:32:48,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 23:32:48,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 23:32:48,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 23:32:48,748 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 23:32:48,748 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 23:32:48,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 23:32:48,749 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 23:32:48,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 23:32:48,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 23:32:48,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 23:32:48,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 23:32:48,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:32:48,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 23:32:48,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 23:32:48,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 23:32:48,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 23:32:48,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 23:32:48,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 23:32:48,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 23:32:48,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 23:32:48,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 23:32:48,754 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16b6a38408403620534e0fd3420fc5cec7a59a0b00c704b760a1c7da59bda35b [2024-11-19 23:32:48,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 23:32:49,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 23:32:49,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 23:32:49,018 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 23:32:49,019 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 23:32:49,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-2.c [2024-11-19 23:32:50,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 23:32:51,104 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 23:32:51,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-2.c [2024-11-19 23:32:51,158 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed61fd5cd/45819814123241b286734f54aec903bf/FLAG659a5f233 [2024-11-19 23:32:51,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed61fd5cd/45819814123241b286734f54aec903bf [2024-11-19 23:32:51,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 23:32:51,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 23:32:51,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 23:32:51,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 23:32:51,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 23:32:51,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:32:51" (1/1) ... [2024-11-19 23:32:51,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15024df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:51, skipping insertion in model container [2024-11-19 23:32:51,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:32:51" (1/1) ... [2024-11-19 23:32:51,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 23:32:53,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-2.c[380593,380606] [2024-11-19 23:32:53,355 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-2.c[383339,383352] [2024-11-19 23:32:53,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:32:53,602 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 23:32:54,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-2.c[380593,380606] [2024-11-19 23:32:54,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-2.c[383339,383352] [2024-11-19 23:32:54,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:32:54,451 INFO L204 MainTranslator]: Completed translation [2024-11-19 23:32:54,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54 WrapperNode [2024-11-19 23:32:54,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 23:32:54,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 23:32:54,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 23:32:54,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 23:32:54,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54" (1/1) ... [2024-11-19 23:32:54,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54" (1/1) ... [2024-11-19 23:32:54,902 INFO L138 Inliner]: procedures = 62, calls = 69, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 13059 [2024-11-19 23:32:54,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 23:32:54,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 23:32:54,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 23:32:54,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 23:32:54,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54" (1/1) ... [2024-11-19 23:32:54,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54" (1/1) ... [2024-11-19 23:32:54,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54" (1/1) ... [2024-11-19 23:32:55,075 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 23:32:55,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54" (1/1) ... [2024-11-19 23:32:55,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54" (1/1) ... [2024-11-19 23:32:55,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54" (1/1) ... [2024-11-19 23:32:55,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54" (1/1) ... [2024-11-19 23:32:55,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54" (1/1) ... [2024-11-19 23:32:55,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54" (1/1) ... [2024-11-19 23:32:55,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 23:32:55,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 23:32:55,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 23:32:55,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 23:32:55,555 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54" (1/1) ... [2024-11-19 23:32:55,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:32:55,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 23:32:55,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 23:32:55,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 23:32:55,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 23:32:55,636 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-19 23:32:55,636 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-19 23:32:55,636 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-19 23:32:55,636 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-19 23:32:55,636 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-19 23:32:55,636 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-19 23:32:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-19 23:32:55,637 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-19 23:32:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-19 23:32:55,637 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-19 23:32:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-19 23:32:55,637 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-19 23:32:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-19 23:32:55,637 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-19 23:32:55,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 23:32:55,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 23:32:55,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 23:32:55,764 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 23:32:55,767 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 23:33:03,385 INFO L? ?]: Removed 1741 outVars from TransFormulas that were not future-live. [2024-11-19 23:33:03,385 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 23:33:03,463 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 23:33:03,464 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-19 23:33:03,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:33:03 BoogieIcfgContainer [2024-11-19 23:33:03,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 23:33:03,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 23:33:03,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 23:33:03,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 23:33:03,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:32:51" (1/3) ... [2024-11-19 23:33:03,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799423ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:33:03, skipping insertion in model container [2024-11-19 23:33:03,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:32:54" (2/3) ... [2024-11-19 23:33:03,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799423ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:33:03, skipping insertion in model container [2024-11-19 23:33:03,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:33:03" (3/3) ... [2024-11-19 23:33:03,474 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.09.cil-2.c [2024-11-19 23:33:03,490 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 23:33:03,490 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 23:33:03,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 23:33:03,611 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;@3cdb71d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 23:33:03,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 23:33:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 2508 states, 2473 states have (on average 1.8439142741609382) internal successors, (4560), 2478 states have internal predecessors, (4560), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 23:33:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 23:33:03,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:33:03,647 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:33:03,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:33:03,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:33:03,653 INFO L85 PathProgramCache]: Analyzing trace with hash 273379068, now seen corresponding path program 1 times [2024-11-19 23:33:03,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:33:03,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321714793] [2024-11-19 23:33:03,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:33:03,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:33:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:04,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:33:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:04,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:33:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:04,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:33:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:04,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:33:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:33:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:33:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:33:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321714793] [2024-11-19 23:33:04,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321714793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:33:04,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:33:04,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 23:33:04,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188091415] [2024-11-19 23:33:04,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:33:04,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 23:33:04,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:33:04,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 23:33:04,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 23:33:04,313 INFO L87 Difference]: Start difference. First operand has 2508 states, 2473 states have (on average 1.8439142741609382) internal successors, (4560), 2478 states have internal predecessors, (4560), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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-11-19 23:33:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:33:05,904 INFO L93 Difference]: Finished difference Result 5116 states and 9393 transitions. [2024-11-19 23:33:05,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 23:33:05,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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 146 [2024-11-19 23:33:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:33:05,938 INFO L225 Difference]: With dead ends: 5116 [2024-11-19 23:33:05,938 INFO L226 Difference]: Without dead ends: 2549 [2024-11-19 23:33:05,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 23:33:05,952 INFO L432 NwaCegarLoop]: 4325 mSDtfsCounter, 835 mSDsluCounter, 12425 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 23:33:05,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 16750 Invalid, 860 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 23:33:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2024-11-19 23:33:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2440. [2024-11-19 23:33:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2407 states have (on average 1.8292480265891151) internal successors, (4403), 2410 states have internal predecessors, (4403), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 23:33:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 4451 transitions. [2024-11-19 23:33:06,194 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 4451 transitions. Word has length 146 [2024-11-19 23:33:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:33:06,195 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 4451 transitions. [2024-11-19 23:33:06,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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-11-19 23:33:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 4451 transitions. [2024-11-19 23:33:06,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 23:33:06,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:33:06,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:33:06,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 23:33:06,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:33:06,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:33:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1125574534, now seen corresponding path program 1 times [2024-11-19 23:33:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:33:06,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372519620] [2024-11-19 23:33:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:33:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:33:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:06,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:33:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:06,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:33:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:06,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:33:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:06,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:33:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:06,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:33:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:33:06,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:33:06,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372519620] [2024-11-19 23:33:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372519620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:33:06,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:33:06,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 23:33:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90042041] [2024-11-19 23:33:06,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:33:06,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 23:33:06,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:33:06,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 23:33:06,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 23:33:06,560 INFO L87 Difference]: Start difference. First operand 2440 states and 4451 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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-11-19 23:33:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:33:09,033 INFO L93 Difference]: Finished difference Result 3274 states and 5782 transitions. [2024-11-19 23:33:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 23:33:09,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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 146 [2024-11-19 23:33:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:33:09,051 INFO L225 Difference]: With dead ends: 3274 [2024-11-19 23:33:09,052 INFO L226 Difference]: Without dead ends: 2972 [2024-11-19 23:33:09,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-19 23:33:09,057 INFO L432 NwaCegarLoop]: 4271 mSDtfsCounter, 5199 mSDsluCounter, 12786 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 17057 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 23:33:09,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5215 Valid, 17057 Invalid, 1908 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [104 Valid, 1804 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 23:33:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2024-11-19 23:33:09,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2753. [2024-11-19 23:33:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2695 states have (on average 1.8018552875695732) internal successors, (4856), 2699 states have internal predecessors, (4856), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-11-19 23:33:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 4943 transitions. [2024-11-19 23:33:09,184 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 4943 transitions. Word has length 146 [2024-11-19 23:33:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:33:09,185 INFO L471 AbstractCegarLoop]: Abstraction has 2753 states and 4943 transitions. [2024-11-19 23:33:09,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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-11-19 23:33:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 4943 transitions. [2024-11-19 23:33:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 23:33:09,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:33:09,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:33:09,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 23:33:09,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:33:09,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:33:09,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1367927158, now seen corresponding path program 1 times [2024-11-19 23:33:09,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:33:09,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505570055] [2024-11-19 23:33:09,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:33:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:33:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:09,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:33:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:09,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:33:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:09,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:33:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:09,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:33:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:09,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:33:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:33:09,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:33:09,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505570055] [2024-11-19 23:33:09,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505570055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:33:09,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:33:09,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:33:09,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607126419] [2024-11-19 23:33:09,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:33:09,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:33:09,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:33:09,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:33:09,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:33:09,517 INFO L87 Difference]: Start difference. First operand 2753 states and 4943 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:12,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:33:12,570 INFO L93 Difference]: Finished difference Result 4022 states and 6969 transitions. [2024-11-19 23:33:12,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:33:12,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-19 23:33:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:33:12,585 INFO L225 Difference]: With dead ends: 4022 [2024-11-19 23:33:12,585 INFO L226 Difference]: Without dead ends: 3407 [2024-11-19 23:33:12,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:33:12,591 INFO L432 NwaCegarLoop]: 4443 mSDtfsCounter, 5228 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2809 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5244 SdHoareTripleChecker+Valid, 21936 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 23:33:12,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5244 Valid, 21936 Invalid, 2868 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 2809 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 23:33:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2024-11-19 23:33:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3045. [2024-11-19 23:33:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3045 states, 2962 states have (on average 1.7781904118838623) internal successors, (5267), 2967 states have internal predecessors, (5267), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-11-19 23:33:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 5392 transitions. [2024-11-19 23:33:12,697 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 5392 transitions. Word has length 146 [2024-11-19 23:33:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:33:12,697 INFO L471 AbstractCegarLoop]: Abstraction has 3045 states and 5392 transitions. [2024-11-19 23:33:12,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 5392 transitions. [2024-11-19 23:33:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 23:33:12,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:33:12,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:33:12,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 23:33:12,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:33:12,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:33:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash 661330552, now seen corresponding path program 1 times [2024-11-19 23:33:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:33:12,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141655359] [2024-11-19 23:33:12,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:33:12,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:33:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:33:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:33:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:33:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:33:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:12,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:33:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:33:12,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:33:12,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141655359] [2024-11-19 23:33:12,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141655359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:33:12,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:33:12,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:33:12,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913228125] [2024-11-19 23:33:12,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:33:12,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:33:12,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:33:12,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:33:12,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:33:12,959 INFO L87 Difference]: Start difference. First operand 3045 states and 5392 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:15,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:33:15,769 INFO L93 Difference]: Finished difference Result 5124 states and 8706 transitions. [2024-11-19 23:33:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:33:15,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-19 23:33:15,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:33:15,799 INFO L225 Difference]: With dead ends: 5124 [2024-11-19 23:33:15,799 INFO L226 Difference]: Without dead ends: 4217 [2024-11-19 23:33:15,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:33:15,807 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5222 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2788 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5238 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 23:33:15,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5238 Valid, 21934 Invalid, 2849 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 2788 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 23:33:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2024-11-19 23:33:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 3633. [2024-11-19 23:33:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3633 states, 3500 states have (on average 1.7417142857142858) internal successors, (6096), 3507 states have internal predecessors, (6096), 97 states have call successors, (97), 31 states have call predecessors, (97), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-11-19 23:33:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 6301 transitions. [2024-11-19 23:33:15,987 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 6301 transitions. Word has length 146 [2024-11-19 23:33:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:33:15,988 INFO L471 AbstractCegarLoop]: Abstraction has 3633 states and 6301 transitions. [2024-11-19 23:33:15,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 6301 transitions. [2024-11-19 23:33:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 23:33:15,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:33:15,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:33:15,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 23:33:15,992 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:33:15,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:33:15,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1523164154, now seen corresponding path program 1 times [2024-11-19 23:33:15,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:33:15,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732556236] [2024-11-19 23:33:15,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:33:15,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:33:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:33:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:16,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:33:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:16,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:33:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:16,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:33:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:16,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:33:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:33:16,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:33:16,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732556236] [2024-11-19 23:33:16,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732556236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:33:16,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:33:16,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:33:16,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582489492] [2024-11-19 23:33:16,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:33:16,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:33:16,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:33:16,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:33:16,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:33:16,296 INFO L87 Difference]: Start difference. First operand 3633 states and 6301 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:33:19,117 INFO L93 Difference]: Finished difference Result 7254 states and 12043 transitions. [2024-11-19 23:33:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:33:19,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-19 23:33:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:33:19,145 INFO L225 Difference]: With dead ends: 7254 [2024-11-19 23:33:19,146 INFO L226 Difference]: Without dead ends: 5759 [2024-11-19 23:33:19,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:33:19,153 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5221 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2775 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5237 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 23:33:19,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5237 Valid, 21934 Invalid, 2836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2775 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 23:33:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2024-11-19 23:33:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 4810. [2024-11-19 23:33:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4577 states have (on average 1.694122787852305) internal successors, (7754), 4588 states have internal predecessors, (7754), 169 states have call successors, (169), 55 states have call predecessors, (169), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-11-19 23:33:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 8125 transitions. [2024-11-19 23:33:19,354 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 8125 transitions. Word has length 146 [2024-11-19 23:33:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:33:19,355 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 8125 transitions. [2024-11-19 23:33:19,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 8125 transitions. [2024-11-19 23:33:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 23:33:19,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:33:19,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:33:19,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 23:33:19,359 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:33:19,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:33:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash -527244744, now seen corresponding path program 1 times [2024-11-19 23:33:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:33:19,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418344162] [2024-11-19 23:33:19,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:33:19,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:33:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:19,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:33:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:19,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:33:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:19,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:33:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:19,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:33:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:19,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:33:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:33:19,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:33:19,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418344162] [2024-11-19 23:33:19,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418344162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:33:19,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:33:19,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:33:19,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978761397] [2024-11-19 23:33:19,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:33:19,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:33:19,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:33:19,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:33:19,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:33:19,593 INFO L87 Difference]: Start difference. First operand 4810 states and 8125 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:33:22,648 INFO L93 Difference]: Finished difference Result 11513 states and 18733 transitions. [2024-11-19 23:33:22,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:33:22,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-19 23:33:22,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:33:22,701 INFO L225 Difference]: With dead ends: 11513 [2024-11-19 23:33:22,701 INFO L226 Difference]: Without dead ends: 8841 [2024-11-19 23:33:22,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:33:22,712 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5220 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2762 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5236 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 23:33:22,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5236 Valid, 21934 Invalid, 2823 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 2762 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 23:33:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8841 states. [2024-11-19 23:33:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8841 to 7171. [2024-11-19 23:33:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7171 states, 6738 states have (on average 1.6444048679133274) internal successors, (11080), 6757 states have internal predecessors, (11080), 313 states have call successors, (313), 103 states have call predecessors, (313), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-11-19 23:33:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7171 states to 7171 states and 11801 transitions. [2024-11-19 23:33:23,030 INFO L78 Accepts]: Start accepts. Automaton has 7171 states and 11801 transitions. Word has length 146 [2024-11-19 23:33:23,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:33:23,031 INFO L471 AbstractCegarLoop]: Abstraction has 7171 states and 11801 transitions. [2024-11-19 23:33:23,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 7171 states and 11801 transitions. [2024-11-19 23:33:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 23:33:23,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:33:23,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:33:23,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 23:33:23,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:33:23,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:33:23,036 INFO L85 PathProgramCache]: Analyzing trace with hash -39197638, now seen corresponding path program 1 times [2024-11-19 23:33:23,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:33:23,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555824817] [2024-11-19 23:33:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:33:23,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:33:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:23,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:33:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:23,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:33:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:23,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:33:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:23,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:33:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:23,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:33:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:33:23,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:33:23,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555824817] [2024-11-19 23:33:23,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555824817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:33:23,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:33:23,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:33:23,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375558171] [2024-11-19 23:33:23,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:33:23,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:33:23,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:33:23,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:33:23,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:33:23,267 INFO L87 Difference]: Start difference. First operand 7171 states and 11801 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:33:26,050 INFO L93 Difference]: Finished difference Result 20032 states and 32175 transitions. [2024-11-19 23:33:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:33:26,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-19 23:33:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:33:26,108 INFO L225 Difference]: With dead ends: 20032 [2024-11-19 23:33:26,108 INFO L226 Difference]: Without dead ends: 14999 [2024-11-19 23:33:26,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:33:26,135 INFO L432 NwaCegarLoop]: 4242 mSDtfsCounter, 5301 mSDsluCounter, 16917 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5317 SdHoareTripleChecker+Valid, 21159 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 23:33:26,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5317 Valid, 21159 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 23:33:26,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14999 states. [2024-11-19 23:33:26,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14999 to 11908. [2024-11-19 23:33:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11908 states, 11075 states have (on average 1.6030699774266366) internal successors, (17754), 11110 states have internal predecessors, (17754), 601 states have call successors, (601), 199 states have call predecessors, (601), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-19 23:33:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11908 states to 11908 states and 19229 transitions. [2024-11-19 23:33:26,695 INFO L78 Accepts]: Start accepts. Automaton has 11908 states and 19229 transitions. Word has length 146 [2024-11-19 23:33:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:33:26,696 INFO L471 AbstractCegarLoop]: Abstraction has 11908 states and 19229 transitions. [2024-11-19 23:33:26,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 11908 states and 19229 transitions. [2024-11-19 23:33:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 23:33:26,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:33:26,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:33:26,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 23:33:26,706 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:33:26,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:33:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1131832840, now seen corresponding path program 1 times [2024-11-19 23:33:26,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:33:26,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283764983] [2024-11-19 23:33:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:33:26,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:33:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:26,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:33:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:26,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:33:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:26,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:33:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:26,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:33:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:26,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:33:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:33:26,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:33:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283764983] [2024-11-19 23:33:26,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283764983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:33:26,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:33:26,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:33:26,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265064442] [2024-11-19 23:33:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:33:26,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:33:26,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:33:26,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:33:26,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:33:26,938 INFO L87 Difference]: Start difference. First operand 11908 states and 19229 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:28,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:33:28,942 INFO L93 Difference]: Finished difference Result 24936 states and 40142 transitions. [2024-11-19 23:33:28,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 23:33:28,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-19 23:33:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:33:28,996 INFO L225 Difference]: With dead ends: 24936 [2024-11-19 23:33:28,996 INFO L226 Difference]: Without dead ends: 15166 [2024-11-19 23:33:29,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-19 23:33:29,036 INFO L432 NwaCegarLoop]: 4217 mSDtfsCounter, 4877 mSDsluCounter, 16647 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4894 SdHoareTripleChecker+Valid, 20864 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 23:33:29,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4894 Valid, 20864 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 23:33:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15166 states. [2024-11-19 23:33:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15166 to 11908. [2024-11-19 23:33:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11908 states, 11075 states have (on average 1.6000902934537247) internal successors, (17721), 11110 states have internal predecessors, (17721), 601 states have call successors, (601), 199 states have call predecessors, (601), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-19 23:33:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11908 states to 11908 states and 19196 transitions. [2024-11-19 23:33:29,622 INFO L78 Accepts]: Start accepts. Automaton has 11908 states and 19196 transitions. Word has length 146 [2024-11-19 23:33:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:33:29,624 INFO L471 AbstractCegarLoop]: Abstraction has 11908 states and 19196 transitions. [2024-11-19 23:33:29,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 11908 states and 19196 transitions. [2024-11-19 23:33:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 23:33:29,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:33:29,634 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:33:29,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 23:33:29,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:33:29,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:33:29,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1880962170, now seen corresponding path program 1 times [2024-11-19 23:33:29,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:33:29,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034074983] [2024-11-19 23:33:29,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:33:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:33:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:29,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:33:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:29,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:33:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:29,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:33:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:29,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:33:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:30,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:33:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:33:30,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:33:30,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034074983] [2024-11-19 23:33:30,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034074983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:33:30,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:33:30,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:33:30,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961076444] [2024-11-19 23:33:30,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:33:30,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:33:30,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:33:30,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:33:30,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:33:30,011 INFO L87 Difference]: Start difference. First operand 11908 states and 19196 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:33:33,166 INFO L93 Difference]: Finished difference Result 37037 states and 59021 transitions. [2024-11-19 23:33:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:33:33,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-19 23:33:33,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:33:33,281 INFO L225 Difference]: With dead ends: 37037 [2024-11-19 23:33:33,281 INFO L226 Difference]: Without dead ends: 27267 [2024-11-19 23:33:33,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:33:33,329 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5211 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5227 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 23:33:33,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5227 Valid, 21934 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 23:33:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27267 states. [2024-11-19 23:33:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27267 to 21446. [2024-11-19 23:33:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21446 states, 19813 states have (on average 1.5705344975521123) internal successors, (31117), 19880 states have internal predecessors, (31117), 1177 states have call successors, (1177), 391 states have call predecessors, (1177), 454 states have return successors, (1968), 1238 states have call predecessors, (1968), 1175 states have call successors, (1968) [2024-11-19 23:33:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21446 states to 21446 states and 34262 transitions. [2024-11-19 23:33:34,500 INFO L78 Accepts]: Start accepts. Automaton has 21446 states and 34262 transitions. Word has length 146 [2024-11-19 23:33:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:33:34,500 INFO L471 AbstractCegarLoop]: Abstraction has 21446 states and 34262 transitions. [2024-11-19 23:33:34,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:34,501 INFO L276 IsEmpty]: Start isEmpty. Operand 21446 states and 34262 transitions. [2024-11-19 23:33:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 23:33:34,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:33:34,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:33:34,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 23:33:34,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:33:34,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:33:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash 38486456, now seen corresponding path program 1 times [2024-11-19 23:33:34,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:33:34,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212724244] [2024-11-19 23:33:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:33:34,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:33:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:34,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:33:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:34,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:33:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:34,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:33:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:34,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:33:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:34,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:33:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:33:34,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:33:34,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212724244] [2024-11-19 23:33:34,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212724244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:33:34,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:33:34,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:33:34,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247337505] [2024-11-19 23:33:34,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:33:34,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:33:34,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:33:34,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:33:34,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:33:34,735 INFO L87 Difference]: Start difference. First operand 21446 states and 34262 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:39,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:33:39,395 INFO L93 Difference]: Finished difference Result 71117 states and 113589 transitions. [2024-11-19 23:33:39,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:33:39,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-19 23:33:39,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:33:39,589 INFO L225 Difference]: With dead ends: 71117 [2024-11-19 23:33:39,590 INFO L226 Difference]: Without dead ends: 51809 [2024-11-19 23:33:39,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:33:39,645 INFO L432 NwaCegarLoop]: 4441 mSDtfsCounter, 5216 mSDsluCounter, 17493 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5232 SdHoareTripleChecker+Valid, 21934 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 23:33:39,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5232 Valid, 21934 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 23:33:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2024-11-19 23:33:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 40583. [2024-11-19 23:33:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40583 states, 37350 states have (on average 1.55285140562249) internal successors, (57999), 37481 states have internal predecessors, (57999), 2329 states have call successors, (2329), 775 states have call predecessors, (2329), 902 states have return successors, (4642), 2454 states have call predecessors, (4642), 2327 states have call successors, (4642) [2024-11-19 23:33:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40583 states to 40583 states and 64970 transitions. [2024-11-19 23:33:41,707 INFO L78 Accepts]: Start accepts. Automaton has 40583 states and 64970 transitions. Word has length 146 [2024-11-19 23:33:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:33:41,708 INFO L471 AbstractCegarLoop]: Abstraction has 40583 states and 64970 transitions. [2024-11-19 23:33:41,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 40583 states and 64970 transitions. [2024-11-19 23:33:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 23:33:41,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:33:41,735 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:33:41,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 23:33:41,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:33:41,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:33:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1683516230, now seen corresponding path program 1 times [2024-11-19 23:33:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:33:41,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915312016] [2024-11-19 23:33:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:33:41,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:33:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:41,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:33:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:41,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:33:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:41,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:33:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:41,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:33:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:41,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:33:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:33:41,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:33:41,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915312016] [2024-11-19 23:33:41,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915312016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:33:41,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:33:41,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:33:41,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391143933] [2024-11-19 23:33:41,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:33:41,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:33:41,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:33:41,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:33:41,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:33:41,946 INFO L87 Difference]: Start difference. First operand 40583 states and 64970 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:33:49,450 INFO L93 Difference]: Finished difference Result 154890 states and 248505 transitions. [2024-11-19 23:33:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 23:33:49,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 146 [2024-11-19 23:33:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:33:50,111 INFO L225 Difference]: With dead ends: 154890 [2024-11-19 23:33:50,111 INFO L226 Difference]: Without dead ends: 116445 [2024-11-19 23:33:50,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-19 23:33:50,196 INFO L432 NwaCegarLoop]: 4438 mSDtfsCounter, 5293 mSDsluCounter, 17482 mSDsCounter, 0 mSdLazyCounter, 3212 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5308 SdHoareTripleChecker+Valid, 21920 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 23:33:50,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5308 Valid, 21920 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3212 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 23:33:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116445 states. [2024-11-19 23:33:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116445 to 77449. [2024-11-19 23:33:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77449 states, 71144 states have (on average 1.541254357359721) internal successors, (109651), 71403 states have internal predecessors, (109651), 4505 states have call successors, (4505), 1543 states have call predecessors, (4505), 1798 states have return successors, (11320), 4758 states have call predecessors, (11320), 4503 states have call successors, (11320) [2024-11-19 23:33:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77449 states to 77449 states and 125476 transitions. [2024-11-19 23:33:55,230 INFO L78 Accepts]: Start accepts. Automaton has 77449 states and 125476 transitions. Word has length 146 [2024-11-19 23:33:55,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:33:55,231 INFO L471 AbstractCegarLoop]: Abstraction has 77449 states and 125476 transitions. [2024-11-19 23:33:55,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-11-19 23:33:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 77449 states and 125476 transitions. [2024-11-19 23:33:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-19 23:33:55,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:33:55,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:33:55,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 23:33:55,282 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:33:55,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:33:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash 245415996, now seen corresponding path program 1 times [2024-11-19 23:33:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:33:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410340736] [2024-11-19 23:33:55,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:33:55,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:33:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:55,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 23:33:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:55,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 23:33:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:55,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 23:33:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:55,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 23:33:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:55,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-19 23:33:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:33:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:33:55,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:33:55,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410340736] [2024-11-19 23:33:55,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410340736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:33:55,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:33:55,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 23:33:55,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189575703] [2024-11-19 23:33:55,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:33:55,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 23:33:55,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:33:55,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 23:33:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 23:33:55,505 INFO L87 Difference]: Start difference. First operand 77449 states and 125476 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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)