./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_label48+token_ring.13.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.13.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 29d311a340ddf06876d5e964efa5bbd1c7e50f9bc9213c2393be8e474d394757 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:34:48,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:34:48,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:34:48,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:34:48,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:34:48,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:34:48,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:34:48,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:34:48,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:34:48,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:34:48,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:34:48,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:34:48,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:34:48,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:34:48,608 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:34:48,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:34:48,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:34:48,609 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:34:48,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:34:48,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:34:48,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:34:48,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:34:48,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:34:48,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:34:48,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:34:48,612 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:34:48,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:34:48,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:34:48,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:34:48,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:34:48,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:34:48,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:34:48,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:34:48,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:34:48,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:34:48,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:34:48,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:34:48,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:34:48,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:34:48,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:34:48,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:34:48,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:34:48,629 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 -> 29d311a340ddf06876d5e964efa5bbd1c7e50f9bc9213c2393be8e474d394757 [2024-10-14 04:34:48,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:34:48,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:34:48,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:34:48,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:34:48,865 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:34:48,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.13.cil-2.c [2024-10-14 04:34:50,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:34:50,606 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:34:50,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.13.cil-2.c [2024-10-14 04:34:50,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c10354db8/44677209773f40259278b86e65543b76/FLAGec8399bf6 [2024-10-14 04:34:50,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c10354db8/44677209773f40259278b86e65543b76 [2024-10-14 04:34:50,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:34:50,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:34:50,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:34:50,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:34:50,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:34:50,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:34:50" (1/1) ... [2024-10-14 04:34:50,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745aff38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:50, skipping insertion in model container [2024-10-14 04:34:50,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:34:50" (1/1) ... [2024-10-14 04:34:50,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:34:52,016 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.13.cil-2.c[375709,375722] [2024-10-14 04:34:52,053 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.13.cil-2.c[383339,383352] [2024-10-14 04:34:52,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:34:52,306 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:34:52,874 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.13.cil-2.c[375709,375722] [2024-10-14 04:34:52,882 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.13.cil-2.c[383339,383352] [2024-10-14 04:34:52,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:34:52,956 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:34:52,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52 WrapperNode [2024-10-14 04:34:52,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:34:52,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:34:52,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:34:52,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:34:52,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52" (1/1) ... [2024-10-14 04:34:53,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52" (1/1) ... [2024-10-14 04:34:53,380 INFO L138 Inliner]: procedures = 70, calls = 80, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 13293 [2024-10-14 04:34:53,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:34:53,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:34:53,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:34:53,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:34:53,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52" (1/1) ... [2024-10-14 04:34:53,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52" (1/1) ... [2024-10-14 04:34:53,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52" (1/1) ... [2024-10-14 04:34:53,529 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 04:34:53,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52" (1/1) ... [2024-10-14 04:34:53,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52" (1/1) ... [2024-10-14 04:34:53,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52" (1/1) ... [2024-10-14 04:34:53,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52" (1/1) ... [2024-10-14 04:34:53,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52" (1/1) ... [2024-10-14 04:34:53,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52" (1/1) ... [2024-10-14 04:34:53,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:34:53,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:34:53,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:34:53,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:34:53,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52" (1/1) ... [2024-10-14 04:34:53,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:34:53,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:34:53,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 04:34:53,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 04:34:53,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:34:53,976 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 04:34:53,976 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 04:34:53,976 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 04:34:53,976 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 04:34:53,976 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 04:34:53,976 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 04:34:53,976 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 04:34:53,976 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 04:34:53,976 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 04:34:53,977 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 04:34:53,977 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 04:34:53,977 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 04:34:53,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:34:53,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:34:53,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:34:54,092 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:34:54,094 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:35:00,365 INFO L? ?]: Removed 1761 outVars from TransFormulas that were not future-live. [2024-10-14 04:35:00,365 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:35:00,473 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:35:00,474 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-14 04:35:00,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:35:00 BoogieIcfgContainer [2024-10-14 04:35:00,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:35:00,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:35:00,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:35:00,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:35:00,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:34:50" (1/3) ... [2024-10-14 04:35:00,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d06c5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:35:00, skipping insertion in model container [2024-10-14 04:35:00,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:34:52" (2/3) ... [2024-10-14 04:35:00,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d06c5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:35:00, skipping insertion in model container [2024-10-14 04:35:00,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:35:00" (3/3) ... [2024-10-14 04:35:00,482 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label48+token_ring.13.cil-2.c [2024-10-14 04:35:00,495 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:35:00,496 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:35:00,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:35:00,599 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;@7b6a64c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:35:00,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:35:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 2494 states, 2458 states have (on average 1.8746948738812041) internal successors, (4608), 2461 states have internal predecessors, (4608), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 04:35:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:00,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:00,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:00,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:00,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:00,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1072822453, now seen corresponding path program 1 times [2024-10-14 04:35:00,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:00,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281054669] [2024-10-14 04:35:00,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:00,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:00,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:01,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:01,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:01,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:01,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:01,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:01,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281054669] [2024-10-14 04:35:01,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281054669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:01,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:01,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:35:01,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053034701] [2024-10-14 04:35:01,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:01,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:35:01,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:01,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:35:01,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:35:01,250 INFO L87 Difference]: Start difference. First operand has 2494 states, 2458 states have (on average 1.8746948738812041) internal successors, (4608), 2461 states have internal predecessors, (4608), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:03,295 INFO L93 Difference]: Finished difference Result 5122 states and 9562 transitions. [2024-10-14 04:35:03,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:35:03,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:03,325 INFO L225 Difference]: With dead ends: 5122 [2024-10-14 04:35:03,327 INFO L226 Difference]: Without dead ends: 2630 [2024-10-14 04:35:03,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:35:03,337 INFO L432 NwaCegarLoop]: 4276 mSDtfsCounter, 1048 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 16502 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:03,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 16502 Invalid, 1206 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 04:35:03,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-10-14 04:35:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2490. [2024-10-14 04:35:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2455 states have (on average 1.8354378818737271) internal successors, (4506), 2457 states have internal predecessors, (4506), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 04:35:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4560 transitions. [2024-10-14 04:35:03,470 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4560 transitions. Word has length 171 [2024-10-14 04:35:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:03,470 INFO L471 AbstractCegarLoop]: Abstraction has 2490 states and 4560 transitions. [2024-10-14 04:35:03,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4560 transitions. [2024-10-14 04:35:03,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:03,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:03,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:03,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:35:03,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:03,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:03,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1643094259, now seen corresponding path program 1 times [2024-10-14 04:35:03,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:03,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101388772] [2024-10-14 04:35:03,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:03,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:03,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:03,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:03,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:03,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:03,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:03,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:03,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101388772] [2024-10-14 04:35:03,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101388772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:03,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:03,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:35:03,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720228808] [2024-10-14 04:35:03,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:03,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:35:03,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:03,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:35:03,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:35:03,688 INFO L87 Difference]: Start difference. First operand 2490 states and 4560 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:05,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:05,372 INFO L93 Difference]: Finished difference Result 2984 states and 5386 transitions. [2024-10-14 04:35:05,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:35:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:05,389 INFO L225 Difference]: With dead ends: 2984 [2024-10-14 04:35:05,390 INFO L226 Difference]: Without dead ends: 2630 [2024-10-14 04:35:05,392 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-10-14 04:35:05,394 INFO L432 NwaCegarLoop]: 4272 mSDtfsCounter, 1036 mSDsluCounter, 12217 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 16489 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:05,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 16489 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 04:35:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-10-14 04:35:05,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2490. [2024-10-14 04:35:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2455 states have (on average 1.835030549898167) internal successors, (4505), 2457 states have internal predecessors, (4505), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 04:35:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4559 transitions. [2024-10-14 04:35:05,454 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4559 transitions. Word has length 171 [2024-10-14 04:35:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:05,455 INFO L471 AbstractCegarLoop]: Abstraction has 2490 states and 4559 transitions. [2024-10-14 04:35:05,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4559 transitions. [2024-10-14 04:35:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:05,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:05,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:05,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:35:05,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:05,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1031825201, now seen corresponding path program 1 times [2024-10-14 04:35:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:05,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120913343] [2024-10-14 04:35:05,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:05,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:05,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:05,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:05,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:05,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:05,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:05,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:05,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120913343] [2024-10-14 04:35:05,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120913343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:05,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:05,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:35:05,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751454489] [2024-10-14 04:35:05,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:05,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:35:05,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:05,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:35:05,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:35:05,840 INFO L87 Difference]: Start difference. First operand 2490 states and 4559 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:09,003 INFO L93 Difference]: Finished difference Result 3491 states and 6239 transitions. [2024-10-14 04:35:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:35:09,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:09,017 INFO L225 Difference]: With dead ends: 3491 [2024-10-14 04:35:09,017 INFO L226 Difference]: Without dead ends: 3141 [2024-10-14 04:35:09,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:35:09,022 INFO L432 NwaCegarLoop]: 4238 mSDtfsCounter, 5542 mSDsluCounter, 12708 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5562 SdHoareTripleChecker+Valid, 16946 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:09,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5562 Valid, 16946 Invalid, 2578 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 04:35:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-10-14 04:35:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2862. [2024-10-14 04:35:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 2798 states have (on average 1.812723373838456) internal successors, (5072), 2801 states have internal predecessors, (5072), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-10-14 04:35:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 5173 transitions. [2024-10-14 04:35:09,135 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 5173 transitions. Word has length 171 [2024-10-14 04:35:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:09,135 INFO L471 AbstractCegarLoop]: Abstraction has 2862 states and 5173 transitions. [2024-10-14 04:35:09,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 5173 transitions. [2024-10-14 04:35:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:09,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:09,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:09,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:35:09,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:09,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:09,144 INFO L85 PathProgramCache]: Analyzing trace with hash 247523539, now seen corresponding path program 1 times [2024-10-14 04:35:09,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:09,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376665431] [2024-10-14 04:35:09,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:09,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:09,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:09,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:09,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:09,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:09,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:09,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:09,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376665431] [2024-10-14 04:35:09,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376665431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:09,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:09,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:09,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220405720] [2024-10-14 04:35:09,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:09,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:09,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:09,516 INFO L87 Difference]: Start difference. First operand 2862 states and 5173 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:13,161 INFO L93 Difference]: Finished difference Result 4396 states and 7749 transitions. [2024-10-14 04:35:13,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:35:13,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:13,175 INFO L225 Difference]: With dead ends: 4396 [2024-10-14 04:35:13,175 INFO L226 Difference]: Without dead ends: 3674 [2024-10-14 04:35:13,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:35:13,183 INFO L432 NwaCegarLoop]: 4449 mSDtfsCounter, 5591 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3997 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5611 SdHoareTripleChecker+Valid, 21912 SdHoareTripleChecker+Invalid, 4060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:13,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5611 Valid, 21912 Invalid, 4060 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3997 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 04:35:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2024-10-14 04:35:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3205. [2024-10-14 04:35:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7933804627249357) internal successors, (5581), 3116 states have internal predecessors, (5581), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-14 04:35:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5728 transitions. [2024-10-14 04:35:13,293 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5728 transitions. Word has length 171 [2024-10-14 04:35:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:13,293 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5728 transitions. [2024-10-14 04:35:13,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:13,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5728 transitions. [2024-10-14 04:35:13,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:13,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:13,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:13,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:35:13,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:13,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:13,299 INFO L85 PathProgramCache]: Analyzing trace with hash -17123951, now seen corresponding path program 1 times [2024-10-14 04:35:13,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:13,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493254843] [2024-10-14 04:35:13,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:13,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:13,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:13,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:13,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:13,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493254843] [2024-10-14 04:35:13,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493254843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:13,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:13,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:13,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415768931] [2024-10-14 04:35:13,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:13,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:13,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:13,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:13,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:13,582 INFO L87 Difference]: Start difference. First operand 3205 states and 5728 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:15,508 INFO L93 Difference]: Finished difference Result 4759 states and 8350 transitions. [2024-10-14 04:35:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:35:15,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:15,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:15,524 INFO L225 Difference]: With dead ends: 4759 [2024-10-14 04:35:15,524 INFO L226 Difference]: Without dead ends: 3694 [2024-10-14 04:35:15,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:35:15,529 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5115 mSDsluCounter, 16655 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5136 SdHoareTripleChecker+Valid, 20880 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:15,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5136 Valid, 20880 Invalid, 2114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 04:35:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2024-10-14 04:35:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3205. [2024-10-14 04:35:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7924164524421593) internal successors, (5578), 3116 states have internal predecessors, (5578), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-14 04:35:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5725 transitions. [2024-10-14 04:35:15,700 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5725 transitions. Word has length 171 [2024-10-14 04:35:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:15,701 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5725 transitions. [2024-10-14 04:35:15,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5725 transitions. [2024-10-14 04:35:15,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:15,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:15,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:15,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:35:15,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:15,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1340302897, now seen corresponding path program 1 times [2024-10-14 04:35:15,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:15,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087889999] [2024-10-14 04:35:15,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:15,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:15,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:15,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:15,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:15,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:15,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:15,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:15,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087889999] [2024-10-14 04:35:15,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087889999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:15,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:15,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:15,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694291295] [2024-10-14 04:35:15,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:15,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:15,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:15,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:15,955 INFO L87 Difference]: Start difference. First operand 3205 states and 5725 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:17,599 INFO L93 Difference]: Finished difference Result 4755 states and 8333 transitions. [2024-10-14 04:35:17,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:35:17,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:17,612 INFO L225 Difference]: With dead ends: 4755 [2024-10-14 04:35:17,612 INFO L226 Difference]: Without dead ends: 3690 [2024-10-14 04:35:17,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:35:17,618 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5276 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5297 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:17,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5297 Valid, 16750 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 04:35:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2024-10-14 04:35:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3205. [2024-10-14 04:35:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.791452442159383) internal successors, (5575), 3116 states have internal predecessors, (5575), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-14 04:35:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5722 transitions. [2024-10-14 04:35:17,716 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5722 transitions. Word has length 171 [2024-10-14 04:35:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:17,716 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5722 transitions. [2024-10-14 04:35:17,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5722 transitions. [2024-10-14 04:35:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:17,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:17,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:17,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:35:17,719 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:17,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:17,719 INFO L85 PathProgramCache]: Analyzing trace with hash 556676561, now seen corresponding path program 1 times [2024-10-14 04:35:17,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:17,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700629147] [2024-10-14 04:35:17,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:17,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:17,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:17,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:17,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:17,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700629147] [2024-10-14 04:35:17,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700629147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:17,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:17,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:17,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389026445] [2024-10-14 04:35:17,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:17,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:17,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:17,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:17,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:17,968 INFO L87 Difference]: Start difference. First operand 3205 states and 5722 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:19,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:19,518 INFO L93 Difference]: Finished difference Result 4751 states and 8316 transitions. [2024-10-14 04:35:19,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:35:19,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:19,530 INFO L225 Difference]: With dead ends: 4751 [2024-10-14 04:35:19,531 INFO L226 Difference]: Without dead ends: 3686 [2024-10-14 04:35:19,534 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-10-14 04:35:19,535 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5274 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5295 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:19,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5295 Valid, 16750 Invalid, 1913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [94 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 04:35:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2024-10-14 04:35:19,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3205. [2024-10-14 04:35:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7904884318766068) internal successors, (5572), 3116 states have internal predecessors, (5572), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-14 04:35:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5719 transitions. [2024-10-14 04:35:19,623 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5719 transitions. Word has length 171 [2024-10-14 04:35:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:19,623 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5719 transitions. [2024-10-14 04:35:19,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5719 transitions. [2024-10-14 04:35:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:19,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:19,625 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:19,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:35:19,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:19,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash 894964111, now seen corresponding path program 1 times [2024-10-14 04:35:19,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:19,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412813625] [2024-10-14 04:35:19,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:19,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:19,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:19,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:19,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:19,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:19,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:19,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:19,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412813625] [2024-10-14 04:35:19,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412813625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:19,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:19,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:19,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137427790] [2024-10-14 04:35:19,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:19,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:19,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:19,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:19,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:19,921 INFO L87 Difference]: Start difference. First operand 3205 states and 5719 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:22,887 INFO L93 Difference]: Finished difference Result 5709 states and 9880 transitions. [2024-10-14 04:35:22,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:35:22,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:22,906 INFO L225 Difference]: With dead ends: 5709 [2024-10-14 04:35:22,906 INFO L226 Difference]: Without dead ends: 4644 [2024-10-14 04:35:22,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:35:22,914 INFO L432 NwaCegarLoop]: 4247 mSDtfsCounter, 5674 mSDsluCounter, 16920 mSDsCounter, 0 mSdLazyCounter, 3255 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5694 SdHoareTripleChecker+Valid, 21167 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:22,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5694 Valid, 21167 Invalid, 3358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3255 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 04:35:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4644 states. [2024-10-14 04:35:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4644 to 3904. [2024-10-14 04:35:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3904 states, 3753 states have (on average 1.7593924860111911) internal successors, (6603), 3759 states have internal predecessors, (6603), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-14 04:35:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 6846 transitions. [2024-10-14 04:35:23,148 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 6846 transitions. Word has length 171 [2024-10-14 04:35:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:23,150 INFO L471 AbstractCegarLoop]: Abstraction has 3904 states and 6846 transitions. [2024-10-14 04:35:23,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 6846 transitions. [2024-10-14 04:35:23,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:23,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:23,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:23,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:35:23,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:23,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1321518609, now seen corresponding path program 1 times [2024-10-14 04:35:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:23,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420976285] [2024-10-14 04:35:23,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:23,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:23,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:23,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:23,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:23,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:23,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:23,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:23,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420976285] [2024-10-14 04:35:23,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420976285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:23,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:23,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:23,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735910515] [2024-10-14 04:35:23,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:23,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:23,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:23,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:23,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:23,469 INFO L87 Difference]: Start difference. First operand 3904 states and 6846 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:25,094 INFO L93 Difference]: Finished difference Result 6395 states and 10995 transitions. [2024-10-14 04:35:25,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:35:25,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:25,110 INFO L225 Difference]: With dead ends: 6395 [2024-10-14 04:35:25,111 INFO L226 Difference]: Without dead ends: 4631 [2024-10-14 04:35:25,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:35:25,119 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5273 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5294 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:25,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5294 Valid, 16750 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 04:35:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2024-10-14 04:35:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 3904. [2024-10-14 04:35:25,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3904 states, 3753 states have (on average 1.7580602184918732) internal successors, (6598), 3759 states have internal predecessors, (6598), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-14 04:35:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 6841 transitions. [2024-10-14 04:35:25,244 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 6841 transitions. Word has length 171 [2024-10-14 04:35:25,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:25,244 INFO L471 AbstractCegarLoop]: Abstraction has 3904 states and 6841 transitions. [2024-10-14 04:35:25,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 6841 transitions. [2024-10-14 04:35:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:25,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:25,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:25,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:35:25,247 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:25,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:25,247 INFO L85 PathProgramCache]: Analyzing trace with hash 781089103, now seen corresponding path program 1 times [2024-10-14 04:35:25,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:25,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748889599] [2024-10-14 04:35:25,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:25,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:25,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:25,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:25,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:25,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:25,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:25,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:25,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748889599] [2024-10-14 04:35:25,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748889599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:25,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:25,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:25,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681794891] [2024-10-14 04:35:25,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:25,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:25,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:25,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:25,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:25,501 INFO L87 Difference]: Start difference. First operand 3904 states and 6841 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:28,844 INFO L93 Difference]: Finished difference Result 8250 states and 14007 transitions. [2024-10-14 04:35:28,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:35:28,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:28,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:28,862 INFO L225 Difference]: With dead ends: 8250 [2024-10-14 04:35:28,862 INFO L226 Difference]: Without dead ends: 6486 [2024-10-14 04:35:28,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:35:28,870 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5556 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3863 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5576 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:28,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5576 Valid, 21910 Invalid, 3928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3863 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 04:35:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2024-10-14 04:35:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 5302. [2024-10-14 04:35:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5302 states, 5035 states have (on average 1.717974180734856) internal successors, (8650), 5045 states have internal predecessors, (8650), 203 states have call successors, (203), 54 states have call predecessors, (203), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-10-14 04:35:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5302 states to 5302 states and 9091 transitions. [2024-10-14 04:35:29,055 INFO L78 Accepts]: Start accepts. Automaton has 5302 states and 9091 transitions. Word has length 171 [2024-10-14 04:35:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:29,056 INFO L471 AbstractCegarLoop]: Abstraction has 5302 states and 9091 transitions. [2024-10-14 04:35:29,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5302 states and 9091 transitions. [2024-10-14 04:35:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:29,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:29,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:29,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:35:29,059 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:29,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:29,060 INFO L85 PathProgramCache]: Analyzing trace with hash 625108561, now seen corresponding path program 1 times [2024-10-14 04:35:29,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:29,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050808949] [2024-10-14 04:35:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:29,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:29,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:29,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:29,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:29,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:29,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:29,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050808949] [2024-10-14 04:35:29,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050808949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:29,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:29,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:29,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787944513] [2024-10-14 04:35:29,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:29,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:29,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:29,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:29,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:29,293 INFO L87 Difference]: Start difference. First operand 5302 states and 9091 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:32,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:32,711 INFO L93 Difference]: Finished difference Result 13338 states and 22315 transitions. [2024-10-14 04:35:32,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:35:32,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:32,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:32,737 INFO L225 Difference]: With dead ends: 13338 [2024-10-14 04:35:32,737 INFO L226 Difference]: Without dead ends: 10176 [2024-10-14 04:35:32,748 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-10-14 04:35:32,749 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5561 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3845 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5581 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:32,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5581 Valid, 21910 Invalid, 3910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3845 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 04:35:32,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10176 states. [2024-10-14 04:35:33,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10176 to 8103. [2024-10-14 04:35:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.6780641767490794) internal successors, (12760), 7622 states have internal predecessors, (12760), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-14 04:35:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13615 transitions. [2024-10-14 04:35:33,083 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13615 transitions. Word has length 171 [2024-10-14 04:35:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:33,084 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13615 transitions. [2024-10-14 04:35:33,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13615 transitions. [2024-10-14 04:35:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:33,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:33,089 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:33,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:35:33,090 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:33,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:33,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1035718927, now seen corresponding path program 1 times [2024-10-14 04:35:33,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:33,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663856001] [2024-10-14 04:35:33,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:33,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:33,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:33,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:33,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:33,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:33,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:33,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663856001] [2024-10-14 04:35:33,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663856001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:33,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:33,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:33,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016629497] [2024-10-14 04:35:33,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:33,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:33,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:33,291 INFO L87 Difference]: Start difference. First operand 8103 states and 13615 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:34,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:34,990 INFO L93 Difference]: Finished difference Result 16213 states and 27056 transitions. [2024-10-14 04:35:34,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:35:34,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:34,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:35,019 INFO L225 Difference]: With dead ends: 16213 [2024-10-14 04:35:35,020 INFO L226 Difference]: Without dead ends: 10250 [2024-10-14 04:35:35,037 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-10-14 04:35:35,038 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5277 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5298 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:35,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5298 Valid, 16750 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 04:35:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10250 states. [2024-10-14 04:35:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10250 to 8103. [2024-10-14 04:35:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.675828511309837) internal successors, (12743), 7622 states have internal predecessors, (12743), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-14 04:35:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13598 transitions. [2024-10-14 04:35:35,402 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13598 transitions. Word has length 171 [2024-10-14 04:35:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:35,404 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13598 transitions. [2024-10-14 04:35:35,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13598 transitions. [2024-10-14 04:35:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:35,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:35,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:35,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:35:35,410 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:35,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:35,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1100164275, now seen corresponding path program 1 times [2024-10-14 04:35:35,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:35,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048447189] [2024-10-14 04:35:35,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:35,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:35,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:35,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:35,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:35,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:35,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:35,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048447189] [2024-10-14 04:35:35,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048447189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:35,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:35,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:35,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698218025] [2024-10-14 04:35:35,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:35,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:35,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:35,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:35,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:35,620 INFO L87 Difference]: Start difference. First operand 8103 states and 13598 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:37,652 INFO L93 Difference]: Finished difference Result 16195 states and 26969 transitions. [2024-10-14 04:35:37,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:35:37,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:37,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:37,682 INFO L225 Difference]: With dead ends: 16195 [2024-10-14 04:35:37,682 INFO L226 Difference]: Without dead ends: 10232 [2024-10-14 04:35:37,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:35:37,700 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5112 mSDsluCounter, 16655 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5133 SdHoareTripleChecker+Valid, 20880 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:37,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5133 Valid, 20880 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 04:35:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10232 states. [2024-10-14 04:35:38,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10232 to 8103. [2024-10-14 04:35:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.6735928458705944) internal successors, (12726), 7622 states have internal predecessors, (12726), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-14 04:35:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13581 transitions. [2024-10-14 04:35:38,040 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13581 transitions. Word has length 171 [2024-10-14 04:35:38,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:38,040 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13581 transitions. [2024-10-14 04:35:38,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13581 transitions. [2024-10-14 04:35:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:38,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:38,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:38,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 04:35:38,045 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:38,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1030516401, now seen corresponding path program 1 times [2024-10-14 04:35:38,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:38,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465585544] [2024-10-14 04:35:38,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:38,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:38,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:38,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:38,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:38,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:38,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:38,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:38,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465585544] [2024-10-14 04:35:38,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465585544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:38,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:38,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:38,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034149384] [2024-10-14 04:35:38,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:38,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:38,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:38,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:38,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:38,252 INFO L87 Difference]: Start difference. First operand 8103 states and 13581 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:42,243 INFO L93 Difference]: Finished difference Result 23459 states and 38713 transitions. [2024-10-14 04:35:42,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:35:42,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:42,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:42,287 INFO L225 Difference]: With dead ends: 23459 [2024-10-14 04:35:42,287 INFO L226 Difference]: Without dead ends: 17496 [2024-10-14 04:35:42,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:35:42,301 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5542 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3768 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5562 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:42,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5562 Valid, 21910 Invalid, 3833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3768 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 04:35:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17496 states. [2024-10-14 04:35:42,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17496 to 13771. [2024-10-14 04:35:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13771 states, 12808 states have (on average 1.6400687070580886) internal successors, (21006), 12842 states have internal predecessors, (21006), 731 states have call successors, (731), 198 states have call predecessors, (731), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-10-14 04:35:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13771 states to 13771 states and 22743 transitions. [2024-10-14 04:35:42,939 INFO L78 Accepts]: Start accepts. Automaton has 13771 states and 22743 transitions. Word has length 171 [2024-10-14 04:35:42,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:42,940 INFO L471 AbstractCegarLoop]: Abstraction has 13771 states and 22743 transitions. [2024-10-14 04:35:42,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:42,940 INFO L276 IsEmpty]: Start isEmpty. Operand 13771 states and 22743 transitions. [2024-10-14 04:35:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:42,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:42,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:42,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 04:35:42,946 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:42,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash -612627699, now seen corresponding path program 1 times [2024-10-14 04:35:42,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:42,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649665713] [2024-10-14 04:35:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:42,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:43,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:43,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:43,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:43,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:43,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:43,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:43,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649665713] [2024-10-14 04:35:43,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649665713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:43,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:43,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:43,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953232864] [2024-10-14 04:35:43,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:43,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:43,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:43,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:43,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:43,148 INFO L87 Difference]: Start difference. First operand 13771 states and 22743 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:48,087 INFO L93 Difference]: Finished difference Result 49061 states and 80615 transitions. [2024-10-14 04:35:48,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:35:48,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:48,196 INFO L225 Difference]: With dead ends: 49061 [2024-10-14 04:35:48,197 INFO L226 Difference]: Without dead ends: 37430 [2024-10-14 04:35:48,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:35:48,239 INFO L432 NwaCegarLoop]: 4249 mSDtfsCounter, 6106 mSDsluCounter, 16918 mSDsCounter, 0 mSdLazyCounter, 3161 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6140 SdHoareTripleChecker+Valid, 21167 SdHoareTripleChecker+Invalid, 3267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:48,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6140 Valid, 21167 Invalid, 3267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3161 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 04:35:48,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37430 states. [2024-10-14 04:35:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37430 to 25068. [2024-10-14 04:35:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25068 states, 23209 states have (on average 1.6186824076866733) internal successors, (37568), 23275 states have internal predecessors, (37568), 1403 states have call successors, (1403), 390 states have call predecessors, (1403), 454 states have return successors, (2196), 1466 states have call predecessors, (2196), 1403 states have call successors, (2196) [2024-10-14 04:35:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25068 states to 25068 states and 41167 transitions. [2024-10-14 04:35:49,836 INFO L78 Accepts]: Start accepts. Automaton has 25068 states and 41167 transitions. Word has length 171 [2024-10-14 04:35:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:35:49,837 INFO L471 AbstractCegarLoop]: Abstraction has 25068 states and 41167 transitions. [2024-10-14 04:35:49,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 25068 states and 41167 transitions. [2024-10-14 04:35:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:35:49,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:35:49,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:35:49,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 04:35:49,850 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:35:49,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:35:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash 786325903, now seen corresponding path program 1 times [2024-10-14 04:35:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:35:49,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881039270] [2024-10-14 04:35:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:35:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:35:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:49,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:35:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:49,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:35:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:50,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:35:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:50,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:35:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:50,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:35:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:35:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:35:50,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:35:50,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881039270] [2024-10-14 04:35:50,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881039270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:35:50,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:35:50,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:35:50,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988139700] [2024-10-14 04:35:50,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:35:50,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:35:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:35:50,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:35:50,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:35:50,073 INFO L87 Difference]: Start difference. First operand 25068 states and 41167 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:35:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:35:57,434 INFO L93 Difference]: Finished difference Result 94116 states and 155021 transitions. [2024-10-14 04:35:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:35:57,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 171 [2024-10-14 04:35:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:35:57,657 INFO L225 Difference]: With dead ends: 94116 [2024-10-14 04:35:57,657 INFO L226 Difference]: Without dead ends: 71188 [2024-10-14 04:35:57,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:35:57,717 INFO L432 NwaCegarLoop]: 4444 mSDtfsCounter, 5649 mSDsluCounter, 17455 mSDsCounter, 0 mSdLazyCounter, 4464 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5668 SdHoareTripleChecker+Valid, 21899 SdHoareTripleChecker+Invalid, 4531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 4464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:35:57,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5668 Valid, 21899 Invalid, 4531 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 4464 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 04:35:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71188 states. [2024-10-14 04:36:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71188 to 47341. [2024-10-14 04:36:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47341 states, 43722 states have (on average 1.6065596267325375) internal successors, (70242), 43852 states have internal predecessors, (70242), 2715 states have call successors, (2715), 774 states have call predecessors, (2715), 902 states have return successors, (5030), 2842 states have call predecessors, (5030), 2715 states have call successors, (5030) [2024-10-14 04:36:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47341 states to 47341 states and 77987 transitions. [2024-10-14 04:36:00,732 INFO L78 Accepts]: Start accepts. Automaton has 47341 states and 77987 transitions. Word has length 171 [2024-10-14 04:36:00,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:36:00,732 INFO L471 AbstractCegarLoop]: Abstraction has 47341 states and 77987 transitions. [2024-10-14 04:36:00,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 04:36:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 47341 states and 77987 transitions. [2024-10-14 04:36:00,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:36:00,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:36:00,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:36:00,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 04:36:00,750 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:36:00,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:36:00,750 INFO L85 PathProgramCache]: Analyzing trace with hash -831114547, now seen corresponding path program 1 times [2024-10-14 04:36:00,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:36:00,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468092109] [2024-10-14 04:36:00,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:36:00,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:36:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:00,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:36:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:00,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:36:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:00,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:36:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:00,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:36:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:00,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:36:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:36:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:36:00,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:36:00,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468092109] [2024-10-14 04:36:00,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468092109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:36:00,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:36:00,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:36:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948376013] [2024-10-14 04:36:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:36:00,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:36:00,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:36:00,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:36:00,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:36:00,950 INFO L87 Difference]: Start difference. First operand 47341 states and 77987 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)