./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:26:11,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:26:11,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:26:11,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:26:11,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:26:11,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:26:11,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:26:11,783 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:26:11,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:26:11,784 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:26:11,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:26:11,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:26:11,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:26:11,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:26:11,788 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:26:11,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:26:11,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:26:11,789 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:26:11,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:26:11,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:26:11,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:26:11,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:26:11,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:26:11,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:26:11,791 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:26:11,791 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:26:11,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:26:11,792 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:26:11,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:26:11,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:26:11,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:26:11,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:26:11,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:26:11,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:26:11,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:26:11,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:26:11,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:26:11,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:26:11,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:26:11,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:26:11,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:26:11,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:26:11,795 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f [2024-10-14 03:26:12,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:26:12,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:26:12,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:26:12,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:26:12,112 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:26:12,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2024-10-14 03:26:13,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:26:13,760 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:26:13,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2024-10-14 03:26:13,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a83270ef3/1809660950fe45d6a42a80d8c1204995/FLAG2264329cf [2024-10-14 03:26:13,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a83270ef3/1809660950fe45d6a42a80d8c1204995 [2024-10-14 03:26:13,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:26:13,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:26:13,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:26:13,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:26:13,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:26:13,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:26:13" (1/1) ... [2024-10-14 03:26:13,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59e0dd4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:13, skipping insertion in model container [2024-10-14 03:26:13,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:26:13" (1/1) ... [2024-10-14 03:26:13,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:26:14,081 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c[14522,14535] [2024-10-14 03:26:14,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:26:14,095 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:26:14,156 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c[14522,14535] [2024-10-14 03:26:14,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:26:14,186 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:26:14,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14 WrapperNode [2024-10-14 03:26:14,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:26:14,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:26:14,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:26:14,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:26:14,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14" (1/1) ... [2024-10-14 03:26:14,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14" (1/1) ... [2024-10-14 03:26:14,263 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 502 [2024-10-14 03:26:14,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:26:14,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:26:14,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:26:14,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:26:14,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14" (1/1) ... [2024-10-14 03:26:14,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14" (1/1) ... [2024-10-14 03:26:14,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14" (1/1) ... [2024-10-14 03:26:14,305 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:26:14,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14" (1/1) ... [2024-10-14 03:26:14,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14" (1/1) ... [2024-10-14 03:26:14,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14" (1/1) ... [2024-10-14 03:26:14,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14" (1/1) ... [2024-10-14 03:26:14,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14" (1/1) ... [2024-10-14 03:26:14,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14" (1/1) ... [2024-10-14 03:26:14,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:26:14,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:26:14,342 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:26:14,342 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:26:14,343 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14" (1/1) ... [2024-10-14 03:26:14,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:26:14,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:26:14,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:26:14,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:26:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-14 03:26:14,437 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-14 03:26:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:26:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-14 03:26:14,438 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-14 03:26:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-14 03:26:14,438 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-14 03:26:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-10-14 03:26:14,440 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-10-14 03:26:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 03:26:14,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 03:26:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:26:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-14 03:26:14,440 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-14 03:26:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:26:14,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:26:14,441 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-14 03:26:14,441 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-14 03:26:14,570 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:26:14,572 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:26:15,204 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-10-14 03:26:15,205 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:26:15,270 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:26:15,270 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:26:15,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:26:15 BoogieIcfgContainer [2024-10-14 03:26:15,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:26:15,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:26:15,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:26:15,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:26:15,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:26:13" (1/3) ... [2024-10-14 03:26:15,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60126baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:26:15, skipping insertion in model container [2024-10-14 03:26:15,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:14" (2/3) ... [2024-10-14 03:26:15,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60126baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:26:15, skipping insertion in model container [2024-10-14 03:26:15,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:26:15" (3/3) ... [2024-10-14 03:26:15,280 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2024-10-14 03:26:15,296 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:26:15,296 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:26:15,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:26:15,382 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;@58839977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:26:15,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:26:15,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 128 states have (on average 1.59375) internal successors, (204), 130 states have internal predecessors, (204), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 03:26:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:26:15,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:15,397 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] [2024-10-14 03:26:15,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:15,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:15,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1512492118, now seen corresponding path program 1 times [2024-10-14 03:26:15,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:15,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229602538] [2024-10-14 03:26:15,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:15,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:26:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:26:15,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:15,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229602538] [2024-10-14 03:26:15,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229602538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:15,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:15,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:26:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043175049] [2024-10-14 03:26:15,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:15,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:26:15,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:15,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:26:15,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:26:15,753 INFO L87 Difference]: Start difference. First operand has 168 states, 128 states have (on average 1.59375) internal successors, (204), 130 states have internal predecessors, (204), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:26:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:15,827 INFO L93 Difference]: Finished difference Result 319 states and 532 transitions. [2024-10-14 03:26:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:26:15,830 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-14 03:26:15,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:15,839 INFO L225 Difference]: With dead ends: 319 [2024-10-14 03:26:15,839 INFO L226 Difference]: Without dead ends: 166 [2024-10-14 03:26:15,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:26:15,850 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:15,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:26:15,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-14 03:26:15,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-14 03:26:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 127 states have (on average 1.5669291338582678) internal successors, (199), 128 states have internal predecessors, (199), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 03:26:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 261 transitions. [2024-10-14 03:26:15,916 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 261 transitions. Word has length 23 [2024-10-14 03:26:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:15,916 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 261 transitions. [2024-10-14 03:26:15,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:26:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 261 transitions. [2024-10-14 03:26:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:26:15,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:15,920 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] [2024-10-14 03:26:15,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:26:15,922 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:15,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:15,923 INFO L85 PathProgramCache]: Analyzing trace with hash -481652588, now seen corresponding path program 1 times [2024-10-14 03:26:15,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:15,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717864763] [2024-10-14 03:26:15,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:26:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:26:16,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:16,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717864763] [2024-10-14 03:26:16,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717864763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:16,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:16,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:26:16,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795569312] [2024-10-14 03:26:16,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:16,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:26:16,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:16,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:26:16,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:26:16,282 INFO L87 Difference]: Start difference. First operand 166 states and 261 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:26:16,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:16,411 INFO L93 Difference]: Finished difference Result 319 states and 497 transitions. [2024-10-14 03:26:16,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:26:16,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-14 03:26:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:16,414 INFO L225 Difference]: With dead ends: 319 [2024-10-14 03:26:16,414 INFO L226 Difference]: Without dead ends: 166 [2024-10-14 03:26:16,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:26:16,416 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 0 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:16,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1240 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:26:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-14 03:26:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-14 03:26:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 127 states have (on average 1.4724409448818898) internal successors, (187), 128 states have internal predecessors, (187), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 03:26:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 249 transitions. [2024-10-14 03:26:16,435 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 249 transitions. Word has length 23 [2024-10-14 03:26:16,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:16,436 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 249 transitions. [2024-10-14 03:26:16,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:26:16,436 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 249 transitions. [2024-10-14 03:26:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 03:26:16,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:16,438 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] [2024-10-14 03:26:16,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:26:16,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:16,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:16,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1100101477, now seen corresponding path program 1 times [2024-10-14 03:26:16,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:16,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661030314] [2024-10-14 03:26:16,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:16,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:26:16,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:16,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661030314] [2024-10-14 03:26:16,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661030314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:16,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:16,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226433047] [2024-10-14 03:26:16,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:16,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:16,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:16,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:16,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:16,685 INFO L87 Difference]: Start difference. First operand 166 states and 249 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:26:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:16,765 INFO L93 Difference]: Finished difference Result 320 states and 489 transitions. [2024-10-14 03:26:16,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:16,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-10-14 03:26:16,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:16,767 INFO L225 Difference]: With dead ends: 320 [2024-10-14 03:26:16,768 INFO L226 Difference]: Without dead ends: 170 [2024-10-14 03:26:16,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:16,770 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 3 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:16,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 704 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:26:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-14 03:26:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-10-14 03:26:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 03:26:16,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 252 transitions. [2024-10-14 03:26:16,799 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 252 transitions. Word has length 34 [2024-10-14 03:26:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:16,799 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 252 transitions. [2024-10-14 03:26:16,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:26:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 252 transitions. [2024-10-14 03:26:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 03:26:16,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:16,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:16,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:26:16,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:16,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1247131196, now seen corresponding path program 1 times [2024-10-14 03:26:16,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:16,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565166444] [2024-10-14 03:26:16,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:16,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:26:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:26:16,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:16,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565166444] [2024-10-14 03:26:16,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565166444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:16,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:16,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:26:16,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638330043] [2024-10-14 03:26:16,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:16,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:26:16,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:16,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:26:16,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:26:16,944 INFO L87 Difference]: Start difference. First operand 170 states and 252 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:26:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:17,013 INFO L93 Difference]: Finished difference Result 467 states and 702 transitions. [2024-10-14 03:26:17,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:26:17,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2024-10-14 03:26:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:17,018 INFO L225 Difference]: With dead ends: 467 [2024-10-14 03:26:17,018 INFO L226 Difference]: Without dead ends: 313 [2024-10-14 03:26:17,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:26:17,021 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 205 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:17,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 487 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:26:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-14 03:26:17,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2024-10-14 03:26:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 233 states have (on average 1.4763948497854078) internal successors, (344), 235 states have internal predecessors, (344), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 03:26:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 464 transitions. [2024-10-14 03:26:17,067 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 464 transitions. Word has length 48 [2024-10-14 03:26:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:17,069 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 464 transitions. [2024-10-14 03:26:17,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:26:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 464 transitions. [2024-10-14 03:26:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:26:17,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:17,072 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:17,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:26:17,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:17,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1143351104, now seen corresponding path program 1 times [2024-10-14 03:26:17,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:17,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028787443] [2024-10-14 03:26:17,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:17,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:26:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:26:17,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:17,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028787443] [2024-10-14 03:26:17,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028787443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:17,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:17,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:26:17,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11574426] [2024-10-14 03:26:17,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:17,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:26:17,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:17,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:26:17,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:26:17,169 INFO L87 Difference]: Start difference. First operand 310 states and 464 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:26:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:17,260 INFO L93 Difference]: Finished difference Result 874 states and 1318 transitions. [2024-10-14 03:26:17,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:26:17,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-14 03:26:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:17,267 INFO L225 Difference]: With dead ends: 874 [2024-10-14 03:26:17,268 INFO L226 Difference]: Without dead ends: 580 [2024-10-14 03:26:17,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:26:17,270 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 206 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:17,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 507 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:26:17,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-14 03:26:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 574. [2024-10-14 03:26:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 425 states have (on average 1.484705882352941) internal successors, (631), 429 states have internal predecessors, (631), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-14 03:26:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 865 transitions. [2024-10-14 03:26:17,331 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 865 transitions. Word has length 49 [2024-10-14 03:26:17,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:17,333 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 865 transitions. [2024-10-14 03:26:17,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:26:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 865 transitions. [2024-10-14 03:26:17,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:26:17,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:17,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:17,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:26:17,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:17,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash -136512574, now seen corresponding path program 1 times [2024-10-14 03:26:17,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:17,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46076294] [2024-10-14 03:26:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:26:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:26:17,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:17,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46076294] [2024-10-14 03:26:17,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46076294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:17,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:17,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:26:17,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175663822] [2024-10-14 03:26:17,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:17,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:26:17,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:17,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:26:17,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:17,502 INFO L87 Difference]: Start difference. First operand 574 states and 865 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:26:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:17,690 INFO L93 Difference]: Finished difference Result 1217 states and 1834 transitions. [2024-10-14 03:26:17,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:26:17,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-14 03:26:17,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:17,695 INFO L225 Difference]: With dead ends: 1217 [2024-10-14 03:26:17,696 INFO L226 Difference]: Without dead ends: 659 [2024-10-14 03:26:17,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:17,700 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 334 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:17,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 641 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:26:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-10-14 03:26:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 655. [2024-10-14 03:26:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 493 states have (on average 1.4726166328600405) internal successors, (726), 496 states have internal predecessors, (726), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-14 03:26:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 974 transitions. [2024-10-14 03:26:17,762 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 974 transitions. Word has length 49 [2024-10-14 03:26:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:17,763 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 974 transitions. [2024-10-14 03:26:17,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:26:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 974 transitions. [2024-10-14 03:26:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 03:26:17,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:17,769 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:17,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:26:17,770 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:17,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:17,770 INFO L85 PathProgramCache]: Analyzing trace with hash 299113361, now seen corresponding path program 1 times [2024-10-14 03:26:17,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:17,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316506439] [2024-10-14 03:26:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:17,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:26:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:26:17,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316506439] [2024-10-14 03:26:17,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316506439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:17,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:17,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:26:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614005645] [2024-10-14 03:26:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:17,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:26:17,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:17,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:26:17,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:17,896 INFO L87 Difference]: Start difference. First operand 655 states and 974 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:26:18,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:18,100 INFO L93 Difference]: Finished difference Result 1217 states and 1826 transitions. [2024-10-14 03:26:18,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:26:18,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2024-10-14 03:26:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:18,106 INFO L225 Difference]: With dead ends: 1217 [2024-10-14 03:26:18,106 INFO L226 Difference]: Without dead ends: 659 [2024-10-14 03:26:18,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:18,111 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 331 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:18,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 644 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:26:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-10-14 03:26:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 655. [2024-10-14 03:26:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 493 states have (on average 1.4645030425963488) internal successors, (722), 496 states have internal predecessors, (722), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-14 03:26:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 970 transitions. [2024-10-14 03:26:18,165 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 970 transitions. Word has length 50 [2024-10-14 03:26:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:18,166 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 970 transitions. [2024-10-14 03:26:18,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:26:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 970 transitions. [2024-10-14 03:26:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:26:18,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:18,168 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:18,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:26:18,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:18,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash 841576757, now seen corresponding path program 1 times [2024-10-14 03:26:18,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:18,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042377967] [2024-10-14 03:26:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:18,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:26:18,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:18,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042377967] [2024-10-14 03:26:18,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042377967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:18,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:18,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:18,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664334670] [2024-10-14 03:26:18,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:18,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:18,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:18,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:18,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:18,389 INFO L87 Difference]: Start difference. First operand 655 states and 970 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 03:26:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:18,501 INFO L93 Difference]: Finished difference Result 1233 states and 1846 transitions. [2024-10-14 03:26:18,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:18,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-10-14 03:26:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:18,506 INFO L225 Difference]: With dead ends: 1233 [2024-10-14 03:26:18,507 INFO L226 Difference]: Without dead ends: 675 [2024-10-14 03:26:18,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:18,509 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 4 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:18,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 716 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:26:18,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-14 03:26:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2024-10-14 03:26:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 509 states have (on average 1.449901768172888) internal successors, (738), 512 states have internal predecessors, (738), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-14 03:26:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 986 transitions. [2024-10-14 03:26:18,561 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 986 transitions. Word has length 51 [2024-10-14 03:26:18,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:18,561 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 986 transitions. [2024-10-14 03:26:18,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 03:26:18,562 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 986 transitions. [2024-10-14 03:26:18,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:26:18,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:18,563 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:18,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:26:18,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:18,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash 741280384, now seen corresponding path program 1 times [2024-10-14 03:26:18,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:18,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031127125] [2024-10-14 03:26:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:18,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:26:18,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:18,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031127125] [2024-10-14 03:26:18,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031127125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:18,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:18,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:18,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086777831] [2024-10-14 03:26:18,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:18,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:18,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:18,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:18,750 INFO L87 Difference]: Start difference. First operand 675 states and 986 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 03:26:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:18,860 INFO L93 Difference]: Finished difference Result 1273 states and 1890 transitions. [2024-10-14 03:26:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:18,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 59 [2024-10-14 03:26:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:18,867 INFO L225 Difference]: With dead ends: 1273 [2024-10-14 03:26:18,867 INFO L226 Difference]: Without dead ends: 695 [2024-10-14 03:26:18,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:18,872 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 4 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:18,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 702 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:26:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-10-14 03:26:18,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2024-10-14 03:26:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 525 states have (on average 1.4361904761904762) internal successors, (754), 528 states have internal predecessors, (754), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-14 03:26:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1002 transitions. [2024-10-14 03:26:18,971 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1002 transitions. Word has length 59 [2024-10-14 03:26:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:18,972 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1002 transitions. [2024-10-14 03:26:18,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 03:26:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1002 transitions. [2024-10-14 03:26:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:26:18,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:18,974 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:18,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:26:18,975 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:18,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1956794188, now seen corresponding path program 1 times [2024-10-14 03:26:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:18,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783314863] [2024-10-14 03:26:18,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:18,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:26:19,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783314863] [2024-10-14 03:26:19,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783314863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:19,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:19,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:19,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534670261] [2024-10-14 03:26:19,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:19,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:19,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:19,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:19,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:19,163 INFO L87 Difference]: Start difference. First operand 695 states and 1002 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 03:26:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:19,261 INFO L93 Difference]: Finished difference Result 1313 states and 1922 transitions. [2024-10-14 03:26:19,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:19,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-10-14 03:26:19,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:19,267 INFO L225 Difference]: With dead ends: 1313 [2024-10-14 03:26:19,267 INFO L226 Difference]: Without dead ends: 715 [2024-10-14 03:26:19,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:19,270 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 4 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:19,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 702 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:26:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-14 03:26:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-14 03:26:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 541 states have (on average 1.423290203327172) internal successors, (770), 544 states have internal predecessors, (770), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-14 03:26:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1018 transitions. [2024-10-14 03:26:19,339 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1018 transitions. Word has length 67 [2024-10-14 03:26:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:19,340 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1018 transitions. [2024-10-14 03:26:19,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 03:26:19,340 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1018 transitions. [2024-10-14 03:26:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:26:19,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:19,342 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:19,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:26:19,342 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:19,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:19,343 INFO L85 PathProgramCache]: Analyzing trace with hash -439665115, now seen corresponding path program 1 times [2024-10-14 03:26:19,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:19,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855318697] [2024-10-14 03:26:19,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:26:19,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:19,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855318697] [2024-10-14 03:26:19,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855318697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:19,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:19,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:19,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064814352] [2024-10-14 03:26:19,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:19,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:19,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:19,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:19,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:19,503 INFO L87 Difference]: Start difference. First operand 715 states and 1018 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 03:26:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:19,601 INFO L93 Difference]: Finished difference Result 1349 states and 1938 transitions. [2024-10-14 03:26:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:19,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-10-14 03:26:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:19,607 INFO L225 Difference]: With dead ends: 1349 [2024-10-14 03:26:19,608 INFO L226 Difference]: Without dead ends: 731 [2024-10-14 03:26:19,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:19,611 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 3 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:19,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 712 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:26:19,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-14 03:26:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2024-10-14 03:26:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 553 states have (on average 1.4141048824593128) internal successors, (782), 556 states have internal predecessors, (782), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-14 03:26:19,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1030 transitions. [2024-10-14 03:26:19,660 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1030 transitions. Word has length 67 [2024-10-14 03:26:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:19,660 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1030 transitions. [2024-10-14 03:26:19,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 03:26:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1030 transitions. [2024-10-14 03:26:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:26:19,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:19,663 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:19,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:26:19,663 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:19,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:19,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1540720212, now seen corresponding path program 1 times [2024-10-14 03:26:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:19,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174031635] [2024-10-14 03:26:19,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:26:19,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:19,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174031635] [2024-10-14 03:26:19,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174031635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:19,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:19,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:19,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210161422] [2024-10-14 03:26:19,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:19,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:19,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:19,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:19,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:19,867 INFO L87 Difference]: Start difference. First operand 731 states and 1030 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 03:26:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:19,955 INFO L93 Difference]: Finished difference Result 1389 states and 1974 transitions. [2024-10-14 03:26:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:19,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 75 [2024-10-14 03:26:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:19,961 INFO L225 Difference]: With dead ends: 1389 [2024-10-14 03:26:19,961 INFO L226 Difference]: Without dead ends: 755 [2024-10-14 03:26:19,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:19,964 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 5 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:19,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 714 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:26:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-10-14 03:26:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2024-10-14 03:26:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 573 states have (on average 1.399650959860384) internal successors, (802), 576 states have internal predecessors, (802), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-14 03:26:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1050 transitions. [2024-10-14 03:26:20,015 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1050 transitions. Word has length 75 [2024-10-14 03:26:20,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:20,015 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1050 transitions. [2024-10-14 03:26:20,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 03:26:20,016 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1050 transitions. [2024-10-14 03:26:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:26:20,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:20,018 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:20,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:26:20,018 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:20,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:20,019 INFO L85 PathProgramCache]: Analyzing trace with hash -224114551, now seen corresponding path program 1 times [2024-10-14 03:26:20,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:20,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360162855] [2024-10-14 03:26:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:20,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:26:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:26:20,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:20,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360162855] [2024-10-14 03:26:20,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360162855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:20,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:20,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:26:20,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039988291] [2024-10-14 03:26:20,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:20,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:26:20,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:20,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:26:20,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:20,643 INFO L87 Difference]: Start difference. First operand 755 states and 1050 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 03:26:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:20,981 INFO L93 Difference]: Finished difference Result 1971 states and 2725 transitions. [2024-10-14 03:26:20,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:26:20,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 78 [2024-10-14 03:26:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:20,989 INFO L225 Difference]: With dead ends: 1971 [2024-10-14 03:26:20,989 INFO L226 Difference]: Without dead ends: 1313 [2024-10-14 03:26:20,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:26:20,992 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 204 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:20,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1355 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:26:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2024-10-14 03:26:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1031. [2024-10-14 03:26:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 776 states have (on average 1.3865979381443299) internal successors, (1076), 781 states have internal predecessors, (1076), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-14 03:26:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1420 transitions. [2024-10-14 03:26:21,078 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1420 transitions. Word has length 78 [2024-10-14 03:26:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:21,078 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1420 transitions. [2024-10-14 03:26:21,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 03:26:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1420 transitions. [2024-10-14 03:26:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:26:21,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:21,080 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:21,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:26:21,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:21,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1653300379, now seen corresponding path program 1 times [2024-10-14 03:26:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:21,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060895447] [2024-10-14 03:26:21,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:21,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:26:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-14 03:26:21,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:21,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060895447] [2024-10-14 03:26:21,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060895447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:21,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:21,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:26:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692405782] [2024-10-14 03:26:21,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:21,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:26:21,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:21,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:26:21,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:26:21,378 INFO L87 Difference]: Start difference. First operand 1031 states and 1420 transitions. Second operand has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:26:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:21,637 INFO L93 Difference]: Finished difference Result 1437 states and 2078 transitions. [2024-10-14 03:26:21,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:26:21,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 81 [2024-10-14 03:26:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:21,645 INFO L225 Difference]: With dead ends: 1437 [2024-10-14 03:26:21,646 INFO L226 Difference]: Without dead ends: 1435 [2024-10-14 03:26:21,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:26:21,647 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 251 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:21,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 2438 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:26:21,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2024-10-14 03:26:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1039. [2024-10-14 03:26:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 780 states have (on average 1.3846153846153846) internal successors, (1080), 787 states have internal predecessors, (1080), 174 states have call successors, (174), 84 states have call predecessors, (174), 84 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-14 03:26:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1428 transitions. [2024-10-14 03:26:21,757 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1428 transitions. Word has length 81 [2024-10-14 03:26:21,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:21,757 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1428 transitions. [2024-10-14 03:26:21,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:26:21,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1428 transitions. [2024-10-14 03:26:21,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:26:21,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:21,759 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:21,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:26:21,759 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:21,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:21,760 INFO L85 PathProgramCache]: Analyzing trace with hash 761700715, now seen corresponding path program 1 times [2024-10-14 03:26:21,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:21,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104223199] [2024-10-14 03:26:21,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:21,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 03:26:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:26:21,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:21,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104223199] [2024-10-14 03:26:21,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104223199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:21,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:21,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:21,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957605357] [2024-10-14 03:26:21,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:21,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:21,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:21,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:21,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:21,955 INFO L87 Difference]: Start difference. First operand 1039 states and 1428 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 03:26:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:22,078 INFO L93 Difference]: Finished difference Result 1945 states and 2690 transitions. [2024-10-14 03:26:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 82 [2024-10-14 03:26:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:22,085 INFO L225 Difference]: With dead ends: 1945 [2024-10-14 03:26:22,085 INFO L226 Difference]: Without dead ends: 1063 [2024-10-14 03:26:22,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:22,088 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 3 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:22,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 712 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:26:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2024-10-14 03:26:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1063. [2024-10-14 03:26:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 798 states have (on average 1.3759398496240602) internal successors, (1098), 805 states have internal predecessors, (1098), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-14 03:26:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1446 transitions. [2024-10-14 03:26:22,185 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1446 transitions. Word has length 82 [2024-10-14 03:26:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:22,185 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1446 transitions. [2024-10-14 03:26:22,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 03:26:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1446 transitions. [2024-10-14 03:26:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 03:26:22,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:22,188 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:22,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:26:22,188 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:22,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1195123752, now seen corresponding path program 1 times [2024-10-14 03:26:22,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:22,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124179594] [2024-10-14 03:26:22,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:22,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:26:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:26:22,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:22,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124179594] [2024-10-14 03:26:22,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124179594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:22,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:22,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:26:22,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675778731] [2024-10-14 03:26:22,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:22,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:26:22,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:22,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:26:22,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:22,386 INFO L87 Difference]: Start difference. First operand 1063 states and 1446 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:26:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:22,608 INFO L93 Difference]: Finished difference Result 1913 states and 2605 transitions. [2024-10-14 03:26:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:26:22,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 84 [2024-10-14 03:26:22,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:22,615 INFO L225 Difference]: With dead ends: 1913 [2024-10-14 03:26:22,615 INFO L226 Difference]: Without dead ends: 1089 [2024-10-14 03:26:22,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:26:22,617 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 238 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:22,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1397 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:26:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2024-10-14 03:26:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1055. [2024-10-14 03:26:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 801 states have (on average 1.3707865168539326) internal successors, (1098), 813 states have internal predecessors, (1098), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2024-10-14 03:26:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1422 transitions. [2024-10-14 03:26:22,709 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1422 transitions. Word has length 84 [2024-10-14 03:26:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:22,710 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1422 transitions. [2024-10-14 03:26:22,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:26:22,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1422 transitions. [2024-10-14 03:26:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 03:26:22,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:22,712 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:22,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:26:22,712 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:22,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:22,713 INFO L85 PathProgramCache]: Analyzing trace with hash -496735025, now seen corresponding path program 1 times [2024-10-14 03:26:22,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:22,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420597195] [2024-10-14 03:26:22,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:22,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:26:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 03:26:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-14 03:26:23,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:23,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420597195] [2024-10-14 03:26:23,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420597195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:23,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:23,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:26:23,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338660742] [2024-10-14 03:26:23,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:23,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:26:23,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:23,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:26:23,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:23,298 INFO L87 Difference]: Start difference. First operand 1055 states and 1422 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 03:26:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:23,552 INFO L93 Difference]: Finished difference Result 1887 states and 2551 transitions. [2024-10-14 03:26:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:26:23,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2024-10-14 03:26:23,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:23,559 INFO L225 Difference]: With dead ends: 1887 [2024-10-14 03:26:23,559 INFO L226 Difference]: Without dead ends: 1051 [2024-10-14 03:26:23,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:26:23,561 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 145 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:23,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1489 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:26:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-14 03:26:23,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 948. [2024-10-14 03:26:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 721 states have (on average 1.374479889042996) internal successors, (991), 731 states have internal predecessors, (991), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2024-10-14 03:26:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1281 transitions. [2024-10-14 03:26:23,667 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1281 transitions. Word has length 86 [2024-10-14 03:26:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:23,667 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1281 transitions. [2024-10-14 03:26:23,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 03:26:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1281 transitions. [2024-10-14 03:26:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 03:26:23,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:23,669 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:23,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:26:23,669 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:23,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:23,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1997716092, now seen corresponding path program 1 times [2024-10-14 03:26:23,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:23,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455943469] [2024-10-14 03:26:23,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:23,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 03:26:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 03:26:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 03:26:24,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455943469] [2024-10-14 03:26:24,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455943469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:24,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:24,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:26:24,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288676582] [2024-10-14 03:26:24,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:24,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:26:24,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:24,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:26:24,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:26:24,169 INFO L87 Difference]: Start difference. First operand 948 states and 1281 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 03:26:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:24,739 INFO L93 Difference]: Finished difference Result 1819 states and 2439 transitions. [2024-10-14 03:26:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:26:24,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 87 [2024-10-14 03:26:24,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:24,749 INFO L225 Difference]: With dead ends: 1819 [2024-10-14 03:26:24,749 INFO L226 Difference]: Without dead ends: 1009 [2024-10-14 03:26:24,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:26:24,752 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 516 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:24,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1315 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:26:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-10-14 03:26:24,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 964. [2024-10-14 03:26:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 729 states have (on average 1.3497942386831276) internal successors, (984), 740 states have internal predecessors, (984), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-14 03:26:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1280 transitions. [2024-10-14 03:26:24,851 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1280 transitions. Word has length 87 [2024-10-14 03:26:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:24,852 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1280 transitions. [2024-10-14 03:26:24,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 03:26:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1280 transitions. [2024-10-14 03:26:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 03:26:24,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:24,853 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:24,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:26:24,854 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:24,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:24,854 INFO L85 PathProgramCache]: Analyzing trace with hash 321058749, now seen corresponding path program 1 times [2024-10-14 03:26:24,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:24,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916588061] [2024-10-14 03:26:24,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:24,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:26:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 03:26:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 03:26:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 03:26:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:26:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:26:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 03:26:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:26:24,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:24,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916588061] [2024-10-14 03:26:24,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916588061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:24,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:24,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:24,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296345312] [2024-10-14 03:26:24,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:24,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:24,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:24,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:24,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:24,980 INFO L87 Difference]: Start difference. First operand 964 states and 1280 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:25,220 INFO L93 Difference]: Finished difference Result 2565 states and 3422 transitions. [2024-10-14 03:26:25,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:26:25,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 88 [2024-10-14 03:26:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:25,230 INFO L225 Difference]: With dead ends: 2565 [2024-10-14 03:26:25,230 INFO L226 Difference]: Without dead ends: 1790 [2024-10-14 03:26:25,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:25,233 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 195 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:25,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1076 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:26:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2024-10-14 03:26:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1683. [2024-10-14 03:26:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1258 states have (on average 1.3394276629570747) internal successors, (1685), 1277 states have internal predecessors, (1685), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2024-10-14 03:26:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2229 transitions. [2024-10-14 03:26:25,409 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2229 transitions. Word has length 88 [2024-10-14 03:26:25,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:25,409 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2229 transitions. [2024-10-14 03:26:25,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2229 transitions. [2024-10-14 03:26:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:26:25,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:25,411 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:25,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:26:25,411 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:25,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:25,412 INFO L85 PathProgramCache]: Analyzing trace with hash -61134094, now seen corresponding path program 1 times [2024-10-14 03:26:25,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:25,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290956217] [2024-10-14 03:26:25,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:25,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:26:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 03:26:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 03:26:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 03:26:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:26:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:26:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 03:26:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 03:26:25,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:25,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290956217] [2024-10-14 03:26:25,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290956217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:25,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:25,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:26:25,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288807852] [2024-10-14 03:26:25,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:25,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:26:25,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:25,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:26:25,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:25,906 INFO L87 Difference]: Start difference. First operand 1683 states and 2229 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:26,593 INFO L93 Difference]: Finished difference Result 3297 states and 4357 transitions. [2024-10-14 03:26:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:26:26,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2024-10-14 03:26:26,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:26,604 INFO L225 Difference]: With dead ends: 3297 [2024-10-14 03:26:26,604 INFO L226 Difference]: Without dead ends: 1875 [2024-10-14 03:26:26,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:26:26,608 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 469 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:26,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1331 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:26:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2024-10-14 03:26:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1712. [2024-10-14 03:26:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1274 states have (on average 1.3320251177394034) internal successors, (1697), 1294 states have internal predecessors, (1697), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2024-10-14 03:26:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2257 transitions. [2024-10-14 03:26:26,828 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2257 transitions. Word has length 90 [2024-10-14 03:26:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:26,829 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 2257 transitions. [2024-10-14 03:26:26,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2257 transitions. [2024-10-14 03:26:26,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:26:26,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:26,831 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:26,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:26:26,831 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:26,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:26,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1601327255, now seen corresponding path program 1 times [2024-10-14 03:26:26,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:26,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829001267] [2024-10-14 03:26:26,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:26,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:26:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 03:26:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:26:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 03:26:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:26:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:26:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:26:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:26:26,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:26,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829001267] [2024-10-14 03:26:26,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829001267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:26,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:26,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:26,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025218887] [2024-10-14 03:26:26,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:26,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:26,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:26,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:26,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:26,947 INFO L87 Difference]: Start difference. First operand 1712 states and 2257 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:27,332 INFO L93 Difference]: Finished difference Result 4366 states and 5785 transitions. [2024-10-14 03:26:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:26:27,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2024-10-14 03:26:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:27,347 INFO L225 Difference]: With dead ends: 4366 [2024-10-14 03:26:27,347 INFO L226 Difference]: Without dead ends: 2960 [2024-10-14 03:26:27,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:27,352 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 200 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:27,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1112 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:26:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2024-10-14 03:26:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 2713. [2024-10-14 03:26:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2713 states, 2000 states have (on average 1.319) internal successors, (2638), 2031 states have internal predecessors, (2638), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2024-10-14 03:26:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 3558 transitions. [2024-10-14 03:26:27,705 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 3558 transitions. Word has length 92 [2024-10-14 03:26:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:27,705 INFO L471 AbstractCegarLoop]: Abstraction has 2713 states and 3558 transitions. [2024-10-14 03:26:27,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3558 transitions. [2024-10-14 03:26:27,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:26:27,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:27,708 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:27,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:26:27,709 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:27,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:27,709 INFO L85 PathProgramCache]: Analyzing trace with hash -454143171, now seen corresponding path program 1 times [2024-10-14 03:26:27,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:27,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707894460] [2024-10-14 03:26:27,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:27,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:27,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:27,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:26:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:27,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:27,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:26:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:27,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 03:26:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:27,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 03:26:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:27,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 03:26:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:27,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 03:26:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:26:27,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:27,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707894460] [2024-10-14 03:26:27,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707894460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:27,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:27,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:27,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119166603] [2024-10-14 03:26:27,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:27,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:27,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:27,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:27,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:27,835 INFO L87 Difference]: Start difference. First operand 2713 states and 3558 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:28,337 INFO L93 Difference]: Finished difference Result 6366 states and 8382 transitions. [2024-10-14 03:26:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:26:28,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2024-10-14 03:26:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:28,370 INFO L225 Difference]: With dead ends: 6366 [2024-10-14 03:26:28,371 INFO L226 Difference]: Without dead ends: 4071 [2024-10-14 03:26:28,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:28,379 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 194 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:28,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1126 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:26:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2024-10-14 03:26:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 3900. [2024-10-14 03:26:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3900 states, 2863 states have (on average 1.3143555710792874) internal successors, (3763), 2907 states have internal predecessors, (3763), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-14 03:26:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 5107 transitions. [2024-10-14 03:26:28,995 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 5107 transitions. Word has length 92 [2024-10-14 03:26:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:28,996 INFO L471 AbstractCegarLoop]: Abstraction has 3900 states and 5107 transitions. [2024-10-14 03:26:28,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 5107 transitions. [2024-10-14 03:26:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:26:28,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:28,998 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:28,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:26:28,999 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:28,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:28,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1702199078, now seen corresponding path program 1 times [2024-10-14 03:26:28,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:29,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972256133] [2024-10-14 03:26:29,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:29,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:26:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 03:26:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 03:26:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:26:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 03:26:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:26:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:26:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:26:29,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:29,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972256133] [2024-10-14 03:26:29,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972256133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:29,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:29,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:26:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658906472] [2024-10-14 03:26:29,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:29,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:26:29,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:29,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:26:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:26:29,065 INFO L87 Difference]: Start difference. First operand 3900 states and 5107 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:29,524 INFO L93 Difference]: Finished difference Result 7513 states and 9879 transitions. [2024-10-14 03:26:29,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:26:29,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2024-10-14 03:26:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:29,554 INFO L225 Difference]: With dead ends: 7513 [2024-10-14 03:26:29,557 INFO L226 Difference]: Without dead ends: 3933 [2024-10-14 03:26:29,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:26:29,568 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 6 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:29,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 460 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:26:29,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3933 states. [2024-10-14 03:26:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3933 to 3906. [2024-10-14 03:26:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3906 states, 2869 states have (on average 1.3136981526664342) internal successors, (3769), 2913 states have internal predecessors, (3769), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-14 03:26:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 5113 transitions. [2024-10-14 03:26:29,985 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 5113 transitions. Word has length 93 [2024-10-14 03:26:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:29,985 INFO L471 AbstractCegarLoop]: Abstraction has 3906 states and 5113 transitions. [2024-10-14 03:26:29,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 5113 transitions. [2024-10-14 03:26:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 03:26:29,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:29,988 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:29,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 03:26:29,989 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:29,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash -607814792, now seen corresponding path program 1 times [2024-10-14 03:26:29,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:29,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516540037] [2024-10-14 03:26:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:29,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:30,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:30,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:26:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:30,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:30,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:26:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:30,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 03:26:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:30,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 03:26:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:30,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 03:26:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:30,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 03:26:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:26:30,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:30,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516540037] [2024-10-14 03:26:30,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516540037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:30,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:30,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780801476] [2024-10-14 03:26:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:30,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:30,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:30,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:30,164 INFO L87 Difference]: Start difference. First operand 3906 states and 5113 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:30,540 INFO L93 Difference]: Finished difference Result 7479 states and 9807 transitions. [2024-10-14 03:26:30,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:30,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-10-14 03:26:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:30,576 INFO L225 Difference]: With dead ends: 7479 [2024-10-14 03:26:30,576 INFO L226 Difference]: Without dead ends: 3635 [2024-10-14 03:26:30,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:30,589 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 74 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:30,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 695 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:26:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2024-10-14 03:26:30,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3572. [2024-10-14 03:26:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3572 states, 2618 states have (on average 1.322383498854087) internal successors, (3462), 2652 states have internal predecessors, (3462), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-14 03:26:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 4702 transitions. [2024-10-14 03:26:30,997 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 4702 transitions. Word has length 94 [2024-10-14 03:26:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:30,997 INFO L471 AbstractCegarLoop]: Abstraction has 3572 states and 4702 transitions. [2024-10-14 03:26:30,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4702 transitions. [2024-10-14 03:26:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 03:26:30,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:31,000 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:31,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 03:26:31,000 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:31,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:31,001 INFO L85 PathProgramCache]: Analyzing trace with hash 36212784, now seen corresponding path program 1 times [2024-10-14 03:26:31,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:31,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921159497] [2024-10-14 03:26:31,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:31,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:26:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 03:26:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 03:26:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:26:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 03:26:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:26:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:26:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:26:31,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:31,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921159497] [2024-10-14 03:26:31,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921159497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:31,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:31,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:26:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043621186] [2024-10-14 03:26:31,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:31,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:26:31,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:31,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:26:31,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:26:31,078 INFO L87 Difference]: Start difference. First operand 3572 states and 4702 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:31,460 INFO L93 Difference]: Finished difference Result 7032 states and 9292 transitions. [2024-10-14 03:26:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:26:31,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2024-10-14 03:26:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:31,478 INFO L225 Difference]: With dead ends: 7032 [2024-10-14 03:26:31,479 INFO L226 Difference]: Without dead ends: 3623 [2024-10-14 03:26:31,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:26:31,489 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 6 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:31,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 460 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:26:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2024-10-14 03:26:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3582. [2024-10-14 03:26:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3582 states, 2628 states have (on average 1.3211567732115677) internal successors, (3472), 2662 states have internal predecessors, (3472), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-14 03:26:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 4712 transitions. [2024-10-14 03:26:32,019 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 4712 transitions. Word has length 95 [2024-10-14 03:26:32,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:32,020 INFO L471 AbstractCegarLoop]: Abstraction has 3582 states and 4712 transitions. [2024-10-14 03:26:32,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 4712 transitions. [2024-10-14 03:26:32,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 03:26:32,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:32,022 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:32,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 03:26:32,023 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:32,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:32,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1078802283, now seen corresponding path program 1 times [2024-10-14 03:26:32,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:32,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720419883] [2024-10-14 03:26:32,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:32,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:32,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:32,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:26:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:32,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 03:26:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:32,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 03:26:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:32,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:26:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:32,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 03:26:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:26:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:32,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:26:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:26:32,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:32,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720419883] [2024-10-14 03:26:32,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720419883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:32,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:32,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:32,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714900827] [2024-10-14 03:26:32,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:32,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:32,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:32,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:32,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:32,200 INFO L87 Difference]: Start difference. First operand 3582 states and 4712 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:32,615 INFO L93 Difference]: Finished difference Result 6982 states and 9202 transitions. [2024-10-14 03:26:32,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:32,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2024-10-14 03:26:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:32,633 INFO L225 Difference]: With dead ends: 6982 [2024-10-14 03:26:32,633 INFO L226 Difference]: Without dead ends: 3505 [2024-10-14 03:26:32,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:32,642 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 56 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:32,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 700 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:26:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2024-10-14 03:26:32,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 2697. [2024-10-14 03:26:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 1977 states have (on average 1.3131006575619626) internal successors, (2596), 1996 states have internal predecessors, (2596), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2024-10-14 03:26:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3534 transitions. [2024-10-14 03:26:32,961 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3534 transitions. Word has length 95 [2024-10-14 03:26:32,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:32,961 INFO L471 AbstractCegarLoop]: Abstraction has 2697 states and 3534 transitions. [2024-10-14 03:26:32,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:26:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3534 transitions. [2024-10-14 03:26:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 03:26:32,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:32,966 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:32,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 03:26:32,966 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:32,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:32,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1226463043, now seen corresponding path program 1 times [2024-10-14 03:26:32,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:32,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548293022] [2024-10-14 03:26:32,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:32,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:26:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:26:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:26:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:26:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 03:26:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 03:26:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 03:26:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 03:26:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-14 03:26:33,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:33,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548293022] [2024-10-14 03:26:33,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548293022] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:26:33,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366554260] [2024-10-14 03:26:33,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:33,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:26:33,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:26:33,353 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:26:33,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:26:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:33,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 03:26:33,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:26:33,900 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:26:33,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:26:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-14 03:26:34,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366554260] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:26:34,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:26:34,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 22 [2024-10-14 03:26:34,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292062188] [2024-10-14 03:26:34,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:26:34,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 03:26:34,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:34,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 03:26:34,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-14 03:26:34,208 INFO L87 Difference]: Start difference. First operand 2697 states and 3534 transitions. Second operand has 22 states, 22 states have (on average 9.772727272727273) internal successors, (215), 20 states have internal predecessors, (215), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-14 03:26:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:38,801 INFO L93 Difference]: Finished difference Result 11254 states and 14679 transitions. [2024-10-14 03:26:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-14 03:26:38,802 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.772727272727273) internal successors, (215), 20 states have internal predecessors, (215), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) Word has length 138 [2024-10-14 03:26:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:38,838 INFO L225 Difference]: With dead ends: 11254 [2024-10-14 03:26:38,838 INFO L226 Difference]: Without dead ends: 8759 [2024-10-14 03:26:38,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1846 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1180, Invalid=5300, Unknown=0, NotChecked=0, Total=6480 [2024-10-14 03:26:38,850 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 4906 mSDsluCounter, 3352 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 1939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4906 SdHoareTripleChecker+Valid, 3691 SdHoareTripleChecker+Invalid, 3633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1939 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:38,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4906 Valid, 3691 Invalid, 3633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1939 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 03:26:38,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8759 states. [2024-10-14 03:26:39,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8759 to 7287. [2024-10-14 03:26:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7287 states, 5330 states have (on average 1.302063789868668) internal successors, (6940), 5382 states have internal predecessors, (6940), 1259 states have call successors, (1259), 697 states have call predecessors, (1259), 697 states have return successors, (1259), 1207 states have call predecessors, (1259), 1259 states have call successors, (1259) [2024-10-14 03:26:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7287 states to 7287 states and 9458 transitions. [2024-10-14 03:26:40,051 INFO L78 Accepts]: Start accepts. Automaton has 7287 states and 9458 transitions. Word has length 138 [2024-10-14 03:26:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:40,052 INFO L471 AbstractCegarLoop]: Abstraction has 7287 states and 9458 transitions. [2024-10-14 03:26:40,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.772727272727273) internal successors, (215), 20 states have internal predecessors, (215), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-14 03:26:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 7287 states and 9458 transitions. [2024-10-14 03:26:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 03:26:40,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:40,066 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:40,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 03:26:40,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-14 03:26:40,268 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:40,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1381769569, now seen corresponding path program 1 times [2024-10-14 03:26:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904697649] [2024-10-14 03:26:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:40,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:26:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 03:26:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 03:26:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:26:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:26:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:26:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:26:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:26:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:26:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:26:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 03:26:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 03:26:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 03:26:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-14 03:26:40,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:40,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904697649] [2024-10-14 03:26:40,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904697649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:40,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:40,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:26:40,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609047746] [2024-10-14 03:26:40,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:40,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:26:40,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:40,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:26:40,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:40,516 INFO L87 Difference]: Start difference. First operand 7287 states and 9458 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:26:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:42,375 INFO L93 Difference]: Finished difference Result 21173 states and 27582 transitions. [2024-10-14 03:26:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:26:42,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 141 [2024-10-14 03:26:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:42,449 INFO L225 Difference]: With dead ends: 21173 [2024-10-14 03:26:42,449 INFO L226 Difference]: Without dead ends: 14346 [2024-10-14 03:26:42,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:26:42,478 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 215 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:42,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2032 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:26:42,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14346 states. [2024-10-14 03:26:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14346 to 12116. [2024-10-14 03:26:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12116 states, 8795 states have (on average 1.3022171688459352) internal successors, (11453), 8885 states have internal predecessors, (11453), 2161 states have call successors, (2161), 1159 states have call predecessors, (2161), 1159 states have return successors, (2161), 2071 states have call predecessors, (2161), 2161 states have call successors, (2161) [2024-10-14 03:26:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12116 states to 12116 states and 15775 transitions. [2024-10-14 03:26:43,913 INFO L78 Accepts]: Start accepts. Automaton has 12116 states and 15775 transitions. Word has length 141 [2024-10-14 03:26:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:43,914 INFO L471 AbstractCegarLoop]: Abstraction has 12116 states and 15775 transitions. [2024-10-14 03:26:43,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 03:26:43,915 INFO L276 IsEmpty]: Start isEmpty. Operand 12116 states and 15775 transitions. [2024-10-14 03:26:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 03:26:43,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:43,931 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:43,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 03:26:43,932 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:43,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:43,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1987662181, now seen corresponding path program 1 times [2024-10-14 03:26:43,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:43,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683816490] [2024-10-14 03:26:43,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:43,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:26:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 03:26:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:26:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 03:26:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:26:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 03:26:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 03:26:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 03:26:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:26:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 03:26:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 03:26:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 03:26:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 03:26:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-14 03:26:44,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:44,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683816490] [2024-10-14 03:26:44,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683816490] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:26:44,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383569797] [2024-10-14 03:26:44,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:44,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:26:44,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:26:44,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:26:44,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:26:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:44,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 03:26:44,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:26:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:26:45,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:26:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-14 03:26:45,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383569797] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 03:26:45,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 03:26:45,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 11] total 25 [2024-10-14 03:26:45,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266627538] [2024-10-14 03:26:45,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:45,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:26:45,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:45,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:26:45,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:26:45,465 INFO L87 Difference]: Start difference. First operand 12116 states and 15775 transitions. Second operand has 9 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 03:26:47,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:47,389 INFO L93 Difference]: Finished difference Result 23836 states and 31056 transitions. [2024-10-14 03:26:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:26:47,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 141 [2024-10-14 03:26:47,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:47,446 INFO L225 Difference]: With dead ends: 23836 [2024-10-14 03:26:47,446 INFO L226 Difference]: Without dead ends: 12180 [2024-10-14 03:26:47,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2024-10-14 03:26:47,472 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 372 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:47,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1400 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:26:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12180 states. [2024-10-14 03:26:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12180 to 8236. [2024-10-14 03:26:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8236 states, 6009 states have (on average 1.3058745215510068) internal successors, (7847), 6064 states have internal predecessors, (7847), 1444 states have call successors, (1444), 782 states have call predecessors, (1444), 782 states have return successors, (1444), 1389 states have call predecessors, (1444), 1444 states have call successors, (1444) [2024-10-14 03:26:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8236 states to 8236 states and 10735 transitions. [2024-10-14 03:26:48,402 INFO L78 Accepts]: Start accepts. Automaton has 8236 states and 10735 transitions. Word has length 141 [2024-10-14 03:26:48,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:48,402 INFO L471 AbstractCegarLoop]: Abstraction has 8236 states and 10735 transitions. [2024-10-14 03:26:48,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 03:26:48,403 INFO L276 IsEmpty]: Start isEmpty. Operand 8236 states and 10735 transitions. [2024-10-14 03:26:48,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 03:26:48,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:48,416 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:48,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 03:26:48,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-14 03:26:48,617 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:48,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash -226652460, now seen corresponding path program 1 times [2024-10-14 03:26:48,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:48,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298814683] [2024-10-14 03:26:48,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:48,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:26:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 03:26:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:26:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 03:26:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:26:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 03:26:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 03:26:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 03:26:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 03:26:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 03:26:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 03:26:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 03:26:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 03:26:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-14 03:26:49,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:49,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298814683] [2024-10-14 03:26:49,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298814683] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:26:49,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667502818] [2024-10-14 03:26:49,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:49,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:26:49,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:26:49,981 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:26:49,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:26:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:50,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 03:26:50,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:26:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:26:50,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:26:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-14 03:26:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667502818] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:26:50,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:26:50,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 26 [2024-10-14 03:26:50,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344998306] [2024-10-14 03:26:50,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:26:50,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 03:26:50,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:50,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 03:26:50,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2024-10-14 03:26:50,850 INFO L87 Difference]: Start difference. First operand 8236 states and 10735 transitions. Second operand has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 24 states have internal predecessors, (245), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-14 03:26:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:55,904 INFO L93 Difference]: Finished difference Result 19311 states and 25190 transitions. [2024-10-14 03:26:55,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-14 03:26:55,905 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 24 states have internal predecessors, (245), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) Word has length 142 [2024-10-14 03:26:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:55,964 INFO L225 Difference]: With dead ends: 19311 [2024-10-14 03:26:55,965 INFO L226 Difference]: Without dead ends: 11279 [2024-10-14 03:26:55,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1059, Invalid=5103, Unknown=0, NotChecked=0, Total=6162 [2024-10-14 03:26:55,987 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 1966 mSDsluCounter, 7594 mSDsCounter, 0 mSdLazyCounter, 4359 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 8305 SdHoareTripleChecker+Invalid, 5019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 4359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:55,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 8305 Invalid, 5019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 4359 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 03:26:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11279 states. [2024-10-14 03:26:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11279 to 7560. [2024-10-14 03:26:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7560 states, 5533 states have (on average 1.2973070666907645) internal successors, (7178), 5583 states have internal predecessors, (7178), 1315 states have call successors, (1315), 711 states have call predecessors, (1315), 711 states have return successors, (1315), 1265 states have call predecessors, (1315), 1315 states have call successors, (1315) [2024-10-14 03:26:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 9808 transitions. [2024-10-14 03:26:57,378 INFO L78 Accepts]: Start accepts. Automaton has 7560 states and 9808 transitions. Word has length 142 [2024-10-14 03:26:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:57,379 INFO L471 AbstractCegarLoop]: Abstraction has 7560 states and 9808 transitions. [2024-10-14 03:26:57,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 24 states have internal predecessors, (245), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-14 03:26:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 7560 states and 9808 transitions. [2024-10-14 03:26:57,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 03:26:57,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:57,391 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:57,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:26:57,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:26:57,596 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:57,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:57,597 INFO L85 PathProgramCache]: Analyzing trace with hash 851355554, now seen corresponding path program 1 times [2024-10-14 03:26:57,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:57,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624082040] [2024-10-14 03:26:57,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:57,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:26:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 03:26:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 03:26:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:26:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:26:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:26:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:26:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 03:26:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 03:26:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 03:26:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 03:26:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 03:26:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 03:26:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-14 03:26:58,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:58,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624082040] [2024-10-14 03:26:58,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624082040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:26:58,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317195799] [2024-10-14 03:26:58,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:58,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:26:58,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:26:58,585 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:26:58,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 03:26:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:58,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 03:26:58,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:26:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 03:26:58,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:26:59,017 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-14 03:26:59,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317195799] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:26:59,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:26:59,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2024-10-14 03:26:59,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926629611] [2024-10-14 03:26:59,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:26:59,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 03:26:59,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:59,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 03:26:59,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:26:59,020 INFO L87 Difference]: Start difference. First operand 7560 states and 9808 transitions. Second operand has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 14 states have internal predecessors, (166), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 6 states have call successors, (34) [2024-10-14 03:27:01,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:01,534 INFO L93 Difference]: Finished difference Result 16224 states and 21027 transitions. [2024-10-14 03:27:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 03:27:01,535 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 14 states have internal predecessors, (166), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 6 states have call successors, (34) Word has length 143 [2024-10-14 03:27:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:01,584 INFO L225 Difference]: With dead ends: 16224 [2024-10-14 03:27:01,585 INFO L226 Difference]: Without dead ends: 8862 [2024-10-14 03:27:01,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=1529, Unknown=0, NotChecked=0, Total=1806 [2024-10-14 03:27:01,604 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1085 mSDsluCounter, 3129 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:01,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 3531 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:27:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8862 states. [2024-10-14 03:27:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8862 to 8579. [2024-10-14 03:27:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8579 states, 6270 states have (on average 1.2955342902711324) internal successors, (8123), 6328 states have internal predecessors, (8123), 1494 states have call successors, (1494), 814 states have call predecessors, (1494), 814 states have return successors, (1494), 1436 states have call predecessors, (1494), 1494 states have call successors, (1494) [2024-10-14 03:27:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8579 states to 8579 states and 11111 transitions. [2024-10-14 03:27:02,944 INFO L78 Accepts]: Start accepts. Automaton has 8579 states and 11111 transitions. Word has length 143 [2024-10-14 03:27:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:02,945 INFO L471 AbstractCegarLoop]: Abstraction has 8579 states and 11111 transitions. [2024-10-14 03:27:02,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 14 states have internal predecessors, (166), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 6 states have call successors, (34) [2024-10-14 03:27:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 8579 states and 11111 transitions. [2024-10-14 03:27:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-14 03:27:02,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:02,959 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:02,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 03:27:03,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:03,160 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:03,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:03,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1529891451, now seen corresponding path program 1 times [2024-10-14 03:27:03,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:03,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076969217] [2024-10-14 03:27:03,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:03,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:27:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:27:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:27:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:27:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 03:27:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:27:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:27:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 03:27:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 03:27:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 03:27:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:27:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 03:27:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-14 03:27:03,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:03,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076969217] [2024-10-14 03:27:03,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076969217] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:03,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123053240] [2024-10-14 03:27:03,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:03,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:03,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:03,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:03,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 03:27:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:03,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 03:27:03,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 8 proven. 94 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 03:27:03,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:27:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-14 03:27:03,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123053240] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:27:03,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:27:03,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2024-10-14 03:27:03,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178943151] [2024-10-14 03:27:03,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:27:03,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 03:27:03,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:03,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 03:27:03,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:27:03,974 INFO L87 Difference]: Start difference. First operand 8579 states and 11111 transitions. Second operand has 10 states, 10 states have (on average 13.1) internal successors, (131), 9 states have internal predecessors, (131), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-14 03:27:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:06,028 INFO L93 Difference]: Finished difference Result 23011 states and 29506 transitions. [2024-10-14 03:27:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:27:06,028 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 9 states have internal predecessors, (131), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 153 [2024-10-14 03:27:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:06,100 INFO L225 Difference]: With dead ends: 23011 [2024-10-14 03:27:06,101 INFO L226 Difference]: Without dead ends: 14793 [2024-10-14 03:27:06,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 332 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-10-14 03:27:06,126 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 335 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:06,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1617 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:27:06,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14793 states. [2024-10-14 03:27:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14793 to 12861. [2024-10-14 03:27:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12861 states, 9430 states have (on average 1.277730646871686) internal successors, (12049), 9540 states have internal predecessors, (12049), 2192 states have call successors, (2192), 1238 states have call predecessors, (2192), 1238 states have return successors, (2192), 2082 states have call predecessors, (2192), 2192 states have call successors, (2192) [2024-10-14 03:27:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12861 states to 12861 states and 16433 transitions. [2024-10-14 03:27:08,061 INFO L78 Accepts]: Start accepts. Automaton has 12861 states and 16433 transitions. Word has length 153 [2024-10-14 03:27:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:08,062 INFO L471 AbstractCegarLoop]: Abstraction has 12861 states and 16433 transitions. [2024-10-14 03:27:08,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 9 states have internal predecessors, (131), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-14 03:27:08,062 INFO L276 IsEmpty]: Start isEmpty. Operand 12861 states and 16433 transitions. [2024-10-14 03:27:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 03:27:08,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:08,073 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:08,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 03:27:08,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:08,274 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:08,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:08,275 INFO L85 PathProgramCache]: Analyzing trace with hash -436147346, now seen corresponding path program 1 times [2024-10-14 03:27:08,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:08,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433876211] [2024-10-14 03:27:08,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:08,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:27:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 03:27:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 03:27:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:27:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:27:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:27:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:27:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:27:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 03:27:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 03:27:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 03:27:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 03:27:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 03:27:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 03:27:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-14 03:27:08,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:08,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433876211] [2024-10-14 03:27:08,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433876211] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:08,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811446758] [2024-10-14 03:27:08,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:08,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:08,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:08,942 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:08,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 03:27:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:09,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-14 03:27:09,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 65 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-14 03:27:09,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:27:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-14 03:27:10,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811446758] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:27:10,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:27:10,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 28 [2024-10-14 03:27:10,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115483448] [2024-10-14 03:27:10,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:27:10,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 03:27:10,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:10,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 03:27:10,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2024-10-14 03:27:10,546 INFO L87 Difference]: Start difference. First operand 12861 states and 16433 transitions. Second operand has 28 states, 28 states have (on average 7.785714285714286) internal successors, (218), 28 states have internal predecessors, (218), 10 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-14 03:27:16,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:16,137 INFO L93 Difference]: Finished difference Result 24618 states and 31574 transitions. [2024-10-14 03:27:16,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-14 03:27:16,138 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.785714285714286) internal successors, (218), 28 states have internal predecessors, (218), 10 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) Word has length 152 [2024-10-14 03:27:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:16,201 INFO L225 Difference]: With dead ends: 24618 [2024-10-14 03:27:16,201 INFO L226 Difference]: Without dead ends: 13649 [2024-10-14 03:27:16,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=629, Invalid=4063, Unknown=0, NotChecked=0, Total=4692 [2024-10-14 03:27:16,232 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 1380 mSDsluCounter, 5525 mSDsCounter, 0 mSdLazyCounter, 3233 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 5971 SdHoareTripleChecker+Invalid, 3720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 3233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:16,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 5971 Invalid, 3720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 3233 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 03:27:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13649 states. [2024-10-14 03:27:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13649 to 13319. [2024-10-14 03:27:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13319 states, 9808 states have (on average 1.2789559543230016) internal successors, (12544), 9918 states have internal predecessors, (12544), 2233 states have call successors, (2233), 1277 states have call predecessors, (2233), 1277 states have return successors, (2233), 2123 states have call predecessors, (2233), 2233 states have call successors, (2233) [2024-10-14 03:27:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13319 states to 13319 states and 17010 transitions. [2024-10-14 03:27:18,950 INFO L78 Accepts]: Start accepts. Automaton has 13319 states and 17010 transitions. Word has length 152 [2024-10-14 03:27:18,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:18,951 INFO L471 AbstractCegarLoop]: Abstraction has 13319 states and 17010 transitions. [2024-10-14 03:27:18,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.785714285714286) internal successors, (218), 28 states have internal predecessors, (218), 10 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-14 03:27:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 13319 states and 17010 transitions. [2024-10-14 03:27:18,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-14 03:27:18,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:18,964 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:18,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 03:27:19,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:19,166 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:19,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1594842057, now seen corresponding path program 1 times [2024-10-14 03:27:19,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:19,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149107973] [2024-10-14 03:27:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:27:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 03:27:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 03:27:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:27:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:27:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:27:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:27:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:27:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 03:27:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 03:27:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 03:27:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 03:27:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 03:27:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 03:27:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-14 03:27:19,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:19,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149107973] [2024-10-14 03:27:19,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149107973] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:19,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205312187] [2024-10-14 03:27:19,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:19,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:19,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:19,884 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:19,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 03:27:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 03:27:20,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-14 03:27:20,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:27:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-14 03:27:20,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205312187] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:27:20,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:27:20,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 23 [2024-10-14 03:27:20,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227218568] [2024-10-14 03:27:20,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:27:20,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 03:27:20,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:20,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 03:27:20,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:27:20,493 INFO L87 Difference]: Start difference. First operand 13319 states and 17010 transitions. Second operand has 23 states, 23 states have (on average 6.869565217391305) internal successors, (158), 18 states have internal predecessors, (158), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (28), 8 states have call predecessors, (28), 4 states have call successors, (28)