./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.BOUNDED-10.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.BOUNDED-10.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 a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:26:09,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:26:09,988 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:09,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:26:09,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:26:10,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:26:10,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:26:10,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:26:10,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:26:10,013 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:26:10,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:26:10,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:26:10,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:26:10,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:26:10,015 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:26:10,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:26:10,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:26:10,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:26:10,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:26:10,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:26:10,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:26:10,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:26:10,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:26:10,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:26:10,019 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:26:10,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:26:10,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:26:10,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:26:10,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:26:10,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:26:10,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:26:10,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:26:10,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:26:10,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:26:10,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:26:10,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:26:10,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:26:10,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:26:10,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:26:10,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:26:10,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:26:10,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:26:10,025 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 -> a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d [2024-10-14 03:26:10,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:26:10,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:26:10,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:26:10,296 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:26:10,296 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:26:10,297 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.BOUNDED-10.pals.c [2024-10-14 03:26:11,766 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:26:11,978 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:26:11,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2024-10-14 03:26:11,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52dd5e91a/a80cb90ce3aa49b2b78ae1637785ccb4/FLAG803cae7e9 [2024-10-14 03:26:12,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52dd5e91a/a80cb90ce3aa49b2b78ae1637785ccb4 [2024-10-14 03:26:12,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:26:12,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:26:12,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:26:12,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:26:12,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:26:12,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:26:12" (1/1) ... [2024-10-14 03:26:12,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53fa2e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:12, skipping insertion in model container [2024-10-14 03:26:12,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:26:12" (1/1) ... [2024-10-14 03:26:12,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:26:12,380 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.BOUNDED-10.pals.c[14540,14553] [2024-10-14 03:26:12,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:26:12,402 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:26:12,478 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.BOUNDED-10.pals.c[14540,14553] [2024-10-14 03:26:12,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:26:12,501 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:26:12,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:12 WrapperNode [2024-10-14 03:26:12,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:26:12,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:26:12,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:26:12,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:26:12,509 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:12" (1/1) ... [2024-10-14 03:26:12,520 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:12" (1/1) ... [2024-10-14 03:26:12,556 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 505 [2024-10-14 03:26:12,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:26:12,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:26:12,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:26:12,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:26:12,568 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:12" (1/1) ... [2024-10-14 03:26:12,568 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:12" (1/1) ... [2024-10-14 03:26:12,577 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:12" (1/1) ... [2024-10-14 03:26:12,604 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:12,605 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:12" (1/1) ... [2024-10-14 03:26:12,605 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:12" (1/1) ... [2024-10-14 03:26:12,616 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:12" (1/1) ... [2024-10-14 03:26:12,629 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:12" (1/1) ... [2024-10-14 03:26:12,635 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:12" (1/1) ... [2024-10-14 03:26:12,637 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:12" (1/1) ... [2024-10-14 03:26:12,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:26:12,648 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:26:12,648 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:26:12,648 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:26:12,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:12" (1/1) ... [2024-10-14 03:26:12,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:26:12,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:26:12,682 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:12,687 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:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-14 03:26:12,737 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-14 03:26:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:26:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-14 03:26:12,738 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-14 03:26:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-14 03:26:12,738 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-14 03:26:12,739 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-10-14 03:26:12,739 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-10-14 03:26:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 03:26:12,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 03:26:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:26:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-14 03:26:12,740 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-14 03:26:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:26:12,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:26:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-14 03:26:12,741 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-14 03:26:12,861 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:26:12,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:26:13,505 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-10-14 03:26:13,505 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:26:13,559 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:26:13,559 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:26:13,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:26:13 BoogieIcfgContainer [2024-10-14 03:26:13,560 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:26:13,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:26:13,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:26:13,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:26:13,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:26:12" (1/3) ... [2024-10-14 03:26:13,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea16350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:26:13, skipping insertion in model container [2024-10-14 03:26:13,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:26:12" (2/3) ... [2024-10-14 03:26:13,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea16350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:26:13, skipping insertion in model container [2024-10-14 03:26:13,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:26:13" (3/3) ... [2024-10-14 03:26:13,567 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2024-10-14 03:26:13,580 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:26:13,580 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:26:13,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:26:13,652 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;@7967aa0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:26:13,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:26:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 129 states have (on average 1.5891472868217054) internal successors, (205), 130 states have internal predecessors, (205), 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:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:26:13,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:13,663 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:13,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:13,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:13,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1825629780, now seen corresponding path program 1 times [2024-10-14 03:26:13,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:13,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145275416] [2024-10-14 03:26:13,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:13,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:26:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:26:13,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:13,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145275416] [2024-10-14 03:26:13,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145275416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:13,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:13,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:26:13,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379900004] [2024-10-14 03:26:13,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:13,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:26:13,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:14,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:26:14,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:26:14,037 INFO L87 Difference]: Start difference. First operand has 169 states, 129 states have (on average 1.5891472868217054) internal successors, (205), 130 states have internal predecessors, (205), 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:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:14,146 INFO L93 Difference]: Finished difference Result 323 states and 535 transitions. [2024-10-14 03:26:14,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:26:14,149 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:14,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:14,158 INFO L225 Difference]: With dead ends: 323 [2024-10-14 03:26:14,158 INFO L226 Difference]: Without dead ends: 167 [2024-10-14 03:26:14,162 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:14,166 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:14,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:26:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-14 03:26:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-10-14 03:26:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 128 states have (on average 1.5625) internal successors, (200), 128 states have internal predecessors, (200), 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:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 262 transitions. [2024-10-14 03:26:14,226 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 262 transitions. Word has length 23 [2024-10-14 03:26:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:14,226 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 262 transitions. [2024-10-14 03:26:14,226 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:14,227 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 262 transitions. [2024-10-14 03:26:14,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 03:26:14,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:14,228 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:14,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:26:14,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:14,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash -168514926, now seen corresponding path program 1 times [2024-10-14 03:26:14,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:14,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231517917] [2024-10-14 03:26:14,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:14,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:14,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:26:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:14,516 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:14,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:14,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231517917] [2024-10-14 03:26:14,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231517917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:14,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:14,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:26:14,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100854384] [2024-10-14 03:26:14,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:14,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:26:14,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:14,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:26:14,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:26:14,521 INFO L87 Difference]: Start difference. First operand 167 states and 262 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:14,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:14,665 INFO L93 Difference]: Finished difference Result 426 states and 676 transitions. [2024-10-14 03:26:14,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:26:14,667 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:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:14,670 INFO L225 Difference]: With dead ends: 426 [2024-10-14 03:26:14,670 INFO L226 Difference]: Without dead ends: 272 [2024-10-14 03:26:14,674 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:14,675 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 124 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:14,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1239 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:26:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-14 03:26:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 167. [2024-10-14 03:26:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 128 states have (on average 1.46875) internal successors, (188), 128 states have internal predecessors, (188), 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:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 250 transitions. [2024-10-14 03:26:14,705 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 250 transitions. Word has length 23 [2024-10-14 03:26:14,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:14,707 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 250 transitions. [2024-10-14 03:26:14,707 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:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 250 transitions. [2024-10-14 03:26:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 03:26:14,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:14,708 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:14,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:26:14,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:14,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:14,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1006236297, now seen corresponding path program 1 times [2024-10-14 03:26:14,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:14,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485154905] [2024-10-14 03:26:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:14,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,012 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,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:15,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485154905] [2024-10-14 03:26:15,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485154905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:15,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:15,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288722350] [2024-10-14 03:26:15,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:15,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:15,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:15,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:15,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:15,015 INFO L87 Difference]: Start difference. First operand 167 states and 250 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:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:15,112 INFO L93 Difference]: Finished difference Result 322 states and 491 transitions. [2024-10-14 03:26:15,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:15,113 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:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:15,115 INFO L225 Difference]: With dead ends: 322 [2024-10-14 03:26:15,118 INFO L226 Difference]: Without dead ends: 171 [2024-10-14 03:26:15,119 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:15,120 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 3 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 707 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:15,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 707 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:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-14 03:26:15,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-14 03:26:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 131 states have (on average 1.4580152671755726) internal successors, (191), 131 states have internal predecessors, (191), 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:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 253 transitions. [2024-10-14 03:26:15,145 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 253 transitions. Word has length 34 [2024-10-14 03:26:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:15,145 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 253 transitions. [2024-10-14 03:26:15,145 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:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 253 transitions. [2024-10-14 03:26:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 03:26:15,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:15,147 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:15,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:26:15,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:15,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:15,149 INFO L85 PathProgramCache]: Analyzing trace with hash 960217751, now seen corresponding path program 1 times [2024-10-14 03:26:15,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:15,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043145240] [2024-10-14 03:26:15,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:15,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:26:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,284 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:15,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:15,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043145240] [2024-10-14 03:26:15,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043145240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:15,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:15,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:26:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090959263] [2024-10-14 03:26:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:15,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:26:15,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:15,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:26:15,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:26:15,288 INFO L87 Difference]: Start difference. First operand 171 states and 253 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:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:15,366 INFO L93 Difference]: Finished difference Result 470 states and 705 transitions. [2024-10-14 03:26:15,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:26:15,367 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:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:15,370 INFO L225 Difference]: With dead ends: 470 [2024-10-14 03:26:15,371 INFO L226 Difference]: Without dead ends: 315 [2024-10-14 03:26:15,372 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:15,375 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 206 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 489 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:15,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 489 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:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-14 03:26:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2024-10-14 03:26:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 234 states have (on average 1.4743589743589745) internal successors, (345), 235 states have internal predecessors, (345), 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:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 465 transitions. [2024-10-14 03:26:15,411 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 465 transitions. Word has length 48 [2024-10-14 03:26:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:15,414 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 465 transitions. [2024-10-14 03:26:15,414 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:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 465 transitions. [2024-10-14 03:26:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:26:15,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:15,416 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:15,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:26:15,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:15,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:15,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1818036195, now seen corresponding path program 1 times [2024-10-14 03:26:15,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:15,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572940458] [2024-10-14 03:26:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:15,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:26:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,522 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:15,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:15,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572940458] [2024-10-14 03:26:15,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572940458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:15,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:15,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:26:15,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184715153] [2024-10-14 03:26:15,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:15,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:26:15,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:15,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:26:15,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:26:15,527 INFO L87 Difference]: Start difference. First operand 311 states and 465 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:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:15,625 INFO L93 Difference]: Finished difference Result 877 states and 1321 transitions. [2024-10-14 03:26:15,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:26:15,626 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:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:15,632 INFO L225 Difference]: With dead ends: 877 [2024-10-14 03:26:15,633 INFO L226 Difference]: Without dead ends: 582 [2024-10-14 03:26:15,634 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:15,635 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 207 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 509 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:15,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 509 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:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-10-14 03:26:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 576. [2024-10-14 03:26:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 427 states have (on average 1.4824355971896956) internal successors, (633), 430 states have internal predecessors, (633), 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:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 867 transitions. [2024-10-14 03:26:15,721 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 867 transitions. Word has length 49 [2024-10-14 03:26:15,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:15,724 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 867 transitions. [2024-10-14 03:26:15,724 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:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 867 transitions. [2024-10-14 03:26:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:26:15,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:15,729 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:15,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:26:15,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:15,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:15,732 INFO L85 PathProgramCache]: Analyzing trace with hash 538172517, now seen corresponding path program 1 times [2024-10-14 03:26:15,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:15,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874185967] [2024-10-14 03:26:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:26:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:15,874 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:15,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:15,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874185967] [2024-10-14 03:26:15,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874185967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:15,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:15,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:26:15,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700966869] [2024-10-14 03:26:15,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:15,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:26:15,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:15,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:26:15,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:15,878 INFO L87 Difference]: Start difference. First operand 576 states and 867 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:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:16,097 INFO L93 Difference]: Finished difference Result 1221 states and 1838 transitions. [2024-10-14 03:26:16,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:26:16,098 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:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:16,105 INFO L225 Difference]: With dead ends: 1221 [2024-10-14 03:26:16,105 INFO L226 Difference]: Without dead ends: 661 [2024-10-14 03:26:16,107 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:16,108 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 335 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 644 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:16,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 644 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:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-14 03:26:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 657. [2024-10-14 03:26:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 495 states have (on average 1.4707070707070706) internal successors, (728), 498 states have internal predecessors, (728), 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:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 976 transitions. [2024-10-14 03:26:16,174 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 976 transitions. Word has length 49 [2024-10-14 03:26:16,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:16,175 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 976 transitions. [2024-10-14 03:26:16,175 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:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 976 transitions. [2024-10-14 03:26:16,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 03:26:16,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:16,181 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:16,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:26:16,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:16,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1226003250, now seen corresponding path program 1 times [2024-10-14 03:26:16,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:16,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120133075] [2024-10-14 03:26:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:16,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:26:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,327 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,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120133075] [2024-10-14 03:26:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120133075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:16,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:16,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:26:16,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422669317] [2024-10-14 03:26:16,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:16,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:26:16,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:16,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:26:16,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:26:16,329 INFO L87 Difference]: Start difference. First operand 657 states and 976 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:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:16,531 INFO L93 Difference]: Finished difference Result 1221 states and 1830 transitions. [2024-10-14 03:26:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:26:16,532 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:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:16,537 INFO L225 Difference]: With dead ends: 1221 [2024-10-14 03:26:16,537 INFO L226 Difference]: Without dead ends: 661 [2024-10-14 03:26:16,539 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:16,542 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 332 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 647 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:16,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 647 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:16,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-14 03:26:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 657. [2024-10-14 03:26:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 495 states have (on average 1.4626262626262627) internal successors, (724), 498 states have internal predecessors, (724), 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:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 972 transitions. [2024-10-14 03:26:16,597 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 972 transitions. Word has length 50 [2024-10-14 03:26:16,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:16,597 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 972 transitions. [2024-10-14 03:26:16,597 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:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 972 transitions. [2024-10-14 03:26:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:26:16,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:16,599 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:16,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:26:16,599 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:16,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:16,600 INFO L85 PathProgramCache]: Analyzing trace with hash -157915880, now seen corresponding path program 1 times [2024-10-14 03:26:16,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:16,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679162805] [2024-10-14 03:26:16,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:16,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:16,801 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,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:16,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679162805] [2024-10-14 03:26:16,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679162805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:16,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:16,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:16,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479692895] [2024-10-14 03:26:16,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:16,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:16,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:16,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:16,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:16,807 INFO L87 Difference]: Start difference. First operand 657 states and 972 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:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:16,898 INFO L93 Difference]: Finished difference Result 1237 states and 1850 transitions. [2024-10-14 03:26:16,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:16,899 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:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:16,906 INFO L225 Difference]: With dead ends: 1237 [2024-10-14 03:26:16,906 INFO L226 Difference]: Without dead ends: 677 [2024-10-14 03:26:16,908 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:16,909 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 719 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:16,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 719 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:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-10-14 03:26:16,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2024-10-14 03:26:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 511 states have (on average 1.4481409001956946) internal successors, (740), 514 states have internal predecessors, (740), 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:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 988 transitions. [2024-10-14 03:26:16,980 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 988 transitions. Word has length 51 [2024-10-14 03:26:16,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:16,980 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 988 transitions. [2024-10-14 03:26:16,981 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:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 988 transitions. [2024-10-14 03:26:16,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:26:16,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:16,983 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:16,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:26:16,983 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:16,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:16,984 INFO L85 PathProgramCache]: Analyzing trace with hash -957591869, now seen corresponding path program 1 times [2024-10-14 03:26:16,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:16,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903190642] [2024-10-14 03:26:16,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:16,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,198 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,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:17,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903190642] [2024-10-14 03:26:17,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903190642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:17,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:17,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:17,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732659574] [2024-10-14 03:26:17,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:17,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:17,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:17,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:17,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:17,201 INFO L87 Difference]: Start difference. First operand 677 states and 988 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:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:17,290 INFO L93 Difference]: Finished difference Result 1277 states and 1894 transitions. [2024-10-14 03:26:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:17,291 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:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:17,296 INFO L225 Difference]: With dead ends: 1277 [2024-10-14 03:26:17,296 INFO L226 Difference]: Without dead ends: 697 [2024-10-14 03:26:17,298 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:17,298 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 4 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 705 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:17,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 705 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:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-10-14 03:26:17,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2024-10-14 03:26:17,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 527 states have (on average 1.4345351043643264) internal successors, (756), 530 states have internal predecessors, (756), 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:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1004 transitions. [2024-10-14 03:26:17,348 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1004 transitions. Word has length 59 [2024-10-14 03:26:17,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:17,348 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1004 transitions. [2024-10-14 03:26:17,348 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:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1004 transitions. [2024-10-14 03:26:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:26:17,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:17,350 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:17,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:26:17,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:17,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:17,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1844870161, now seen corresponding path program 1 times [2024-10-14 03:26:17,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:17,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202750380] [2024-10-14 03:26:17,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:17,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,528 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,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:17,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202750380] [2024-10-14 03:26:17,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202750380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:17,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:17,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:17,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284299102] [2024-10-14 03:26:17,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:17,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:17,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:17,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:17,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:17,530 INFO L87 Difference]: Start difference. First operand 697 states and 1004 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:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:17,634 INFO L93 Difference]: Finished difference Result 1317 states and 1926 transitions. [2024-10-14 03:26:17,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:17,635 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:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:17,640 INFO L225 Difference]: With dead ends: 1317 [2024-10-14 03:26:17,640 INFO L226 Difference]: Without dead ends: 717 [2024-10-14 03:26:17,642 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:17,642 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 4 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 705 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:17,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 705 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:17,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-10-14 03:26:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2024-10-14 03:26:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 543 states have (on average 1.4217311233885819) internal successors, (772), 546 states have internal predecessors, (772), 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:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1020 transitions. [2024-10-14 03:26:17,699 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1020 transitions. Word has length 67 [2024-10-14 03:26:17,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:17,700 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 1020 transitions. [2024-10-14 03:26:17,700 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:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1020 transitions. [2024-10-14 03:26:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:26:17,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:17,702 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:17,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:26:17,703 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:17,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:17,703 INFO L85 PathProgramCache]: Analyzing trace with hash 53637832, now seen corresponding path program 1 times [2024-10-14 03:26:17,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:17,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660939653] [2024-10-14 03:26:17,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:17,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:17,862 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:17,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:17,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660939653] [2024-10-14 03:26:17,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660939653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:17,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:17,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677195155] [2024-10-14 03:26:17,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:17,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:17,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:17,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:17,866 INFO L87 Difference]: Start difference. First operand 717 states and 1020 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:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:17,953 INFO L93 Difference]: Finished difference Result 1353 states and 1942 transitions. [2024-10-14 03:26:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:17,954 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:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:17,960 INFO L225 Difference]: With dead ends: 1353 [2024-10-14 03:26:17,960 INFO L226 Difference]: Without dead ends: 733 [2024-10-14 03:26:17,962 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:17,962 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 3 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 715 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:17,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 715 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:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-10-14 03:26:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2024-10-14 03:26:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 555 states have (on average 1.4126126126126126) internal successors, (784), 558 states have internal predecessors, (784), 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:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1032 transitions. [2024-10-14 03:26:18,014 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1032 transitions. Word has length 67 [2024-10-14 03:26:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:18,014 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 1032 transitions. [2024-10-14 03:26:18,014 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:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1032 transitions. [2024-10-14 03:26:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:26:18,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:18,017 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:18,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:26:18,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:18,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:18,018 INFO L85 PathProgramCache]: Analyzing trace with hash -343959825, now seen corresponding path program 1 times [2024-10-14 03:26:18,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:18,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482723978] [2024-10-14 03:26:18,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,259 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:18,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:18,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482723978] [2024-10-14 03:26:18,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482723978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:18,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:18,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:18,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876238762] [2024-10-14 03:26:18,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:18,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:18,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:18,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:18,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:18,262 INFO L87 Difference]: Start difference. First operand 733 states and 1032 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:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:18,359 INFO L93 Difference]: Finished difference Result 1393 states and 1978 transitions. [2024-10-14 03:26:18,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:18,359 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:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:18,364 INFO L225 Difference]: With dead ends: 1393 [2024-10-14 03:26:18,365 INFO L226 Difference]: Without dead ends: 757 [2024-10-14 03:26:18,366 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:18,367 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 5 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 717 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:18,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 717 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:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2024-10-14 03:26:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2024-10-14 03:26:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 575 states have (on average 1.3982608695652174) internal successors, (804), 578 states have internal predecessors, (804), 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:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1052 transitions. [2024-10-14 03:26:18,417 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1052 transitions. Word has length 75 [2024-10-14 03:26:18,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:18,417 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1052 transitions. [2024-10-14 03:26:18,417 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:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1052 transitions. [2024-10-14 03:26:18,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:26:18,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:18,421 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:18,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:26:18,421 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:18,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:18,422 INFO L85 PathProgramCache]: Analyzing trace with hash -946423420, now seen corresponding path program 1 times [2024-10-14 03:26:18,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:18,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396098345] [2024-10-14 03:26:18,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:18,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:26:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:18,993 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:18,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:18,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396098345] [2024-10-14 03:26:18,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396098345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:18,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:18,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:26:18,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021601594] [2024-10-14 03:26:18,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:18,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:26:18,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:26:18,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:18,995 INFO L87 Difference]: Start difference. First operand 757 states and 1052 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:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:19,324 INFO L93 Difference]: Finished difference Result 1977 states and 2731 transitions. [2024-10-14 03:26:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:26:19,324 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:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:19,332 INFO L225 Difference]: With dead ends: 1977 [2024-10-14 03:26:19,332 INFO L226 Difference]: Without dead ends: 1317 [2024-10-14 03:26:19,334 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:19,335 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 205 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1361 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:19,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1361 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:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-10-14 03:26:19,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1033. [2024-10-14 03:26:19,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 778 states have (on average 1.3856041131105399) internal successors, (1078), 783 states have internal predecessors, (1078), 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:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1422 transitions. [2024-10-14 03:26:19,419 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1422 transitions. Word has length 78 [2024-10-14 03:26:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:19,419 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1422 transitions. [2024-10-14 03:26:19,419 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:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1422 transitions. [2024-10-14 03:26:19,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:26:19,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:19,421 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:19,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:26:19,421 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:19,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash -767138360, now seen corresponding path program 1 times [2024-10-14 03:26:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:19,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147863195] [2024-10-14 03:26:19,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:19,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:26:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:19,701 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:19,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:19,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147863195] [2024-10-14 03:26:19,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147863195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:19,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:19,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:26:19,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116897461] [2024-10-14 03:26:19,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:19,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:26:19,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:19,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:26:19,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:26:19,703 INFO L87 Difference]: Start difference. First operand 1033 states and 1422 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:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:19,936 INFO L93 Difference]: Finished difference Result 1441 states and 2082 transitions. [2024-10-14 03:26:19,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:26:19,937 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:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:19,946 INFO L225 Difference]: With dead ends: 1441 [2024-10-14 03:26:19,946 INFO L226 Difference]: Without dead ends: 1439 [2024-10-14 03:26:19,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:26:19,948 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 127 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:19,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 2742 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:26:19,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2024-10-14 03:26:20,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1041. [2024-10-14 03:26:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 782 states have (on average 1.3836317135549872) internal successors, (1082), 789 states have internal predecessors, (1082), 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:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1430 transitions. [2024-10-14 03:26:20,051 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1430 transitions. Word has length 81 [2024-10-14 03:26:20,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:20,052 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1430 transitions. [2024-10-14 03:26:20,052 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:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1430 transitions. [2024-10-14 03:26:20,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:26:20,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:20,054 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:20,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:26:20,055 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:20,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:20,055 INFO L85 PathProgramCache]: Analyzing trace with hash -56029754, now seen corresponding path program 1 times [2024-10-14 03:26:20,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:20,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115296604] [2024-10-14 03:26:20,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:20,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 03:26:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,241 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:20,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:20,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115296604] [2024-10-14 03:26:20,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115296604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:20,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:20,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:20,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944532221] [2024-10-14 03:26:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:20,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:20,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:20,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:20,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:20,243 INFO L87 Difference]: Start difference. First operand 1041 states and 1430 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:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:20,396 INFO L93 Difference]: Finished difference Result 1949 states and 2694 transitions. [2024-10-14 03:26:20,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:20,397 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:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:20,404 INFO L225 Difference]: With dead ends: 1949 [2024-10-14 03:26:20,404 INFO L226 Difference]: Without dead ends: 1065 [2024-10-14 03:26:20,408 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:20,409 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 3 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 715 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:20,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 715 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:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-10-14 03:26:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1065. [2024-10-14 03:26:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 800 states have (on average 1.375) internal successors, (1100), 807 states have internal predecessors, (1100), 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:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1448 transitions. [2024-10-14 03:26:20,493 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1448 transitions. Word has length 82 [2024-10-14 03:26:20,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:20,494 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1448 transitions. [2024-10-14 03:26:20,494 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:20,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1448 transitions. [2024-10-14 03:26:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 03:26:20,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:20,496 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:20,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:26:20,496 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:20,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1106345292, now seen corresponding path program 1 times [2024-10-14 03:26:20,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:20,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41072956] [2024-10-14 03:26:20,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:20,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:20,631 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 37 [2024-10-14 03:26:20,633 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 42 [2024-10-14 03:26:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:26:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:20,662 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:20,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:20,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41072956] [2024-10-14 03:26:20,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41072956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:20,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:20,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:26:20,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014696899] [2024-10-14 03:26:20,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:20,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:26:20,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:20,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:26:20,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:20,666 INFO L87 Difference]: Start difference. First operand 1065 states and 1448 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:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:20,906 INFO L93 Difference]: Finished difference Result 1919 states and 2611 transitions. [2024-10-14 03:26:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:26:20,907 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:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:20,913 INFO L225 Difference]: With dead ends: 1919 [2024-10-14 03:26:20,913 INFO L226 Difference]: Without dead ends: 1093 [2024-10-14 03:26:20,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 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,915 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 239 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1403 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:20,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1403 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:20,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2024-10-14 03:26:20,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1059. [2024-10-14 03:26:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 805 states have (on average 1.368944099378882) internal successors, (1102), 817 states have internal predecessors, (1102), 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:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1426 transitions. [2024-10-14 03:26:20,993 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1426 transitions. Word has length 84 [2024-10-14 03:26:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:20,993 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1426 transitions. [2024-10-14 03:26:20,993 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:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1426 transitions. [2024-10-14 03:26:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 03:26:20,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:20,995 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:20,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:26:20,995 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:20,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:20,995 INFO L85 PathProgramCache]: Analyzing trace with hash 263672170, now seen corresponding path program 1 times [2024-10-14 03:26:20,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625840299] [2024-10-14 03:26:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:26:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 03:26:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:21,444 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,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:21,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625840299] [2024-10-14 03:26:21,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625840299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:21,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:21,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:26:21,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296124810] [2024-10-14 03:26:21,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:21,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:26:21,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:21,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:26:21,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:21,446 INFO L87 Difference]: Start difference. First operand 1059 states and 1426 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:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:21,696 INFO L93 Difference]: Finished difference Result 1895 states and 2559 transitions. [2024-10-14 03:26:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:26:21,697 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:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:21,703 INFO L225 Difference]: With dead ends: 1895 [2024-10-14 03:26:21,704 INFO L226 Difference]: Without dead ends: 1055 [2024-10-14 03:26:21,706 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:21,707 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 146 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1495 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:21,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1495 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:21,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2024-10-14 03:26:21,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 951. [2024-10-14 03:26:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 724 states have (on average 1.37292817679558) internal successors, (994), 734 states have internal predecessors, (994), 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:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1284 transitions. [2024-10-14 03:26:21,777 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1284 transitions. Word has length 86 [2024-10-14 03:26:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:21,778 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1284 transitions. [2024-10-14 03:26:21,778 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:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1284 transitions. [2024-10-14 03:26:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 03:26:21,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:21,779 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:21,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:26:21,779 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:21,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:21,779 INFO L85 PathProgramCache]: Analyzing trace with hash 966578310, now seen corresponding path program 1 times [2024-10-14 03:26:21,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:21,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834765234] [2024-10-14 03:26:21,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:21,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 03:26:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 03:26:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:22,272 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:22,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:22,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834765234] [2024-10-14 03:26:22,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834765234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:22,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:22,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:26:22,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977475105] [2024-10-14 03:26:22,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:22,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:26:22,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:22,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:26:22,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:26:22,274 INFO L87 Difference]: Start difference. First operand 951 states and 1284 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), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 03:26:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:22,849 INFO L93 Difference]: Finished difference Result 1842 states and 2478 transitions. [2024-10-14 03:26:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:26:22,850 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), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2024-10-14 03:26:22,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:22,859 INFO L225 Difference]: With dead ends: 1842 [2024-10-14 03:26:22,859 INFO L226 Difference]: Without dead ends: 1039 [2024-10-14 03:26:22,861 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:22,862 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 418 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:22,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1544 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:26:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-10-14 03:26:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 989. [2024-10-14 03:26:22,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 747 states have (on average 1.3493975903614457) internal successors, (1008), 758 states have internal predecessors, (1008), 154 states have call successors, (154), 87 states have call predecessors, (154), 87 states have return successors, (154), 143 states have call predecessors, (154), 154 states have call successors, (154) [2024-10-14 03:26:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1316 transitions. [2024-10-14 03:26:22,986 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1316 transitions. Word has length 87 [2024-10-14 03:26:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:22,987 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1316 transitions. [2024-10-14 03:26:22,987 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), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 03:26:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1316 transitions. [2024-10-14 03:26:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 03:26:22,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:22,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] [2024-10-14 03:26:22,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:26:22,989 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:22,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash -884367233, now seen corresponding path program 1 times [2024-10-14 03:26:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:22,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341188787] [2024-10-14 03:26:22,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:22,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:26:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 03:26:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 03:26:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:26:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:26:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:26:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:26:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:23,473 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:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341188787] [2024-10-14 03:26:23,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341188787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:23,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:23,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:26:23,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069560226] [2024-10-14 03:26:23,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:23,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:26:23,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:23,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:26:23,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:26:23,477 INFO L87 Difference]: Start difference. First operand 989 states and 1316 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 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,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:24,022 INFO L93 Difference]: Finished difference Result 1927 states and 2544 transitions. [2024-10-14 03:26:24,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:26:24,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 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 89 [2024-10-14 03:26:24,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:24,030 INFO L225 Difference]: With dead ends: 1927 [2024-10-14 03:26:24,030 INFO L226 Difference]: Without dead ends: 1099 [2024-10-14 03:26:24,033 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,034 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 514 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1325 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,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1325 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,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2024-10-14 03:26:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1011. [2024-10-14 03:26:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 761 states have (on average 1.3324572930354797) internal successors, (1014), 773 states have internal predecessors, (1014), 157 states have call successors, (157), 92 states have call predecessors, (157), 92 states have return successors, (157), 145 states have call predecessors, (157), 157 states have call successors, (157) [2024-10-14 03:26:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1328 transitions. [2024-10-14 03:26:24,179 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1328 transitions. Word has length 89 [2024-10-14 03:26:24,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:24,179 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1328 transitions. [2024-10-14 03:26:24,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 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,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1328 transitions. [2024-10-14 03:26:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:26:24,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:24,181 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:24,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:26:24,182 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:24,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:24,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2062173028, now seen corresponding path program 1 times [2024-10-14 03:26:24,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:24,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573876750] [2024-10-14 03:26:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:24,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:26:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 03:26:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:26:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 03:26:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:26:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:26:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:26:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,298 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,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:24,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573876750] [2024-10-14 03:26:24,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573876750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:24,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:24,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:24,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087981052] [2024-10-14 03:26:24,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:24,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:24,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:24,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:24,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:24,301 INFO L87 Difference]: Start difference. First operand 1011 states and 1328 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:24,551 INFO L93 Difference]: Finished difference Result 2659 states and 3514 transitions. [2024-10-14 03:26:24,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:26:24,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 90 [2024-10-14 03:26:24,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:24,563 INFO L225 Difference]: With dead ends: 2659 [2024-10-14 03:26:24,563 INFO L226 Difference]: Without dead ends: 1887 [2024-10-14 03:26:24,566 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:24,567 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 194 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1079 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:24,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1079 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:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2024-10-14 03:26:24,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1716. [2024-10-14 03:26:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1278 states have (on average 1.3309859154929577) internal successors, (1701), 1298 states have internal predecessors, (1701), 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:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2261 transitions. [2024-10-14 03:26:24,776 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2261 transitions. Word has length 90 [2024-10-14 03:26:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:24,776 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2261 transitions. [2024-10-14 03:26:24,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2261 transitions. [2024-10-14 03:26:24,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:26:24,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:24,778 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:24,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:26:24,779 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:24,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:24,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1157902383, now seen corresponding path program 1 times [2024-10-14 03:26:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:24,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205635050] [2024-10-14 03:26:24,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:24,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:26:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 03:26:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:26:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 03:26:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:26:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:26:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:26:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:24,898 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,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:24,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205635050] [2024-10-14 03:26:24,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205635050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:24,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:24,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:24,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588352609] [2024-10-14 03:26:24,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:24,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:24,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:24,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:24,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:24,902 INFO L87 Difference]: Start difference. First operand 1716 states and 2261 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:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:25,326 INFO L93 Difference]: Finished difference Result 4378 states and 5797 transitions. [2024-10-14 03:26:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:26:25,327 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:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:25,343 INFO L225 Difference]: With dead ends: 4378 [2024-10-14 03:26:25,343 INFO L226 Difference]: Without dead ends: 2968 [2024-10-14 03:26:25,348 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,349 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 201 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1115 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:25,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1115 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:25,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2024-10-14 03:26:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2717. [2024-10-14 03:26:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2004 states have (on average 1.318363273453094) internal successors, (2642), 2035 states have internal predecessors, (2642), 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:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3562 transitions. [2024-10-14 03:26:25,698 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3562 transitions. Word has length 92 [2024-10-14 03:26:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:25,698 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 3562 transitions. [2024-10-14 03:26:25,699 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:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3562 transitions. [2024-10-14 03:26:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:26:25,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:25,705 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:25,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:26:25,705 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:25,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:25,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1853622775, now seen corresponding path program 1 times [2024-10-14 03:26:25,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:25,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762345336] [2024-10-14 03:26:25,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:25,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:26:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:26:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 03:26:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 03:26:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 03:26:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 03:26:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:25,854 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:25,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:25,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762345336] [2024-10-14 03:26:25,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762345336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:25,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227074634] [2024-10-14 03:26:25,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:25,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:25,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:25,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:25,857 INFO L87 Difference]: Start difference. First operand 2717 states and 3562 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:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:26,341 INFO L93 Difference]: Finished difference Result 6377 states and 8393 transitions. [2024-10-14 03:26:26,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:26:26,342 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:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:26,361 INFO L225 Difference]: With dead ends: 6377 [2024-10-14 03:26:26,362 INFO L226 Difference]: Without dead ends: 4078 [2024-10-14 03:26:26,368 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:26,369 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 195 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1131 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:26,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1131 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:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4078 states. [2024-10-14 03:26:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4078 to 3905. [2024-10-14 03:26:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3905 states, 2868 states have (on average 1.3138075313807531) internal successors, (3768), 2912 states have internal predecessors, (3768), 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:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 5112 transitions. [2024-10-14 03:26:26,801 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 5112 transitions. Word has length 92 [2024-10-14 03:26:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:26,801 INFO L471 AbstractCegarLoop]: Abstraction has 3905 states and 5112 transitions. [2024-10-14 03:26:26,801 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:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 5112 transitions. [2024-10-14 03:26:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:26:26,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:26,803 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:26,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:26:26,804 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:26,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:26,804 INFO L85 PathProgramCache]: Analyzing trace with hash 117513798, now seen corresponding path program 1 times [2024-10-14 03:26:26,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:26,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406151210] [2024-10-14 03:26:26,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:26,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:26:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 03:26:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 03:26:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:26:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 03:26:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:26:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:26:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:26,866 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,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:26,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406151210] [2024-10-14 03:26:26,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406151210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:26,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:26,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:26:26,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041232922] [2024-10-14 03:26:26,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:26,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:26:26,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:26,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:26:26,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:26:26,869 INFO L87 Difference]: Start difference. First operand 3905 states and 5112 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:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:27,338 INFO L93 Difference]: Finished difference Result 7523 states and 9889 transitions. [2024-10-14 03:26:27,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:26:27,339 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:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:27,369 INFO L225 Difference]: With dead ends: 7523 [2024-10-14 03:26:27,369 INFO L226 Difference]: Without dead ends: 3938 [2024-10-14 03:26:27,381 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:27,382 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 6 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 462 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:27,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 462 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:27,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2024-10-14 03:26:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3911. [2024-10-14 03:26:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3911 states, 2874 states have (on average 1.313152400835073) internal successors, (3774), 2918 states have internal predecessors, (3774), 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:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3911 states to 3911 states and 5118 transitions. [2024-10-14 03:26:27,896 INFO L78 Accepts]: Start accepts. Automaton has 3911 states and 5118 transitions. Word has length 93 [2024-10-14 03:26:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:27,896 INFO L471 AbstractCegarLoop]: Abstraction has 3911 states and 5118 transitions. [2024-10-14 03:26:27,897 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:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3911 states and 5118 transitions. [2024-10-14 03:26:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 03:26:27,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:27,900 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:27,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 03:26:27,900 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:27,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash 923535218, now seen corresponding path program 1 times [2024-10-14 03:26:27,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:27,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573090162] [2024-10-14 03:26:27,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:27,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 03:26:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:26:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 03:26:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 03:26:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 03:26:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 03:26:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,089 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:28,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:28,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573090162] [2024-10-14 03:26:28,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573090162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:28,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:28,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:28,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609616329] [2024-10-14 03:26:28,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:28,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:28,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:28,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:28,093 INFO L87 Difference]: Start difference. First operand 3911 states and 5118 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:28,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:28,459 INFO L93 Difference]: Finished difference Result 7489 states and 9817 transitions. [2024-10-14 03:26:28,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:28,460 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:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:28,486 INFO L225 Difference]: With dead ends: 7489 [2024-10-14 03:26:28,487 INFO L226 Difference]: Without dead ends: 3640 [2024-10-14 03:26:28,498 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:28,498 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 74 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 698 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:28,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 698 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:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3640 states. [2024-10-14 03:26:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3640 to 3577. [2024-10-14 03:26:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 2623 states have (on average 1.321768966831872) internal successors, (3467), 2657 states have internal predecessors, (3467), 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:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4707 transitions. [2024-10-14 03:26:28,913 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4707 transitions. Word has length 94 [2024-10-14 03:26:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:28,914 INFO L471 AbstractCegarLoop]: Abstraction has 3577 states and 4707 transitions. [2024-10-14 03:26:28,914 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:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4707 transitions. [2024-10-14 03:26:28,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 03:26:28,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:28,916 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:28,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 03:26:28,916 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:28,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:28,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1269679630, now seen corresponding path program 1 times [2024-10-14 03:26:28,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:28,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334098630] [2024-10-14 03:26:28,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:26:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 03:26:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 03:26:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:26:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 03:26:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:26:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:26:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:28,985 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:28,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:28,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334098630] [2024-10-14 03:26:28,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334098630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:28,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:28,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:26:28,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155554488] [2024-10-14 03:26:28,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:28,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:26:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:28,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:26:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:26:28,987 INFO L87 Difference]: Start difference. First operand 3577 states and 4707 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:29,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:29,391 INFO L93 Difference]: Finished difference Result 7042 states and 9302 transitions. [2024-10-14 03:26:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:26:29,392 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:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:29,412 INFO L225 Difference]: With dead ends: 7042 [2024-10-14 03:26:29,412 INFO L226 Difference]: Without dead ends: 3628 [2024-10-14 03:26:29,420 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,421 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:29,425 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.1s Time] [2024-10-14 03:26:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2024-10-14 03:26:29,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3587. [2024-10-14 03:26:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3587 states, 2633 states have (on average 1.3205469046714775) internal successors, (3477), 2667 states have internal predecessors, (3477), 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:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 4717 transitions. [2024-10-14 03:26:29,752 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 4717 transitions. Word has length 95 [2024-10-14 03:26:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:29,752 INFO L471 AbstractCegarLoop]: Abstraction has 3587 states and 4717 transitions. [2024-10-14 03:26:29,753 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:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4717 transitions. [2024-10-14 03:26:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 03:26:29,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:29,755 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:29,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 03:26:29,755 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:29,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:29,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1910272599, now seen corresponding path program 1 times [2024-10-14 03:26:29,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:29,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448152933] [2024-10-14 03:26:29,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:29,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:26:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 03:26:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 03:26:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:26:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 03:26:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:26:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:26:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:29,889 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,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:29,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448152933] [2024-10-14 03:26:29,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448152933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:29,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:29,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:26:29,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233108615] [2024-10-14 03:26:29,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:29,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:26:29,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:29,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:26:29,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:26:29,892 INFO L87 Difference]: Start difference. First operand 3587 states and 4717 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:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:30,403 INFO L93 Difference]: Finished difference Result 6992 states and 9212 transitions. [2024-10-14 03:26:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:26:30,403 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:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:30,424 INFO L225 Difference]: With dead ends: 6992 [2024-10-14 03:26:30,424 INFO L226 Difference]: Without dead ends: 3510 [2024-10-14 03:26:30,435 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,436 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 56 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 703 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:30,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 703 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:30,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2024-10-14 03:26:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 2699. [2024-10-14 03:26:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 1979 states have (on average 1.3127842344618494) internal successors, (2598), 1998 states have internal predecessors, (2598), 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:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3536 transitions. [2024-10-14 03:26:30,844 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3536 transitions. Word has length 95 [2024-10-14 03:26:30,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:30,844 INFO L471 AbstractCegarLoop]: Abstraction has 2699 states and 3536 transitions. [2024-10-14 03:26:30,845 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:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3536 transitions. [2024-10-14 03:26:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 03:26:30,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:30,849 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] [2024-10-14 03:26:30,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 03:26:30,850 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:30,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:30,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1619272197, now seen corresponding path program 1 times [2024-10-14 03:26:30,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:30,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752337699] [2024-10-14 03:26:30,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:30,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:26:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:26:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:26:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:26:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:26:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:26:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:26:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 03:26:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 03:26:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 03:26:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 03:26:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 03:26:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 03:26:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,324 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:31,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:31,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752337699] [2024-10-14 03:26:31,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752337699] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:26:31,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060905829] [2024-10-14 03:26:31,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:31,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:26:31,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:26:31,327 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:31,329 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:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:31,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 03:26:31,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:26:31,848 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:31,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:26:32,173 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:32,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060905829] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:26:32,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:26:32,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 22 [2024-10-14 03:26:32,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184749804] [2024-10-14 03:26:32,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:26:32,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 03:26:32,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:32,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 03:26:32,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-14 03:26:32,177 INFO L87 Difference]: Start difference. First operand 2699 states and 3536 transitions. Second operand has 22 states, 22 states have (on average 9.909090909090908) internal successors, (218), 20 states have internal predecessors, (218), 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:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:37,114 INFO L93 Difference]: Finished difference Result 11267 states and 14692 transitions. [2024-10-14 03:26:37,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-14 03:26:37,114 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.909090909090908) internal successors, (218), 20 states have internal predecessors, (218), 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 139 [2024-10-14 03:26:37,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:37,150 INFO L225 Difference]: With dead ends: 11267 [2024-10-14 03:26:37,151 INFO L226 Difference]: Without dead ends: 8771 [2024-10-14 03:26:37,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1846 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1180, Invalid=5300, Unknown=0, NotChecked=0, Total=6480 [2024-10-14 03:26:37,164 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 4930 mSDsluCounter, 3130 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 1939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4930 SdHoareTripleChecker+Valid, 3471 SdHoareTripleChecker+Invalid, 3477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1939 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:37,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4930 Valid, 3471 Invalid, 3477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1939 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 03:26:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8771 states. [2024-10-14 03:26:38,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8771 to 7295. [2024-10-14 03:26:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7295 states, 5338 states have (on average 1.301611090295991) internal successors, (6948), 5390 states have internal predecessors, (6948), 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:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7295 states to 7295 states and 9466 transitions. [2024-10-14 03:26:38,279 INFO L78 Accepts]: Start accepts. Automaton has 7295 states and 9466 transitions. Word has length 139 [2024-10-14 03:26:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:38,280 INFO L471 AbstractCegarLoop]: Abstraction has 7295 states and 9466 transitions. [2024-10-14 03:26:38,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.909090909090908) internal successors, (218), 20 states have internal predecessors, (218), 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,280 INFO L276 IsEmpty]: Start isEmpty. Operand 7295 states and 9466 transitions. [2024-10-14 03:26:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 03:26:38,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:38,294 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] [2024-10-14 03:26:38,314 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:38,498 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:38,500 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:38,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:38,500 INFO L85 PathProgramCache]: Analyzing trace with hash -912342447, now seen corresponding path program 1 times [2024-10-14 03:26:38,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:38,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931027789] [2024-10-14 03:26:38,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:38,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:26:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 03:26:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 03:26:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:26:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:26:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:26:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:26:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 03:26:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 03:26:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 03:26:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 03:26:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 03:26:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 03:26:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:38,780 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:38,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:38,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931027789] [2024-10-14 03:26:38,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931027789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:26:38,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:26:38,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:26:38,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704217880] [2024-10-14 03:26:38,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:38,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:26:38,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:38,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:26:38,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:26:38,784 INFO L87 Difference]: Start difference. First operand 7295 states and 9466 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 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:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:40,836 INFO L93 Difference]: Finished difference Result 21189 states and 27598 transitions. [2024-10-14 03:26:40,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:26:40,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 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 142 [2024-10-14 03:26:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:40,901 INFO L225 Difference]: With dead ends: 21189 [2024-10-14 03:26:40,901 INFO L226 Difference]: Without dead ends: 14358 [2024-10-14 03:26:40,922 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:40,923 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 216 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 2043 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:40,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 2043 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:40,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14358 states. [2024-10-14 03:26:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14358 to 12126. [2024-10-14 03:26:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12126 states, 8805 states have (on average 1.3018739352640545) internal successors, (11463), 8895 states have internal predecessors, (11463), 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:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12126 states to 12126 states and 15785 transitions. [2024-10-14 03:26:42,354 INFO L78 Accepts]: Start accepts. Automaton has 12126 states and 15785 transitions. Word has length 142 [2024-10-14 03:26:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:42,355 INFO L471 AbstractCegarLoop]: Abstraction has 12126 states and 15785 transitions. [2024-10-14 03:26:42,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 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,356 INFO L276 IsEmpty]: Start isEmpty. Operand 12126 states and 15785 transitions. [2024-10-14 03:26:42,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 03:26:42,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:42,379 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, 1] [2024-10-14 03:26:42,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 03:26:42,380 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:42,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:42,380 INFO L85 PathProgramCache]: Analyzing trace with hash -576582895, now seen corresponding path program 1 times [2024-10-14 03:26:42,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:42,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070088633] [2024-10-14 03:26:42,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:42,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:26:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 03:26:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:26:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 03:26:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:26:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 03:26:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 03:26:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 03:26:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 03:26:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 03:26:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 03:26:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 03:26:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 03:26:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,322 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:43,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:43,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070088633] [2024-10-14 03:26:43,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070088633] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:26:43,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713833251] [2024-10-14 03:26:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:43,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:26:43,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:26:43,326 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:43,327 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:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:43,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 03:26:43,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:26:43,769 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:43,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:26:44,025 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:44,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713833251] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 03:26:44,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 03:26:44,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 11] total 25 [2024-10-14 03:26:44,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292629695] [2024-10-14 03:26:44,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:26:44,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:26:44,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:44,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:26:44,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:26:44,028 INFO L87 Difference]: Start difference. First operand 12126 states and 15785 transitions. Second operand has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:46,172 INFO L93 Difference]: Finished difference Result 23854 states and 31074 transitions. [2024-10-14 03:26:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:26:46,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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 142 [2024-10-14 03:26:46,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:46,225 INFO L225 Difference]: With dead ends: 23854 [2024-10-14 03:26:46,226 INFO L226 Difference]: Without dead ends: 12192 [2024-10-14 03:26:46,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2024-10-14 03:26:46,250 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 482 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:46,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1406 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:26:46,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12192 states. [2024-10-14 03:26:47,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12192 to 8240. [2024-10-14 03:26:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8240 states, 6013 states have (on average 1.3056710460668552) internal successors, (7851), 6068 states have internal predecessors, (7851), 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:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 10739 transitions. [2024-10-14 03:26:47,214 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 10739 transitions. Word has length 142 [2024-10-14 03:26:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:47,215 INFO L471 AbstractCegarLoop]: Abstraction has 8240 states and 10739 transitions. [2024-10-14 03:26:47,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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,215 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 10739 transitions. [2024-10-14 03:26:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 03:26:47,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:47,227 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, 1] [2024-10-14 03:26:47,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:26:47,427 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:47,428 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:47,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:47,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1201162170, now seen corresponding path program 1 times [2024-10-14 03:26:47,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:47,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505263735] [2024-10-14 03:26:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:47,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 03:26:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 03:26:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:26:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 03:26:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:26:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 03:26:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 03:26:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 03:26:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 03:26:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 03:26:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 03:26:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 03:26:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 03:26:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-14 03:26:48,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:48,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505263735] [2024-10-14 03:26:48,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505263735] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:26:48,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079274614] [2024-10-14 03:26:48,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:48,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:26:48,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:26:48,251 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:48,253 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:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:48,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 03:26:48,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:26:48,739 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:48,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:26:49,118 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:49,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079274614] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:26:49,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:26:49,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 24 [2024-10-14 03:26:49,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376613446] [2024-10-14 03:26:49,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:26:49,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 03:26:49,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:49,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 03:26:49,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2024-10-14 03:26:49,122 INFO L87 Difference]: Start difference. First operand 8240 states and 10739 transitions. Second operand has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 20 states have internal predecessors, (236), 7 states have call successors, (40), 5 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) [2024-10-14 03:26:53,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:26:53,240 INFO L93 Difference]: Finished difference Result 22119 states and 28777 transitions. [2024-10-14 03:26:53,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-14 03:26:53,240 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 20 states have internal predecessors, (236), 7 states have call successors, (40), 5 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) Word has length 143 [2024-10-14 03:26:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:26:53,308 INFO L225 Difference]: With dead ends: 22119 [2024-10-14 03:26:53,309 INFO L226 Difference]: Without dead ends: 14041 [2024-10-14 03:26:53,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=692, Invalid=3340, Unknown=0, NotChecked=0, Total=4032 [2024-10-14 03:26:53,333 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 1252 mSDsluCounter, 5650 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 6176 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:26:53,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 6176 Invalid, 3165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2708 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 03:26:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14041 states. [2024-10-14 03:26:54,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14041 to 7583. [2024-10-14 03:26:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7583 states, 5546 states have (on average 1.2958889289578075) internal successors, (7187), 5598 states have internal predecessors, (7187), 1319 states have call successors, (1319), 717 states have call predecessors, (1319), 717 states have return successors, (1319), 1267 states have call predecessors, (1319), 1319 states have call successors, (1319) [2024-10-14 03:26:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7583 states to 7583 states and 9825 transitions. [2024-10-14 03:26:54,764 INFO L78 Accepts]: Start accepts. Automaton has 7583 states and 9825 transitions. Word has length 143 [2024-10-14 03:26:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:26:54,765 INFO L471 AbstractCegarLoop]: Abstraction has 7583 states and 9825 transitions. [2024-10-14 03:26:54,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.833333333333334) internal successors, (236), 20 states have internal predecessors, (236), 7 states have call successors, (40), 5 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) [2024-10-14 03:26:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 7583 states and 9825 transitions. [2024-10-14 03:26:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 03:26:54,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:26:54,777 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:26:54,796 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:54,981 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:54,982 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:26:54,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:26:54,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1799095590, now seen corresponding path program 1 times [2024-10-14 03:26:54,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:26:54,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290524171] [2024-10-14 03:26:54,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:54,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:26:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:26:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:26:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 03:26:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 03:26:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:26:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:26:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:26:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:26:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:26:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:26:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 03:26:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 03:26:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 03:26:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 03:26:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 03:26:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-14 03:26:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:26:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290524171] [2024-10-14 03:26:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290524171] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:26:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685891270] [2024-10-14 03:26:55,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:26:55,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:26:55,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:26:55,787 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:55,788 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:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:26:55,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-14 03:26:55,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:26:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:26:56,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:26:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-14 03:26:57,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685891270] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:26:57,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:26:57,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 27 [2024-10-14 03:26:57,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599244187] [2024-10-14 03:26:57,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:26:57,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 03:26:57,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:26:57,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 03:26:57,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2024-10-14 03:26:57,168 INFO L87 Difference]: Start difference. First operand 7583 states and 9825 transitions. Second operand has 27 states, 27 states have (on average 8.296296296296296) internal successors, (224), 27 states have internal predecessors, (224), 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:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:01,743 INFO L93 Difference]: Finished difference Result 17557 states and 22769 transitions. [2024-10-14 03:27:01,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-14 03:27:01,743 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.296296296296296) internal successors, (224), 27 states have internal predecessors, (224), 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:01,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:01,793 INFO L225 Difference]: With dead ends: 17557 [2024-10-14 03:27:01,793 INFO L226 Difference]: Without dead ends: 10273 [2024-10-14 03:27:01,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=793, Invalid=4463, Unknown=0, NotChecked=0, Total=5256 [2024-10-14 03:27:01,819 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 1433 mSDsluCounter, 3544 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1433 SdHoareTripleChecker+Valid, 4033 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:01,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1433 Valid, 4033 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 1950 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:27:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10273 states. [2024-10-14 03:27:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10273 to 9868. [2024-10-14 03:27:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9868 states, 7219 states have (on average 1.2940850533314863) internal successors, (9342), 7288 states have internal predecessors, (9342), 1702 states have call successors, (1702), 946 states have call predecessors, (1702), 946 states have return successors, (1702), 1633 states have call predecessors, (1702), 1702 states have call successors, (1702) [2024-10-14 03:27:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9868 states to 9868 states and 12746 transitions. [2024-10-14 03:27:03,374 INFO L78 Accepts]: Start accepts. Automaton has 9868 states and 12746 transitions. Word has length 152 [2024-10-14 03:27:03,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:03,375 INFO L471 AbstractCegarLoop]: Abstraction has 9868 states and 12746 transitions. [2024-10-14 03:27:03,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.296296296296296) internal successors, (224), 27 states have internal predecessors, (224), 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:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 9868 states and 12746 transitions. [2024-10-14 03:27:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-14 03:27:03,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:03,384 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, 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] [2024-10-14 03:27:03,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 03:27:03,585 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,585 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:03,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:03,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1892160728, now seen corresponding path program 1 times [2024-10-14 03:27:03,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:03,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90913588] [2024-10-14 03:27:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:03,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:27:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 03:27:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 03:27:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:27:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:27:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:27:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:27:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:27:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:27:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 03:27:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 03:27:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 03:27:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 03:27:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 03:27:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-14 03:27:04,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:04,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90913588] [2024-10-14 03:27:04,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90913588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:04,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648526594] [2024-10-14 03:27:04,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:04,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:04,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:04,727 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:04,729 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:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:04,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-14 03:27:04,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:27:05,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:27:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-14 03:27:06,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648526594] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:27:06,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:27:06,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 27 [2024-10-14 03:27:06,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155838174] [2024-10-14 03:27:06,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:27:06,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 03:27:06,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:06,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 03:27:06,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2024-10-14 03:27:06,308 INFO L87 Difference]: Start difference. First operand 9868 states and 12746 transitions. Second operand has 27 states, 27 states have (on average 8.407407407407407) internal successors, (227), 27 states have internal predecessors, (227), 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:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:10,426 INFO L93 Difference]: Finished difference Result 19685 states and 25523 transitions. [2024-10-14 03:27:10,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-14 03:27:10,426 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.407407407407407) internal successors, (227), 27 states have internal predecessors, (227), 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 153 [2024-10-14 03:27:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:10,477 INFO L225 Difference]: With dead ends: 19685 [2024-10-14 03:27:10,478 INFO L226 Difference]: Without dead ends: 10263 [2024-10-14 03:27:10,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=484, Invalid=3056, Unknown=0, NotChecked=0, Total=3540 [2024-10-14 03:27:10,505 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 1273 mSDsluCounter, 5131 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 5592 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:10,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 5592 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:27:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10263 states. [2024-10-14 03:27:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10263 to 10008. [2024-10-14 03:27:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10008 states, 7347 states have (on average 1.294678099904723) internal successors, (9512), 7416 states have internal predecessors, (9512), 1708 states have call successors, (1708), 952 states have call predecessors, (1708), 952 states have return successors, (1708), 1639 states have call predecessors, (1708), 1708 states have call successors, (1708) [2024-10-14 03:27:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10008 states to 10008 states and 12928 transitions. [2024-10-14 03:27:12,207 INFO L78 Accepts]: Start accepts. Automaton has 10008 states and 12928 transitions. Word has length 153 [2024-10-14 03:27:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:12,207 INFO L471 AbstractCegarLoop]: Abstraction has 10008 states and 12928 transitions. [2024-10-14 03:27:12,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.407407407407407) internal successors, (227), 27 states have internal predecessors, (227), 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:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 10008 states and 12928 transitions. [2024-10-14 03:27:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-14 03:27:12,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:12,214 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, 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:27:12,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 03:27:12,414 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:12,415 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:12,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:12,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1077055979, now seen corresponding path program 1 times [2024-10-14 03:27:12,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:12,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233666206] [2024-10-14 03:27:12,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:12,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:27:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 03:27:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 03:27:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:27:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:27:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:27:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:27:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:27:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 03:27:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 03:27:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 03:27:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 03:27:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 03:27:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-14 03:27:12,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:12,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233666206] [2024-10-14 03:27:12,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233666206] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:12,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893434054] [2024-10-14 03:27:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:12,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:12,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:12,694 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:12,696 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:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 03:27:12,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-14 03:27:12,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:27:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-14 03:27:13,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893434054] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:27:13,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:27:13,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-10-14 03:27:13,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037696109] [2024-10-14 03:27:13,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:27:13,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:27:13,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:13,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:27:13,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:27:13,043 INFO L87 Difference]: Start difference. First operand 10008 states and 12928 transitions. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 8 states have internal predecessors, (131), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-14 03:27:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:14,917 INFO L93 Difference]: Finished difference Result 19987 states and 25801 transitions. [2024-10-14 03:27:14,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:27:14,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 8 states have internal predecessors, (131), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) Word has length 154 [2024-10-14 03:27:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:14,958 INFO L225 Difference]: With dead ends: 19987 [2024-10-14 03:27:14,958 INFO L226 Difference]: Without dead ends: 10200 [2024-10-14 03:27:14,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:27:14,977 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 75 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:14,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1401 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:27:14,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10200 states. [2024-10-14 03:27:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10200 to 10008. [2024-10-14 03:27:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10008 states, 7347 states have (on average 1.2939975500204164) internal successors, (9507), 7416 states have internal predecessors, (9507), 1708 states have call successors, (1708), 952 states have call predecessors, (1708), 952 states have return successors, (1708), 1639 states have call predecessors, (1708), 1708 states have call successors, (1708) [2024-10-14 03:27:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10008 states to 10008 states and 12923 transitions. [2024-10-14 03:27:16,598 INFO L78 Accepts]: Start accepts. Automaton has 10008 states and 12923 transitions. Word has length 154 [2024-10-14 03:27:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:16,598 INFO L471 AbstractCegarLoop]: Abstraction has 10008 states and 12923 transitions. [2024-10-14 03:27:16,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 8 states have internal predecessors, (131), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-14 03:27:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 10008 states and 12923 transitions. [2024-10-14 03:27:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 03:27:16,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:16,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,621 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:16,807 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:16,807 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:16,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash 948328635, now seen corresponding path program 1 times [2024-10-14 03:27:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:16,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600167579] [2024-10-14 03:27:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:16,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:27:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 03:27:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 03:27:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:27:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:27:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:27:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:27:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 03:27:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:27:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 03:27:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 03:27:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 03:27:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 03:27:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 03:27:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-14 03:27:17,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:17,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600167579] [2024-10-14 03:27:17,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600167579] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:17,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36378515] [2024-10-14 03:27:17,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:17,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:17,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:17,544 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:17,545 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:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 03:27:17,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 03:27:17,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:27:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-14 03:27:18,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36378515] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:27:18,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:27:18,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 23 [2024-10-14 03:27:18,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870255943] [2024-10-14 03:27:18,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:27:18,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 03:27:18,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:18,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 03:27:18,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:27:18,275 INFO L87 Difference]: Start difference. First operand 10008 states and 12923 transitions. Second operand has 23 states, 23 states have (on average 7.173913043478261) internal successors, (165), 18 states have internal predecessors, (165), 4 states have call successors, (29), 4 states have call predecessors, (29), 10 states have return successors, (32), 9 states have call predecessors, (32), 4 states have call successors, (32)