./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_label42+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0dd7176ec9512a8a603e4cceffab6b6f1677decce373a9b5c36f88d73957ca4d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:14:31,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:14:31,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:14:31,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:14:31,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:14:31,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:14:31,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:14:31,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:14:31,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:14:31,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:14:31,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:14:31,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:14:31,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:14:31,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:14:31,500 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:14:31,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:14:31,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:14:31,501 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:14:31,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:14:31,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:14:31,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:14:31,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:14:31,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:14:31,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:14:31,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:14:31,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:14:31,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:14:31,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:14:31,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:14:31,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:14:31,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:14:31,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:14:31,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:14:31,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:14:31,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:14:31,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:14:31,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:14:31,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:14:31,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:14:31,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:14:31,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:14:31,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:14:31,519 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0dd7176ec9512a8a603e4cceffab6b6f1677decce373a9b5c36f88d73957ca4d [2024-10-11 04:14:31,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:14:31,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:14:31,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:14:31,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:14:31,750 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:14:31,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c [2024-10-11 04:14:33,731 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:14:34,307 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:14:34,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-2.c [2024-10-11 04:14:34,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/34d9b9c25/1cfa51b849ef4550b71b39358b429865/FLAG45d3f489e [2024-10-11 04:14:34,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/34d9b9c25/1cfa51b849ef4550b71b39358b429865 [2024-10-11 04:14:34,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:14:34,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:14:34,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:14:34,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:14:34,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:14:34,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:14:34" (1/1) ... [2024-10-11 04:14:34,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416d2bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:34, skipping insertion in model container [2024-10-11 04:14:34,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:14:34" (1/1) ... [2024-10-11 04:14:34,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:14:36,488 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_label42+token_ring.11.cil-2.c[378560,378573] [2024-10-11 04:14:36,514 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_label42+token_ring.11.cil-2.c[383339,383352] [2024-10-11 04:14:36,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:14:36,774 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:14:37,589 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_label42+token_ring.11.cil-2.c[378560,378573] [2024-10-11 04:14:37,598 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_label42+token_ring.11.cil-2.c[383339,383352] [2024-10-11 04:14:37,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:14:37,709 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:14:37,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37 WrapperNode [2024-10-11 04:14:37,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:14:37,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:14:37,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:14:37,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:14:37,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37" (1/1) ... [2024-10-11 04:14:37,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37" (1/1) ... [2024-10-11 04:14:38,220 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13173 [2024-10-11 04:14:38,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:14:38,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:14:38,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:14:38,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:14:38,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37" (1/1) ... [2024-10-11 04:14:38,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37" (1/1) ... [2024-10-11 04:14:38,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37" (1/1) ... [2024-10-11 04:14:38,472 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:14:38,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37" (1/1) ... [2024-10-11 04:14:38,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37" (1/1) ... [2024-10-11 04:14:38,725 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37" (1/1) ... [2024-10-11 04:14:38,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37" (1/1) ... [2024-10-11 04:14:38,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37" (1/1) ... [2024-10-11 04:14:38,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37" (1/1) ... [2024-10-11 04:14:38,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:14:38,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:14:38,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:14:38,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:14:38,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37" (1/1) ... [2024-10-11 04:14:38,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:14:38,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:14:38,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:14:38,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:14:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:14:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:14:39,006 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:14:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:14:39,007 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:14:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:14:39,008 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:14:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:14:39,008 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:14:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:14:39,009 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:14:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:14:39,009 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:14:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:14:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:14:39,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:14:39,139 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:14:39,141 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:14:47,170 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2024-10-11 04:14:47,170 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:14:47,313 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:14:47,313 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-11 04:14:47,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:14:47 BoogieIcfgContainer [2024-10-11 04:14:47,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:14:47,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:14:47,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:14:47,321 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:14:47,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:14:34" (1/3) ... [2024-10-11 04:14:47,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a35ba10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:14:47, skipping insertion in model container [2024-10-11 04:14:47,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:37" (2/3) ... [2024-10-11 04:14:47,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a35ba10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:14:47, skipping insertion in model container [2024-10-11 04:14:47,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:14:47" (3/3) ... [2024-10-11 04:14:47,324 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.11.cil-2.c [2024-10-11 04:14:47,343 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:14:47,343 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:14:47,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:14:47,473 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;@54fa0298, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:14:47,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:14:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 2448 states, 2414 states have (on average 1.876553438276719) internal successors, (4530), 2417 states have internal predecessors, (4530), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 04:14:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:14:47,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:47,504 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] [2024-10-11 04:14:47,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:47,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1361111705, now seen corresponding path program 1 times [2024-10-11 04:14:47,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:47,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888489791] [2024-10-11 04:14:47,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:47,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:47,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:48,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:14:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:48,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:14:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:48,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:14:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:48,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:14:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:48,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:48,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888489791] [2024-10-11 04:14:48,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888489791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:48,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:48,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:14:48,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892240090] [2024-10-11 04:14:48,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:48,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:14:48,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:48,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:14:48,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:14:48,282 INFO L87 Difference]: Start difference. First operand has 2448 states, 2414 states have (on average 1.876553438276719) internal successors, (4530), 2417 states have internal predecessors, (4530), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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-11 04:14:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:50,229 INFO L93 Difference]: Finished difference Result 5006 states and 9354 transitions. [2024-10-11 04:14:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:14:50,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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 151 [2024-10-11 04:14:50,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:50,254 INFO L225 Difference]: With dead ends: 5006 [2024-10-11 04:14:50,255 INFO L226 Difference]: Without dead ends: 2564 [2024-10-11 04:14:50,264 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-11 04:14:50,266 INFO L432 NwaCegarLoop]: 4238 mSDtfsCounter, 902 mSDsluCounter, 12182 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 16420 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:50,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 16420 Invalid, 1046 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:14:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-10-11 04:14:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2444. [2024-10-11 04:14:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 2411 states have (on average 1.838241393612609) internal successors, (4432), 2413 states have internal predecessors, (4432), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 04:14:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 4482 transitions. [2024-10-11 04:14:50,387 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 4482 transitions. Word has length 151 [2024-10-11 04:14:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:50,387 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 4482 transitions. [2024-10-11 04:14:50,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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-11 04:14:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 4482 transitions. [2024-10-11 04:14:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:14:50,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:50,391 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] [2024-10-11 04:14:50,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:14:50,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:50,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash 774771497, now seen corresponding path program 1 times [2024-10-11 04:14:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:50,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349173292] [2024-10-11 04:14:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:50,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:50,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:14:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:50,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:14:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:50,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:14:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:50,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:14:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:50,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:50,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349173292] [2024-10-11 04:14:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349173292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:50,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:50,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:14:50,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511119054] [2024-10-11 04:14:50,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:50,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:14:50,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:50,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:14:50,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:14:50,734 INFO L87 Difference]: Start difference. First operand 2444 states and 4482 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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-11 04:14:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:54,603 INFO L93 Difference]: Finished difference Result 3313 states and 5934 transitions. [2024-10-11 04:14:54,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:14:54,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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 151 [2024-10-11 04:14:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:54,629 INFO L225 Difference]: With dead ends: 3313 [2024-10-11 04:14:54,634 INFO L226 Difference]: Without dead ends: 3007 [2024-10-11 04:14:54,638 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-11 04:14:54,639 INFO L432 NwaCegarLoop]: 4252 mSDtfsCounter, 5325 mSDsluCounter, 12699 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5343 SdHoareTripleChecker+Valid, 16951 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:54,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5343 Valid, 16951 Invalid, 2279 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [104 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 04:14:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-11 04:14:54,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2768. [2024-10-11 04:14:54,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 2708 states have (on average 1.8172082717872968) internal successors, (4921), 2711 states have internal predecessors, (4921), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-10-11 04:14:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 5014 transitions. [2024-10-11 04:14:54,774 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 5014 transitions. Word has length 151 [2024-10-11 04:14:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:54,774 INFO L471 AbstractCegarLoop]: Abstraction has 2768 states and 5014 transitions. [2024-10-11 04:14:54,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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-11 04:14:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 5014 transitions. [2024-10-11 04:14:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:14:54,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:54,777 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] [2024-10-11 04:14:54,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:14:54,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:54,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:54,778 INFO L85 PathProgramCache]: Analyzing trace with hash 653545645, now seen corresponding path program 1 times [2024-10-11 04:14:54,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:54,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601221321] [2024-10-11 04:14:54,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:54,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:54,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:55,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:14:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:55,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:14:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:55,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:14:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:55,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:14:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:55,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:55,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601221321] [2024-10-11 04:14:55,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601221321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:55,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:55,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896152841] [2024-10-11 04:14:55,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:55,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:55,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:55,185 INFO L87 Difference]: Start difference. First operand 2768 states and 5014 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:14:59,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:59,535 INFO L93 Difference]: Finished difference Result 4098 states and 7236 transitions. [2024-10-11 04:14:59,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:14:59,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:14:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:59,552 INFO L225 Difference]: With dead ends: 4098 [2024-10-11 04:14:59,552 INFO L226 Difference]: Without dead ends: 3468 [2024-10-11 04:14:59,556 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-11 04:14:59,559 INFO L432 NwaCegarLoop]: 4390 mSDtfsCounter, 5356 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3461 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5374 SdHoareTripleChecker+Valid, 21646 SdHoareTripleChecker+Invalid, 3520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:59,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5374 Valid, 21646 Invalid, 3520 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 3461 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 04:14:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2024-10-11 04:14:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3067. [2024-10-11 04:14:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 2980 states have (on average 1.7986577181208054) internal successors, (5360), 2984 states have internal predecessors, (5360), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-11 04:14:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 5495 transitions. [2024-10-11 04:14:59,678 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 5495 transitions. Word has length 151 [2024-10-11 04:14:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:59,679 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 5495 transitions. [2024-10-11 04:14:59,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:14:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 5495 transitions. [2024-10-11 04:14:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:14:59,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:59,682 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] [2024-10-11 04:14:59,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:14:59,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:59,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1328705771, now seen corresponding path program 1 times [2024-10-11 04:14:59,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:59,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203903336] [2024-10-11 04:14:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:59,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:59,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:14:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:59,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:14:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:59,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:14:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:59,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:14:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:59,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:59,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203903336] [2024-10-11 04:14:59,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203903336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:59,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:59,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:59,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080506329] [2024-10-11 04:14:59,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:59,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:59,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:59,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:59,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:59,959 INFO L87 Difference]: Start difference. First operand 3067 states and 5495 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:03,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:03,864 INFO L93 Difference]: Finished difference Result 5248 states and 9131 transitions. [2024-10-11 04:15:03,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:15:03,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:15:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:03,886 INFO L225 Difference]: With dead ends: 5248 [2024-10-11 04:15:03,886 INFO L226 Difference]: Without dead ends: 4319 [2024-10-11 04:15:03,892 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-11 04:15:03,893 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5354 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3457 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5372 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:03,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5372 Valid, 21644 Invalid, 3518 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3457 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 04:15:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2024-10-11 04:15:04,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 3666. [2024-10-11 04:15:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7699290780141843) internal successors, (6239), 3531 states have internal predecessors, (6239), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:15:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6462 transitions. [2024-10-11 04:15:04,048 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6462 transitions. Word has length 151 [2024-10-11 04:15:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:04,049 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6462 transitions. [2024-10-11 04:15:04,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6462 transitions. [2024-10-11 04:15:04,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:15:04,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:04,051 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] [2024-10-11 04:15:04,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:15:04,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:04,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash 380653805, now seen corresponding path program 1 times [2024-10-11 04:15:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:04,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391346844] [2024-10-11 04:15:04,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:04,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:04,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:04,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:15:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:04,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:15:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:04,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:15:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:04,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:15:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:04,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391346844] [2024-10-11 04:15:04,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391346844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:04,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:04,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:04,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814945583] [2024-10-11 04:15:04,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:04,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:04,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:04,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:04,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:04,339 INFO L87 Difference]: Start difference. First operand 3666 states and 6462 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:06,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:06,569 INFO L93 Difference]: Finished difference Result 5837 states and 10091 transitions. [2024-10-11 04:15:06,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:15:06,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:15:06,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:06,585 INFO L225 Difference]: With dead ends: 5837 [2024-10-11 04:15:06,586 INFO L226 Difference]: Without dead ends: 4309 [2024-10-11 04:15:06,592 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-11 04:15:06,593 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 4957 mSDsluCounter, 16550 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4976 SdHoareTripleChecker+Valid, 20742 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:06,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4976 Valid, 20742 Invalid, 1832 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:15:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2024-10-11 04:15:06,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 3666. [2024-10-11 04:15:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7685106382978724) internal successors, (6234), 3531 states have internal predecessors, (6234), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:15:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6457 transitions. [2024-10-11 04:15:06,717 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6457 transitions. Word has length 151 [2024-10-11 04:15:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:06,717 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6457 transitions. [2024-10-11 04:15:06,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6457 transitions. [2024-10-11 04:15:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:15:06,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:06,720 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] [2024-10-11 04:15:06,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:15:06,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:06,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:06,720 INFO L85 PathProgramCache]: Analyzing trace with hash -204117845, now seen corresponding path program 1 times [2024-10-11 04:15:06,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:06,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232233038] [2024-10-11 04:15:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:06,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:06,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:15:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:07,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:15:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:15:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:07,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:15:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:07,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:07,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232233038] [2024-10-11 04:15:07,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232233038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:07,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:07,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:07,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199346179] [2024-10-11 04:15:07,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:07,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:07,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:07,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:07,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:07,051 INFO L87 Difference]: Start difference. First operand 3666 states and 6457 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:09,006 INFO L93 Difference]: Finished difference Result 5831 states and 10065 transitions. [2024-10-11 04:15:09,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:15:09,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:15:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:09,055 INFO L225 Difference]: With dead ends: 5831 [2024-10-11 04:15:09,059 INFO L226 Difference]: Without dead ends: 4303 [2024-10-11 04:15:09,065 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-11 04:15:09,067 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5096 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5115 SdHoareTripleChecker+Valid, 16633 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:09,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5115 Valid, 16633 Invalid, 1669 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [88 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:15:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2024-10-11 04:15:09,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 3666. [2024-10-11 04:15:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7670921985815602) internal successors, (6229), 3531 states have internal predecessors, (6229), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:15:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6452 transitions. [2024-10-11 04:15:09,205 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6452 transitions. Word has length 151 [2024-10-11 04:15:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:09,205 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6452 transitions. [2024-10-11 04:15:09,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6452 transitions. [2024-10-11 04:15:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:15:09,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:09,208 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] [2024-10-11 04:15:09,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:15:09,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:09,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash -638623443, now seen corresponding path program 1 times [2024-10-11 04:15:09,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:09,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664706417] [2024-10-11 04:15:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:09,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:09,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:09,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:15:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:09,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:15:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:09,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:15:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:09,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:15:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:09,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:09,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664706417] [2024-10-11 04:15:09,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664706417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:09,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:09,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:09,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023566977] [2024-10-11 04:15:09,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:09,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:09,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:09,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:09,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:09,460 INFO L87 Difference]: Start difference. First operand 3666 states and 6452 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:11,148 INFO L93 Difference]: Finished difference Result 5824 states and 10037 transitions. [2024-10-11 04:15:11,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:15:11,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:15:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:11,170 INFO L225 Difference]: With dead ends: 5824 [2024-10-11 04:15:11,170 INFO L226 Difference]: Without dead ends: 4296 [2024-10-11 04:15:11,177 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-11 04:15:11,178 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5100 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5119 SdHoareTripleChecker+Valid, 16633 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:11,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5119 Valid, 16633 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:15:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2024-10-11 04:15:11,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3666. [2024-10-11 04:15:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7656737588652482) internal successors, (6224), 3531 states have internal predecessors, (6224), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:15:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6447 transitions. [2024-10-11 04:15:11,531 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6447 transitions. Word has length 151 [2024-10-11 04:15:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:11,533 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6447 transitions. [2024-10-11 04:15:11,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6447 transitions. [2024-10-11 04:15:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:15:11,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:11,537 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] [2024-10-11 04:15:11,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:15:11,537 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:11,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:11,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1068281749, now seen corresponding path program 1 times [2024-10-11 04:15:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:11,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714554650] [2024-10-11 04:15:11,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:11,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:11,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:11,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:15:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:11,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:15:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:11,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:15:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:11,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:15:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:11,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:11,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714554650] [2024-10-11 04:15:11,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714554650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:11,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:11,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:11,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757930636] [2024-10-11 04:15:11,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:11,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:11,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:11,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:11,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:11,869 INFO L87 Difference]: Start difference. First operand 3666 states and 6447 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:13,758 INFO L93 Difference]: Finished difference Result 5812 states and 9999 transitions. [2024-10-11 04:15:13,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:15:13,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:15:13,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:13,774 INFO L225 Difference]: With dead ends: 5812 [2024-10-11 04:15:13,774 INFO L226 Difference]: Without dead ends: 4284 [2024-10-11 04:15:13,782 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-11 04:15:13,783 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5096 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5115 SdHoareTripleChecker+Valid, 16633 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:13,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5115 Valid, 16633 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:15:13,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2024-10-11 04:15:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 3666. [2024-10-11 04:15:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.764255319148936) internal successors, (6219), 3531 states have internal predecessors, (6219), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:15:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6442 transitions. [2024-10-11 04:15:14,088 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6442 transitions. Word has length 151 [2024-10-11 04:15:14,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:14,090 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6442 transitions. [2024-10-11 04:15:14,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:14,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6442 transitions. [2024-10-11 04:15:14,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:15:14,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:14,093 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] [2024-10-11 04:15:14,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:15:14,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:14,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:14,094 INFO L85 PathProgramCache]: Analyzing trace with hash -121243863, now seen corresponding path program 1 times [2024-10-11 04:15:14,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:14,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760836932] [2024-10-11 04:15:14,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:14,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:14,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:15:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:14,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:15:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:14,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:15:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:14,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:15:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:14,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:14,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760836932] [2024-10-11 04:15:14,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760836932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:14,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:14,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231014840] [2024-10-11 04:15:14,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:14,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:14,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:14,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:14,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:14,310 INFO L87 Difference]: Start difference. First operand 3666 states and 6442 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:18,017 INFO L93 Difference]: Finished difference Result 7418 states and 12588 transitions. [2024-10-11 04:15:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:15:18,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:15:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:18,037 INFO L225 Difference]: With dead ends: 7418 [2024-10-11 04:15:18,037 INFO L226 Difference]: Without dead ends: 5890 [2024-10-11 04:15:18,044 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-11 04:15:18,045 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5325 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3327 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5343 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:18,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5343 Valid, 21644 Invalid, 3388 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3327 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:15:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5890 states. [2024-10-11 04:15:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5890 to 4887. [2024-10-11 04:15:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4638 states have (on average 1.7231565329883571) internal successors, (7992), 4648 states have internal predecessors, (7992), 185 states have call successors, (185), 54 states have call predecessors, (185), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-10-11 04:15:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 8397 transitions. [2024-10-11 04:15:18,253 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 8397 transitions. Word has length 151 [2024-10-11 04:15:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:18,254 INFO L471 AbstractCegarLoop]: Abstraction has 4887 states and 8397 transitions. [2024-10-11 04:15:18,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 8397 transitions. [2024-10-11 04:15:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:15:18,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:18,258 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] [2024-10-11 04:15:18,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:15:18,258 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:18,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:18,258 INFO L85 PathProgramCache]: Analyzing trace with hash 740589739, now seen corresponding path program 1 times [2024-10-11 04:15:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:18,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624697515] [2024-10-11 04:15:18,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:18,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:18,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:15:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:18,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:15:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:18,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:15:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:18,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:15:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:18,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:18,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624697515] [2024-10-11 04:15:18,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624697515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:18,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:18,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:18,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435404116] [2024-10-11 04:15:18,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:18,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:18,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:18,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:18,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:18,580 INFO L87 Difference]: Start difference. First operand 4887 states and 8397 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:22,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:22,758 INFO L93 Difference]: Finished difference Result 11823 states and 19739 transitions. [2024-10-11 04:15:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:15:22,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:15:22,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:22,791 INFO L225 Difference]: With dead ends: 11823 [2024-10-11 04:15:22,791 INFO L226 Difference]: Without dead ends: 9074 [2024-10-11 04:15:22,799 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-11 04:15:22,799 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5324 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5342 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:22,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5342 Valid, 21644 Invalid, 3375 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3314 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 04:15:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9074 states. [2024-10-11 04:15:23,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9074 to 7326. [2024-10-11 04:15:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7326 states, 6861 states have (on average 1.6802215420492639) internal successors, (11528), 6879 states have internal predecessors, (11528), 345 states have call successors, (345), 102 states have call predecessors, (345), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-10-11 04:15:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 12315 transitions. [2024-10-11 04:15:23,061 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 12315 transitions. Word has length 151 [2024-10-11 04:15:23,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:23,061 INFO L471 AbstractCegarLoop]: Abstraction has 7326 states and 12315 transitions. [2024-10-11 04:15:23,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 12315 transitions. [2024-10-11 04:15:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:15:23,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:23,066 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] [2024-10-11 04:15:23,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:15:23,066 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:23,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:23,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1309819159, now seen corresponding path program 1 times [2024-10-11 04:15:23,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:23,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921391204] [2024-10-11 04:15:23,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:23,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:23,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:23,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:15:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:23,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:15:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:23,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:15:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:23,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:15:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:23,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:23,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921391204] [2024-10-11 04:15:23,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921391204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:23,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:23,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:23,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586444963] [2024-10-11 04:15:23,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:23,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:23,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:23,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:23,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:23,381 INFO L87 Difference]: Start difference. First operand 7326 states and 12315 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:26,805 INFO L93 Difference]: Finished difference Result 20624 states and 34083 transitions. [2024-10-11 04:15:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:15:26,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:15:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:26,851 INFO L225 Difference]: With dead ends: 20624 [2024-10-11 04:15:26,851 INFO L226 Difference]: Without dead ends: 15436 [2024-10-11 04:15:26,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:15:26,871 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5323 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3301 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5341 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:26,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5341 Valid, 21644 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3301 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:15:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15436 states. [2024-10-11 04:15:27,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15436 to 12219. [2024-10-11 04:15:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12219 states, 11322 states have (on average 1.6447624094682918) internal successors, (18622), 11356 states have internal predecessors, (18622), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-11 04:15:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12219 states to 12219 states and 20227 transitions. [2024-10-11 04:15:27,523 INFO L78 Accepts]: Start accepts. Automaton has 12219 states and 20227 transitions. Word has length 151 [2024-10-11 04:15:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:27,524 INFO L471 AbstractCegarLoop]: Abstraction has 12219 states and 20227 transitions. [2024-10-11 04:15:27,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 12219 states and 20227 transitions. [2024-10-11 04:15:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:15:27,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:27,531 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] [2024-10-11 04:15:27,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:15:27,531 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:27,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:27,532 INFO L85 PathProgramCache]: Analyzing trace with hash -821772053, now seen corresponding path program 1 times [2024-10-11 04:15:27,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:27,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129649685] [2024-10-11 04:15:27,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:27,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:27,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:27,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:15:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:27,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:15:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:27,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:15:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:27,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:15:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:27,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:27,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129649685] [2024-10-11 04:15:27,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129649685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:27,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:27,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:27,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820977945] [2024-10-11 04:15:27,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:27,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:27,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:27,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:27,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:27,714 INFO L87 Difference]: Start difference. First operand 12219 states and 20227 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:30,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:30,024 INFO L93 Difference]: Finished difference Result 25682 states and 42532 transitions. [2024-10-11 04:15:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:15:30,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:15:30,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:30,142 INFO L225 Difference]: With dead ends: 25682 [2024-10-11 04:15:30,146 INFO L226 Difference]: Without dead ends: 15601 [2024-10-11 04:15:30,203 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-11 04:15:30,204 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 4956 mSDsluCounter, 16550 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4975 SdHoareTripleChecker+Valid, 20742 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:30,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4975 Valid, 20742 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:15:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15601 states. [2024-10-11 04:15:30,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15601 to 12219. [2024-10-11 04:15:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12219 states, 11322 states have (on average 1.641847730083024) internal successors, (18589), 11356 states have internal predecessors, (18589), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-11 04:15:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12219 states to 12219 states and 20194 transitions. [2024-10-11 04:15:31,013 INFO L78 Accepts]: Start accepts. Automaton has 12219 states and 20194 transitions. Word has length 151 [2024-10-11 04:15:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:31,014 INFO L471 AbstractCegarLoop]: Abstraction has 12219 states and 20194 transitions. [2024-10-11 04:15:31,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 12219 states and 20194 transitions. [2024-10-11 04:15:31,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:15:31,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:31,020 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] [2024-10-11 04:15:31,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:15:31,020 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:31,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:31,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1914407255, now seen corresponding path program 1 times [2024-10-11 04:15:31,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:31,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140849690] [2024-10-11 04:15:31,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:31,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:31,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:31,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:15:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:31,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:15:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:31,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:15:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:31,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:15:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:31,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140849690] [2024-10-11 04:15:31,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140849690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:31,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:31,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696730960] [2024-10-11 04:15:31,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:31,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:31,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:31,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:31,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:31,299 INFO L87 Difference]: Start difference. First operand 12219 states and 20194 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:36,428 INFO L93 Difference]: Finished difference Result 42673 states and 69999 transitions. [2024-10-11 04:15:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:15:36,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:15:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:36,519 INFO L225 Difference]: With dead ends: 42673 [2024-10-11 04:15:36,519 INFO L226 Difference]: Without dead ends: 32592 [2024-10-11 04:15:36,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:15:36,545 INFO L432 NwaCegarLoop]: 4386 mSDtfsCounter, 5714 mSDsluCounter, 17251 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5744 SdHoareTripleChecker+Valid, 21637 SdHoareTripleChecker+Invalid, 3317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:36,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5744 Valid, 21637 Invalid, 3317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3253 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 04:15:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32592 states. [2024-10-11 04:15:38,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32592 to 22005. [2024-10-11 04:15:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22005 states, 20276 states have (on average 1.617330834484119) internal successors, (32793), 20342 states have internal predecessors, (32793), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 454 states have return successors, (2066), 1336 states have call predecessors, (2066), 1273 states have call successors, (2066) [2024-10-11 04:15:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22005 states to 22005 states and 36132 transitions. [2024-10-11 04:15:38,489 INFO L78 Accepts]: Start accepts. Automaton has 22005 states and 36132 transitions. Word has length 151 [2024-10-11 04:15:38,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:38,490 INFO L471 AbstractCegarLoop]: Abstraction has 22005 states and 36132 transitions. [2024-10-11 04:15:38,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 22005 states and 36132 transitions. [2024-10-11 04:15:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:15:38,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:38,505 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] [2024-10-11 04:15:38,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:15:38,506 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:38,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:38,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1098387755, now seen corresponding path program 1 times [2024-10-11 04:15:38,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:38,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361500026] [2024-10-11 04:15:38,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:38,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:38,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:38,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:15:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:38,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:15:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:38,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:15:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:38,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:15:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:38,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:38,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361500026] [2024-10-11 04:15:38,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361500026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:38,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:38,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:38,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184780500] [2024-10-11 04:15:38,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:38,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:38,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:38,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:38,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:38,743 INFO L87 Difference]: Start difference. First operand 22005 states and 36132 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:48,044 INFO L93 Difference]: Finished difference Result 81465 states and 133999 transitions. [2024-10-11 04:15:48,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:15:48,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:15:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:48,481 INFO L225 Difference]: With dead ends: 81465 [2024-10-11 04:15:48,481 INFO L226 Difference]: Without dead ends: 61598 [2024-10-11 04:15:48,603 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-11 04:15:48,604 INFO L432 NwaCegarLoop]: 4385 mSDtfsCounter, 5411 mSDsluCounter, 17248 mSDsCounter, 0 mSdLazyCounter, 3855 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5428 SdHoareTripleChecker+Valid, 21633 SdHoareTripleChecker+Invalid, 3918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:48,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5428 Valid, 21633 Invalid, 3918 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3855 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 04:15:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61598 states. [2024-10-11 04:15:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61598 to 41254. [2024-10-11 04:15:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41254 states, 37893 states have (on average 1.603119309635025) internal successors, (60747), 38023 states have internal predecessors, (60747), 2457 states have call successors, (2457), 774 states have call predecessors, (2457), 902 states have return successors, (4772), 2584 states have call predecessors, (4772), 2457 states have call successors, (4772) [2024-10-11 04:15:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41254 states to 41254 states and 67976 transitions. [2024-10-11 04:15:53,717 INFO L78 Accepts]: Start accepts. Automaton has 41254 states and 67976 transitions. Word has length 151 [2024-10-11 04:15:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:53,718 INFO L471 AbstractCegarLoop]: Abstraction has 41254 states and 67976 transitions. [2024-10-11 04:15:53,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-11 04:15:53,719 INFO L276 IsEmpty]: Start isEmpty. Operand 41254 states and 67976 transitions. [2024-10-11 04:15:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:15:53,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:53,746 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] [2024-10-11 04:15:53,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:15:53,747 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:53,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:53,747 INFO L85 PathProgramCache]: Analyzing trace with hash -744087959, now seen corresponding path program 1 times [2024-10-11 04:15:53,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:53,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186910110] [2024-10-11 04:15:53,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:53,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:53,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:15:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:54,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:15:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:54,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:15:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:54,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:15:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:54,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:54,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186910110] [2024-10-11 04:15:54,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186910110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:54,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:54,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:54,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496383769] [2024-10-11 04:15:54,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:54,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:54,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:54,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:54,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:54,050 INFO L87 Difference]: Start difference. First operand 41254 states and 67976 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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)