./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-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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 da0a9170cb1355df936e020ec31cd269723d3c83f610103689e93f9c7ac8eb3a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:36:30,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:36:30,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:36:30,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:36:30,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:36:30,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:36:30,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:36:30,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:36:30,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:36:30,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:36:30,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:36:30,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:36:30,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:36:30,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:36:30,304 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:36:30,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:36:30,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:36:30,304 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:36:30,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:36:30,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:36:30,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:36:30,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:36:30,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:36:30,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:36:30,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:36:30,309 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:36:30,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:36:30,309 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:36:30,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:36:30,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:36:30,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:36:30,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:36:30,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:36:30,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:36:30,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:36:30,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:36:30,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:36:30,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:36:30,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:36:30,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:36:30,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:36:30,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:36:30,313 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 -> da0a9170cb1355df936e020ec31cd269723d3c83f610103689e93f9c7ac8eb3a [2024-10-24 01:36:30,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:36:30,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:36:30,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:36:30,527 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:36:30,528 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:36:30,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-24 01:36:31,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:36:31,985 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:36:31,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-24 01:36:32,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1a382d9/82a84b5dacbc4c82ad734f6ff415e62a/FLAGf71674d4d [2024-10-24 01:36:32,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1a382d9/82a84b5dacbc4c82ad734f6ff415e62a [2024-10-24 01:36:32,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:36:32,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:36:32,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:36:32,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:36:32,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:36:32,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e7e52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32, skipping insertion in model container [2024-10-24 01:36:32,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:36:32,384 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-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14146,14159] [2024-10-24 01:36:32,397 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-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14793,14806] [2024-10-24 01:36:32,407 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-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16069,16082] [2024-10-24 01:36:32,416 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-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17045,17058] [2024-10-24 01:36:32,450 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-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25516,25529] [2024-10-24 01:36:32,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:36:32,496 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:36:32,588 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-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14146,14159] [2024-10-24 01:36:32,592 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-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14793,14806] [2024-10-24 01:36:32,599 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-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16069,16082] [2024-10-24 01:36:32,605 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-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17045,17058] [2024-10-24 01:36:32,635 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-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25516,25529] [2024-10-24 01:36:32,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:36:32,679 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:36:32,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32 WrapperNode [2024-10-24 01:36:32,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:36:32,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:36:32,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:36:32,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:36:32,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,750 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1639 [2024-10-24 01:36:32,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:36:32,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:36:32,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:36:32,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:36:32,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,797 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-24 01:36:32,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:36:32,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:36:32,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:36:32,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:36:32,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32" (1/1) ... [2024-10-24 01:36:32,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:36:32,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:36:32,885 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-24 01:36:32,890 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-24 01:36:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:36:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:36:32,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:36:32,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:36:33,050 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:36:33,052 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:36:34,079 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-24 01:36:34,079 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:36:34,153 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:36:34,154 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:36:34,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:36:34 BoogieIcfgContainer [2024-10-24 01:36:34,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:36:34,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:36:34,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:36:34,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:36:34,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:36:32" (1/3) ... [2024-10-24 01:36:34,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2211c152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:36:34, skipping insertion in model container [2024-10-24 01:36:34,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:36:32" (2/3) ... [2024-10-24 01:36:34,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2211c152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:36:34, skipping insertion in model container [2024-10-24 01:36:34,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:36:34" (3/3) ... [2024-10-24 01:36:34,164 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-24 01:36:34,178 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:36:34,178 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-10-24 01:36:34,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:36:34,244 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;@5216b018, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:36:34,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-24 01:36:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 386 states, 380 states have (on average 1.8289473684210527) internal successors, (695), 385 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:34,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 01:36:34,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:34,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:34,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:34,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:34,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1698524554, now seen corresponding path program 1 times [2024-10-24 01:36:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:34,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515221398] [2024-10-24 01:36:34,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:34,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:34,743 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-24 01:36:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:34,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515221398] [2024-10-24 01:36:34,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515221398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:34,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:34,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:34,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077392856] [2024-10-24 01:36:34,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:34,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:36:34,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:34,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:36:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:36:34,776 INFO L87 Difference]: Start difference. First operand has 386 states, 380 states have (on average 1.8289473684210527) internal successors, (695), 385 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:35,001 INFO L93 Difference]: Finished difference Result 713 states and 1272 transitions. [2024-10-24 01:36:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:36:35,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2024-10-24 01:36:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:35,021 INFO L225 Difference]: With dead ends: 713 [2024-10-24 01:36:35,021 INFO L226 Difference]: Without dead ends: 588 [2024-10-24 01:36:35,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 01:36:35,029 INFO L432 NwaCegarLoop]: 781 mSDtfsCounter, 423 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:35,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1238 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:36:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-10-24 01:36:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 586. [2024-10-24 01:36:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 581 states have (on average 1.4802065404475042) internal successors, (860), 585 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 860 transitions. [2024-10-24 01:36:35,078 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 860 transitions. Word has length 140 [2024-10-24 01:36:35,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:35,079 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 860 transitions. [2024-10-24 01:36:35,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 860 transitions. [2024-10-24 01:36:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 01:36:35,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:35,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:35,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:36:35,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:35,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:35,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1698955530, now seen corresponding path program 1 times [2024-10-24 01:36:35,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:35,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092044411] [2024-10-24 01:36:35,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:35,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:35,662 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-24 01:36:35,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:35,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092044411] [2024-10-24 01:36:35,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092044411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:35,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:35,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183273837] [2024-10-24 01:36:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:35,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:36:35,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:35,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:36:35,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:35,665 INFO L87 Difference]: Start difference. First operand 586 states and 860 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:35,754 INFO L93 Difference]: Finished difference Result 2253 states and 3287 transitions. [2024-10-24 01:36:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:36:35,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2024-10-24 01:36:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:35,760 INFO L225 Difference]: With dead ends: 2253 [2024-10-24 01:36:35,760 INFO L226 Difference]: Without dead ends: 1691 [2024-10-24 01:36:35,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:35,765 INFO L432 NwaCegarLoop]: 968 mSDtfsCounter, 998 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:35,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1963 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:36:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2024-10-24 01:36:35,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1102. [2024-10-24 01:36:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 1097 states have (on average 1.4694621695533272) internal successors, (1612), 1101 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1612 transitions. [2024-10-24 01:36:35,807 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1612 transitions. Word has length 140 [2024-10-24 01:36:35,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:35,808 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1612 transitions. [2024-10-24 01:36:35,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:35,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1612 transitions. [2024-10-24 01:36:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:36:35,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:35,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:35,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:36:35,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:35,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:35,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1124938092, now seen corresponding path program 1 times [2024-10-24 01:36:35,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:35,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500835260] [2024-10-24 01:36:35,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:35,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:35,886 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-24 01:36:35,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:35,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500835260] [2024-10-24 01:36:35,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500835260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:35,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:35,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:35,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410598651] [2024-10-24 01:36:35,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:35,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:36:35,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:35,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:36:35,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:36:35,888 INFO L87 Difference]: Start difference. First operand 1102 states and 1612 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:35,911 INFO L93 Difference]: Finished difference Result 2179 states and 3181 transitions. [2024-10-24 01:36:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:36:35,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2024-10-24 01:36:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:35,914 INFO L225 Difference]: With dead ends: 2179 [2024-10-24 01:36:35,914 INFO L226 Difference]: Without dead ends: 1104 [2024-10-24 01:36:35,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 01:36:35,917 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 0 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:35,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1095 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:36:35,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2024-10-24 01:36:35,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1104. [2024-10-24 01:36:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1099 states have (on average 1.4686078252957233) internal successors, (1614), 1103 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1614 transitions. [2024-10-24 01:36:35,933 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1614 transitions. Word has length 141 [2024-10-24 01:36:35,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:35,934 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1614 transitions. [2024-10-24 01:36:35,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1614 transitions. [2024-10-24 01:36:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 01:36:35,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:35,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:35,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:36:35,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:35,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash -973418926, now seen corresponding path program 1 times [2024-10-24 01:36:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:35,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366780768] [2024-10-24 01:36:35,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:35,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:36,033 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-24 01:36:36,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:36,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366780768] [2024-10-24 01:36:36,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366780768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:36,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:36,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:36,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527072587] [2024-10-24 01:36:36,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:36,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:36:36,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:36,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:36:36,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:36:36,035 INFO L87 Difference]: Start difference. First operand 1104 states and 1614 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:36,086 INFO L93 Difference]: Finished difference Result 3074 states and 4501 transitions. [2024-10-24 01:36:36,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:36:36,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2024-10-24 01:36:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:36,093 INFO L225 Difference]: With dead ends: 3074 [2024-10-24 01:36:36,093 INFO L226 Difference]: Without dead ends: 2145 [2024-10-24 01:36:36,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 01:36:36,097 INFO L432 NwaCegarLoop]: 1011 mSDtfsCounter, 478 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:36,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1518 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:36:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2024-10-24 01:36:36,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2107. [2024-10-24 01:36:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 2102 states have (on average 1.455756422454805) internal successors, (3060), 2106 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 3060 transitions. [2024-10-24 01:36:36,148 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 3060 transitions. Word has length 142 [2024-10-24 01:36:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:36,149 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 3060 transitions. [2024-10-24 01:36:36,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 3060 transitions. [2024-10-24 01:36:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 01:36:36,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:36,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:36,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:36:36,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:36,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:36,152 INFO L85 PathProgramCache]: Analyzing trace with hash 639743637, now seen corresponding path program 1 times [2024-10-24 01:36:36,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:36,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997820945] [2024-10-24 01:36:36,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:36,507 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-24 01:36:36,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:36,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997820945] [2024-10-24 01:36:36,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997820945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:36,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:36,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:36:36,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768512574] [2024-10-24 01:36:36,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:36,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:36:36,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:36,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:36:36,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:36,513 INFO L87 Difference]: Start difference. First operand 2107 states and 3060 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:36,543 INFO L93 Difference]: Finished difference Result 3558 states and 5174 transitions. [2024-10-24 01:36:36,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:36:36,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2024-10-24 01:36:36,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:36,549 INFO L225 Difference]: With dead ends: 3558 [2024-10-24 01:36:36,549 INFO L226 Difference]: Without dead ends: 1616 [2024-10-24 01:36:36,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:36,551 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 25 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:36,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1728 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:36:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2024-10-24 01:36:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1616. [2024-10-24 01:36:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1611 states have (on average 1.4494103041589075) internal successors, (2335), 1615 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2335 transitions. [2024-10-24 01:36:36,578 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2335 transitions. Word has length 142 [2024-10-24 01:36:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:36,579 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2335 transitions. [2024-10-24 01:36:36,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2335 transitions. [2024-10-24 01:36:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 01:36:36,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:36,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:36,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:36:36,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:36,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1618906701, now seen corresponding path program 1 times [2024-10-24 01:36:36,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:36,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458645721] [2024-10-24 01:36:36,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:36,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:36,952 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-24 01:36:36,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:36,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458645721] [2024-10-24 01:36:36,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458645721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:36,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:36,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:36:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669499268] [2024-10-24 01:36:36,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:36,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:36:36,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:36,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:36:36,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:36,954 INFO L87 Difference]: Start difference. First operand 1616 states and 2335 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:37,057 INFO L93 Difference]: Finished difference Result 3194 states and 4768 transitions. [2024-10-24 01:36:37,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:36:37,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2024-10-24 01:36:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:37,064 INFO L225 Difference]: With dead ends: 3194 [2024-10-24 01:36:37,064 INFO L226 Difference]: Without dead ends: 2612 [2024-10-24 01:36:37,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:37,066 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 876 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:37,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 984 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:36:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2612 states. [2024-10-24 01:36:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2612 to 2610. [2024-10-24 01:36:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2605 states have (on average 1.4610364683301345) internal successors, (3806), 2609 states have internal predecessors, (3806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3806 transitions. [2024-10-24 01:36:37,102 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3806 transitions. Word has length 148 [2024-10-24 01:36:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:37,103 INFO L471 AbstractCegarLoop]: Abstraction has 2610 states and 3806 transitions. [2024-10-24 01:36:37,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3806 transitions. [2024-10-24 01:36:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 01:36:37,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:37,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:37,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:36:37,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:37,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:37,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1415539251, now seen corresponding path program 1 times [2024-10-24 01:36:37,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:37,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646526616] [2024-10-24 01:36:37,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:37,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:37,396 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-24 01:36:37,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:37,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646526616] [2024-10-24 01:36:37,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646526616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:37,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:37,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:37,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968196903] [2024-10-24 01:36:37,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:37,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:36:37,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:37,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:36:37,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:37,398 INFO L87 Difference]: Start difference. First operand 2610 states and 3806 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:37,488 INFO L93 Difference]: Finished difference Result 6765 states and 9837 transitions. [2024-10-24 01:36:37,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:36:37,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2024-10-24 01:36:37,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:37,499 INFO L225 Difference]: With dead ends: 6765 [2024-10-24 01:36:37,499 INFO L226 Difference]: Without dead ends: 4173 [2024-10-24 01:36:37,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 01:36:37,503 INFO L432 NwaCegarLoop]: 792 mSDtfsCounter, 482 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:37,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 2048 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:36:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2024-10-24 01:36:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4143. [2024-10-24 01:36:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4138 states have (on average 1.4407926534557758) internal successors, (5962), 4142 states have internal predecessors, (5962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:37,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5962 transitions. [2024-10-24 01:36:37,566 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5962 transitions. Word has length 148 [2024-10-24 01:36:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:37,566 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 5962 transitions. [2024-10-24 01:36:37,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:37,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5962 transitions. [2024-10-24 01:36:37,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-24 01:36:37,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:37,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:37,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:36:37,570 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:37,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:37,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1960226256, now seen corresponding path program 1 times [2024-10-24 01:36:37,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:37,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595739010] [2024-10-24 01:36:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:37,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:37,626 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-24 01:36:37,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:37,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595739010] [2024-10-24 01:36:37,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595739010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:37,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:37,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:37,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650756253] [2024-10-24 01:36:37,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:37,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:36:37,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:37,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:36:37,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:36:37,629 INFO L87 Difference]: Start difference. First operand 4143 states and 5962 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:37,670 INFO L93 Difference]: Finished difference Result 9044 states and 13013 transitions. [2024-10-24 01:36:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:36:37,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2024-10-24 01:36:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:37,685 INFO L225 Difference]: With dead ends: 9044 [2024-10-24 01:36:37,685 INFO L226 Difference]: Without dead ends: 5818 [2024-10-24 01:36:37,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 01:36:37,691 INFO L432 NwaCegarLoop]: 999 mSDtfsCounter, 519 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:37,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1541 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:36:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5818 states. [2024-10-24 01:36:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5818 to 4143. [2024-10-24 01:36:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4138 states have (on average 1.4405509908168197) internal successors, (5961), 4142 states have internal predecessors, (5961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5961 transitions. [2024-10-24 01:36:37,801 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5961 transitions. Word has length 149 [2024-10-24 01:36:37,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:37,801 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 5961 transitions. [2024-10-24 01:36:37,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5961 transitions. [2024-10-24 01:36:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:36:37,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:37,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:37,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:36:37,806 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:37,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1574033763, now seen corresponding path program 1 times [2024-10-24 01:36:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:37,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841238650] [2024-10-24 01:36:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:37,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:37,874 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-24 01:36:37,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:37,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841238650] [2024-10-24 01:36:37,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841238650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:37,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:37,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:37,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419456111] [2024-10-24 01:36:37,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:37,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:36:37,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:37,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:36:37,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:36:37,876 INFO L87 Difference]: Start difference. First operand 4143 states and 5961 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:37,948 INFO L93 Difference]: Finished difference Result 10907 states and 15672 transitions. [2024-10-24 01:36:37,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:36:37,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-10-24 01:36:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:37,966 INFO L225 Difference]: With dead ends: 10907 [2024-10-24 01:36:37,967 INFO L226 Difference]: Without dead ends: 7094 [2024-10-24 01:36:37,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 01:36:37,973 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 470 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:37,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1511 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:36:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2024-10-24 01:36:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 7068. [2024-10-24 01:36:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7068 states, 7063 states have (on average 1.4166784652413988) internal successors, (10006), 7067 states have internal predecessors, (10006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7068 states to 7068 states and 10006 transitions. [2024-10-24 01:36:38,073 INFO L78 Accepts]: Start accepts. Automaton has 7068 states and 10006 transitions. Word has length 150 [2024-10-24 01:36:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:38,073 INFO L471 AbstractCegarLoop]: Abstraction has 7068 states and 10006 transitions. [2024-10-24 01:36:38,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 7068 states and 10006 transitions. [2024-10-24 01:36:38,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 01:36:38,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:38,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:38,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:36:38,080 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:38,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:38,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1271435424, now seen corresponding path program 1 times [2024-10-24 01:36:38,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:38,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744453393] [2024-10-24 01:36:38,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:38,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:38,400 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-24 01:36:38,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:38,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744453393] [2024-10-24 01:36:38,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744453393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:38,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:38,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:36:38,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640977171] [2024-10-24 01:36:38,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:38,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:36:38,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:38,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:36:38,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:38,402 INFO L87 Difference]: Start difference. First operand 7068 states and 10006 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:38,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:38,476 INFO L93 Difference]: Finished difference Result 11725 states and 16636 transitions. [2024-10-24 01:36:38,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:36:38,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-10-24 01:36:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:38,488 INFO L225 Difference]: With dead ends: 11725 [2024-10-24 01:36:38,489 INFO L226 Difference]: Without dead ends: 6427 [2024-10-24 01:36:38,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:38,493 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 19 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:38,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1706 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:36:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6427 states. [2024-10-24 01:36:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6427 to 6427. [2024-10-24 01:36:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6427 states, 6422 states have (on average 1.4201183431952662) internal successors, (9120), 6426 states have internal predecessors, (9120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6427 states to 6427 states and 9120 transitions. [2024-10-24 01:36:38,607 INFO L78 Accepts]: Start accepts. Automaton has 6427 states and 9120 transitions. Word has length 150 [2024-10-24 01:36:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:38,607 INFO L471 AbstractCegarLoop]: Abstraction has 6427 states and 9120 transitions. [2024-10-24 01:36:38,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 6427 states and 9120 transitions. [2024-10-24 01:36:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 01:36:38,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:38,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:38,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:36:38,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:38,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash 831740837, now seen corresponding path program 1 times [2024-10-24 01:36:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:38,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064232634] [2024-10-24 01:36:38,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:38,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:38,695 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-24 01:36:38,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:38,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064232634] [2024-10-24 01:36:38,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064232634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:38,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:38,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:38,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722335724] [2024-10-24 01:36:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:38,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:36:38,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:38,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:36:38,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:36:38,697 INFO L87 Difference]: Start difference. First operand 6427 states and 9120 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:38,931 INFO L93 Difference]: Finished difference Result 18187 states and 25947 transitions. [2024-10-24 01:36:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:36:38,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-10-24 01:36:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:38,952 INFO L225 Difference]: With dead ends: 18187 [2024-10-24 01:36:38,953 INFO L226 Difference]: Without dead ends: 12518 [2024-10-24 01:36:38,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 01:36:38,963 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 457 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:38,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 875 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:36:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12518 states. [2024-10-24 01:36:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12518 to 12464. [2024-10-24 01:36:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12464 states, 12459 states have (on average 1.4123123846215586) internal successors, (17596), 12463 states have internal predecessors, (17596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12464 states to 12464 states and 17596 transitions. [2024-10-24 01:36:39,228 INFO L78 Accepts]: Start accepts. Automaton has 12464 states and 17596 transitions. Word has length 156 [2024-10-24 01:36:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:39,228 INFO L471 AbstractCegarLoop]: Abstraction has 12464 states and 17596 transitions. [2024-10-24 01:36:39,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 12464 states and 17596 transitions. [2024-10-24 01:36:39,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 01:36:39,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:39,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:39,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:36:39,239 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:39,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:39,240 INFO L85 PathProgramCache]: Analyzing trace with hash 400986186, now seen corresponding path program 1 times [2024-10-24 01:36:39,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:39,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364144888] [2024-10-24 01:36:39,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:39,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:39,726 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-24 01:36:39,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:39,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364144888] [2024-10-24 01:36:39,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364144888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:39,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:39,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 01:36:39,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435942261] [2024-10-24 01:36:39,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:39,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:36:39,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:39,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:36:39,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:36:39,729 INFO L87 Difference]: Start difference. First operand 12464 states and 17596 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:40,002 INFO L93 Difference]: Finished difference Result 16272 states and 23683 transitions. [2024-10-24 01:36:40,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:36:40,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-10-24 01:36:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:40,021 INFO L225 Difference]: With dead ends: 16272 [2024-10-24 01:36:40,021 INFO L226 Difference]: Without dead ends: 11266 [2024-10-24 01:36:40,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:36:40,031 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 1302 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 2754 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:40,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 2754 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:36:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11266 states. [2024-10-24 01:36:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11266 to 11264. [2024-10-24 01:36:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11264 states, 11259 states have (on average 1.3833377742250643) internal successors, (15575), 11263 states have internal predecessors, (15575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11264 states to 11264 states and 15575 transitions. [2024-10-24 01:36:40,275 INFO L78 Accepts]: Start accepts. Automaton has 11264 states and 15575 transitions. Word has length 156 [2024-10-24 01:36:40,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:40,275 INFO L471 AbstractCegarLoop]: Abstraction has 11264 states and 15575 transitions. [2024-10-24 01:36:40,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 11264 states and 15575 transitions. [2024-10-24 01:36:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 01:36:40,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:40,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:40,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:36:40,289 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:40,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:40,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1745181395, now seen corresponding path program 1 times [2024-10-24 01:36:40,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:40,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520515478] [2024-10-24 01:36:40,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:40,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:40,546 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-24 01:36:40,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:40,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520515478] [2024-10-24 01:36:40,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520515478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:40,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:40,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:40,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480207099] [2024-10-24 01:36:40,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:40,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:36:40,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:40,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:36:40,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:40,548 INFO L87 Difference]: Start difference. First operand 11264 states and 15575 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:40,841 INFO L93 Difference]: Finished difference Result 54813 states and 75534 transitions. [2024-10-24 01:36:40,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:36:40,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-10-24 01:36:40,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:40,912 INFO L225 Difference]: With dead ends: 54813 [2024-10-24 01:36:40,912 INFO L226 Difference]: Without dead ends: 43587 [2024-10-24 01:36:40,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 01:36:40,938 INFO L432 NwaCegarLoop]: 949 mSDtfsCounter, 1534 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:40,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 2444 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:36:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43587 states. [2024-10-24 01:36:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43587 to 21785. [2024-10-24 01:36:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21785 states, 21780 states have (on average 1.366115702479339) internal successors, (29754), 21784 states have internal predecessors, (29754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:41,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21785 states to 21785 states and 29754 transitions. [2024-10-24 01:36:41,533 INFO L78 Accepts]: Start accepts. Automaton has 21785 states and 29754 transitions. Word has length 156 [2024-10-24 01:36:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:41,534 INFO L471 AbstractCegarLoop]: Abstraction has 21785 states and 29754 transitions. [2024-10-24 01:36:41,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 21785 states and 29754 transitions. [2024-10-24 01:36:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 01:36:41,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:41,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:41,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:36:41,553 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:41,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1520485193, now seen corresponding path program 1 times [2024-10-24 01:36:41,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:41,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391305292] [2024-10-24 01:36:41,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:41,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:41,605 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-24 01:36:41,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:41,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391305292] [2024-10-24 01:36:41,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391305292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:41,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:41,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:41,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193393226] [2024-10-24 01:36:41,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:41,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:36:41,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:41,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:36:41,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:36:41,607 INFO L87 Difference]: Start difference. First operand 21785 states and 29754 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:41,677 INFO L93 Difference]: Finished difference Result 43473 states and 59381 transitions. [2024-10-24 01:36:41,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:36:41,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2024-10-24 01:36:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:41,705 INFO L225 Difference]: With dead ends: 43473 [2024-10-24 01:36:41,705 INFO L226 Difference]: Without dead ends: 21791 [2024-10-24 01:36:41,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 01:36:41,727 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:41,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1087 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:36:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21791 states. [2024-10-24 01:36:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21791 to 21791. [2024-10-24 01:36:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21791 states, 21786 states have (on average 1.3660148719361058) internal successors, (29760), 21790 states have internal predecessors, (29760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21791 states to 21791 states and 29760 transitions. [2024-10-24 01:36:42,065 INFO L78 Accepts]: Start accepts. Automaton has 21791 states and 29760 transitions. Word has length 157 [2024-10-24 01:36:42,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:42,065 INFO L471 AbstractCegarLoop]: Abstraction has 21791 states and 29760 transitions. [2024-10-24 01:36:42,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 21791 states and 29760 transitions. [2024-10-24 01:36:42,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 01:36:42,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:42,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:42,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:36:42,084 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:42,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1175383643, now seen corresponding path program 1 times [2024-10-24 01:36:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:42,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11490255] [2024-10-24 01:36:42,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:42,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:42,153 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-24 01:36:42,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:42,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11490255] [2024-10-24 01:36:42,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11490255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:42,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:42,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:42,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717062394] [2024-10-24 01:36:42,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:42,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:36:42,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:42,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:36:42,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:36:42,155 INFO L87 Difference]: Start difference. First operand 21791 states and 29760 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:42,409 INFO L93 Difference]: Finished difference Result 63139 states and 86024 transitions. [2024-10-24 01:36:42,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:36:42,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2024-10-24 01:36:42,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:42,470 INFO L225 Difference]: With dead ends: 63139 [2024-10-24 01:36:42,470 INFO L226 Difference]: Without dead ends: 42281 [2024-10-24 01:36:42,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 01:36:42,496 INFO L432 NwaCegarLoop]: 1024 mSDtfsCounter, 465 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:42,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1531 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:36:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42281 states. [2024-10-24 01:36:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42281 to 42227. [2024-10-24 01:36:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42227 states, 42222 states have (on average 1.3471176164085075) internal successors, (56878), 42226 states have internal predecessors, (56878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42227 states to 42227 states and 56878 transitions. [2024-10-24 01:36:43,145 INFO L78 Accepts]: Start accepts. Automaton has 42227 states and 56878 transitions. Word has length 158 [2024-10-24 01:36:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:43,145 INFO L471 AbstractCegarLoop]: Abstraction has 42227 states and 56878 transitions. [2024-10-24 01:36:43,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 42227 states and 56878 transitions. [2024-10-24 01:36:43,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 01:36:43,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:43,185 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:43,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:36:43,185 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:43,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:43,186 INFO L85 PathProgramCache]: Analyzing trace with hash 994487656, now seen corresponding path program 1 times [2024-10-24 01:36:43,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:43,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984167704] [2024-10-24 01:36:43,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:43,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:43,627 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-24 01:36:43,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:43,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984167704] [2024-10-24 01:36:43,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984167704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:43,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:43,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:43,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288601272] [2024-10-24 01:36:43,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:43,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:36:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:43,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:36:43,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:43,628 INFO L87 Difference]: Start difference. First operand 42227 states and 56878 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:43,775 INFO L93 Difference]: Finished difference Result 72287 states and 97526 transitions. [2024-10-24 01:36:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:36:43,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2024-10-24 01:36:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:43,832 INFO L225 Difference]: With dead ends: 72287 [2024-10-24 01:36:43,832 INFO L226 Difference]: Without dead ends: 42591 [2024-10-24 01:36:43,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:43,860 INFO L432 NwaCegarLoop]: 932 mSDtfsCounter, 477 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:43,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1880 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:36:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42591 states. [2024-10-24 01:36:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42591 to 42385. [2024-10-24 01:36:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42385 states, 42380 states have (on average 1.34624823029731) internal successors, (57054), 42384 states have internal predecessors, (57054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42385 states to 42385 states and 57054 transitions. [2024-10-24 01:36:44,424 INFO L78 Accepts]: Start accepts. Automaton has 42385 states and 57054 transitions. Word has length 158 [2024-10-24 01:36:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:44,424 INFO L471 AbstractCegarLoop]: Abstraction has 42385 states and 57054 transitions. [2024-10-24 01:36:44,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 42385 states and 57054 transitions. [2024-10-24 01:36:44,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 01:36:44,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:44,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:44,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:36:44,451 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:44,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash -189491316, now seen corresponding path program 1 times [2024-10-24 01:36:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:44,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515416745] [2024-10-24 01:36:44,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:44,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:44,738 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-24 01:36:44,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:44,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515416745] [2024-10-24 01:36:44,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515416745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:44,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:44,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435789062] [2024-10-24 01:36:44,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:44,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:36:44,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:44,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:36:44,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:44,740 INFO L87 Difference]: Start difference. First operand 42385 states and 57054 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:45,249 INFO L93 Difference]: Finished difference Result 128323 states and 172490 transitions. [2024-10-24 01:36:45,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:36:45,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2024-10-24 01:36:45,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:45,408 INFO L225 Difference]: With dead ends: 128323 [2024-10-24 01:36:45,409 INFO L226 Difference]: Without dead ends: 86223 [2024-10-24 01:36:45,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 01:36:45,462 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 1516 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:45,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 2340 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:36:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86223 states. [2024-10-24 01:36:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86223 to 42649. [2024-10-24 01:36:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42649 states, 42644 states have (on average 1.3448785292186474) internal successors, (57351), 42648 states have internal predecessors, (57351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42649 states to 42649 states and 57351 transitions. [2024-10-24 01:36:46,396 INFO L78 Accepts]: Start accepts. Automaton has 42649 states and 57351 transitions. Word has length 158 [2024-10-24 01:36:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:46,396 INFO L471 AbstractCegarLoop]: Abstraction has 42649 states and 57351 transitions. [2024-10-24 01:36:46,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 42649 states and 57351 transitions. [2024-10-24 01:36:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-24 01:36:46,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:46,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:46,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:36:46,615 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:46,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:46,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1175066184, now seen corresponding path program 1 times [2024-10-24 01:36:46,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:46,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432639887] [2024-10-24 01:36:46,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:46,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:46,686 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-24 01:36:46,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:46,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432639887] [2024-10-24 01:36:46,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432639887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:46,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:46,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:46,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385338336] [2024-10-24 01:36:46,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:46,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:36:46,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:46,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:36:46,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:36:46,689 INFO L87 Difference]: Start difference. First operand 42649 states and 57351 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:46,824 INFO L93 Difference]: Finished difference Result 84147 states and 113334 transitions. [2024-10-24 01:36:46,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:36:46,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2024-10-24 01:36:46,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:46,886 INFO L225 Difference]: With dead ends: 84147 [2024-10-24 01:36:46,886 INFO L226 Difference]: Without dead ends: 42669 [2024-10-24 01:36:46,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 01:36:46,921 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:46,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1087 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:36:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42669 states. [2024-10-24 01:36:47,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42669 to 42669. [2024-10-24 01:36:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42669 states, 42664 states have (on average 1.3447168573035815) internal successors, (57371), 42668 states have internal predecessors, (57371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42669 states to 42669 states and 57371 transitions. [2024-10-24 01:36:47,677 INFO L78 Accepts]: Start accepts. Automaton has 42669 states and 57371 transitions. Word has length 159 [2024-10-24 01:36:47,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:47,678 INFO L471 AbstractCegarLoop]: Abstraction has 42669 states and 57371 transitions. [2024-10-24 01:36:47,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:47,678 INFO L276 IsEmpty]: Start isEmpty. Operand 42669 states and 57371 transitions. [2024-10-24 01:36:47,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 01:36:47,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:47,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:47,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:36:47,714 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:47,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash 446416235, now seen corresponding path program 1 times [2024-10-24 01:36:47,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:47,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063868607] [2024-10-24 01:36:47,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:47,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:48,140 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-24 01:36:48,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:48,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063868607] [2024-10-24 01:36:48,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063868607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:48,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:48,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:36:48,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470174899] [2024-10-24 01:36:48,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:48,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:36:48,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:48,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:36:48,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:48,143 INFO L87 Difference]: Start difference. First operand 42669 states and 57371 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:48,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:48,270 INFO L93 Difference]: Finished difference Result 71371 states and 95843 transitions. [2024-10-24 01:36:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:36:48,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2024-10-24 01:36:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:48,299 INFO L225 Difference]: With dead ends: 71371 [2024-10-24 01:36:48,299 INFO L226 Difference]: Without dead ends: 28757 [2024-10-24 01:36:48,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:48,325 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 12 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:48,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1687 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:36:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28757 states. [2024-10-24 01:36:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28757 to 28757. [2024-10-24 01:36:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28757 states, 28752 states have (on average 1.3404980523094046) internal successors, (38542), 28756 states have internal predecessors, (38542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28757 states to 28757 states and 38542 transitions. [2024-10-24 01:36:48,742 INFO L78 Accepts]: Start accepts. Automaton has 28757 states and 38542 transitions. Word has length 160 [2024-10-24 01:36:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:48,742 INFO L471 AbstractCegarLoop]: Abstraction has 28757 states and 38542 transitions. [2024-10-24 01:36:48,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:48,743 INFO L276 IsEmpty]: Start isEmpty. Operand 28757 states and 38542 transitions. [2024-10-24 01:36:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 01:36:48,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:48,758 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:48,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:36:48,758 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:48,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash 550043268, now seen corresponding path program 1 times [2024-10-24 01:36:48,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:48,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646761028] [2024-10-24 01:36:48,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:48,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:48,864 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-24 01:36:48,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:48,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646761028] [2024-10-24 01:36:48,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646761028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:48,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:48,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:36:48,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248908337] [2024-10-24 01:36:48,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:48,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:36:48,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:48,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:36:48,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:36:48,866 INFO L87 Difference]: Start difference. First operand 28757 states and 38542 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:49,104 INFO L93 Difference]: Finished difference Result 56434 states and 75810 transitions. [2024-10-24 01:36:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:36:49,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-10-24 01:36:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:49,133 INFO L225 Difference]: With dead ends: 56434 [2024-10-24 01:36:49,134 INFO L226 Difference]: Without dead ends: 28757 [2024-10-24 01:36:49,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-24 01:36:49,155 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 1454 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:49,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1454 Valid, 496 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:36:49,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28757 states. [2024-10-24 01:36:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28757 to 28757. [2024-10-24 01:36:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28757 states, 28752 states have (on average 1.323594880356149) internal successors, (38056), 28756 states have internal predecessors, (38056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28757 states to 28757 states and 38056 transitions. [2024-10-24 01:36:49,523 INFO L78 Accepts]: Start accepts. Automaton has 28757 states and 38056 transitions. Word has length 168 [2024-10-24 01:36:49,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:49,523 INFO L471 AbstractCegarLoop]: Abstraction has 28757 states and 38056 transitions. [2024-10-24 01:36:49,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 28757 states and 38056 transitions. [2024-10-24 01:36:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 01:36:49,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:49,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:49,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:36:49,537 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:49,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1580081503, now seen corresponding path program 1 times [2024-10-24 01:36:49,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:49,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979286002] [2024-10-24 01:36:49,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:49,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:49,771 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-24 01:36:49,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:49,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979286002] [2024-10-24 01:36:49,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979286002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:49,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:49,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:36:49,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046346296] [2024-10-24 01:36:49,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:49,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:36:49,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:49,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:36:49,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:49,773 INFO L87 Difference]: Start difference. First operand 28757 states and 38056 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:50,072 INFO L93 Difference]: Finished difference Result 52675 states and 71257 transitions. [2024-10-24 01:36:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:36:50,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-10-24 01:36:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:50,104 INFO L225 Difference]: With dead ends: 52675 [2024-10-24 01:36:50,104 INFO L226 Difference]: Without dead ends: 41244 [2024-10-24 01:36:50,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:50,115 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 852 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:50,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 936 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:36:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41244 states. [2024-10-24 01:36:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41244 to 41242. [2024-10-24 01:36:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41242 states, 41237 states have (on average 1.3042413366636758) internal successors, (53783), 41241 states have internal predecessors, (53783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41242 states to 41242 states and 53783 transitions. [2024-10-24 01:36:50,686 INFO L78 Accepts]: Start accepts. Automaton has 41242 states and 53783 transitions. Word has length 168 [2024-10-24 01:36:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:50,686 INFO L471 AbstractCegarLoop]: Abstraction has 41242 states and 53783 transitions. [2024-10-24 01:36:50,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 41242 states and 53783 transitions. [2024-10-24 01:36:50,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 01:36:50,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:50,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:50,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:36:50,714 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:50,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:50,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1293467271, now seen corresponding path program 1 times [2024-10-24 01:36:50,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:50,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176002743] [2024-10-24 01:36:50,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:51,117 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-24 01:36:51,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:51,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176002743] [2024-10-24 01:36:51,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176002743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:51,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:51,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:36:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498174896] [2024-10-24 01:36:51,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:51,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:36:51,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:51,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:36:51,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:51,119 INFO L87 Difference]: Start difference. First operand 41242 states and 53783 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:51,287 INFO L93 Difference]: Finished difference Result 82742 states and 107852 transitions. [2024-10-24 01:36:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:36:51,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-10-24 01:36:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:51,326 INFO L225 Difference]: With dead ends: 82742 [2024-10-24 01:36:51,326 INFO L226 Difference]: Without dead ends: 41839 [2024-10-24 01:36:51,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-24 01:36:51,354 INFO L432 NwaCegarLoop]: 910 mSDtfsCounter, 471 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 2248 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:51,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 2248 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:36:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41839 states. [2024-10-24 01:36:51,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41839 to 41530. [2024-10-24 01:36:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41530 states, 41525 states have (on average 1.3025888019265504) internal successors, (54090), 41529 states have internal predecessors, (54090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41530 states to 41530 states and 54090 transitions. [2024-10-24 01:36:51,882 INFO L78 Accepts]: Start accepts. Automaton has 41530 states and 54090 transitions. Word has length 168 [2024-10-24 01:36:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:51,882 INFO L471 AbstractCegarLoop]: Abstraction has 41530 states and 54090 transitions. [2024-10-24 01:36:51,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 41530 states and 54090 transitions. [2024-10-24 01:36:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 01:36:51,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:51,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:51,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:36:51,909 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:51,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:51,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1372328206, now seen corresponding path program 1 times [2024-10-24 01:36:51,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:51,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728013895] [2024-10-24 01:36:51,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:52,164 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-24 01:36:52,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:52,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728013895] [2024-10-24 01:36:52,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728013895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:52,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:52,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:36:52,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808277937] [2024-10-24 01:36:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:52,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:36:52,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:52,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:36:52,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:52,167 INFO L87 Difference]: Start difference. First operand 41530 states and 54090 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:36:52,283 INFO L93 Difference]: Finished difference Result 59377 states and 77282 transitions. [2024-10-24 01:36:52,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:36:52,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-10-24 01:36:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:36:52,318 INFO L225 Difference]: With dead ends: 59377 [2024-10-24 01:36:52,318 INFO L226 Difference]: Without dead ends: 35957 [2024-10-24 01:36:52,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:36:52,342 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 2 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:36:52,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1632 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:36:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35957 states. [2024-10-24 01:36:52,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35957 to 35957. [2024-10-24 01:36:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35957 states, 35952 states have (on average 1.302097240765465) internal successors, (46813), 35956 states have internal predecessors, (46813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35957 states to 35957 states and 46813 transitions. [2024-10-24 01:36:52,812 INFO L78 Accepts]: Start accepts. Automaton has 35957 states and 46813 transitions. Word has length 168 [2024-10-24 01:36:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:36:52,813 INFO L471 AbstractCegarLoop]: Abstraction has 35957 states and 46813 transitions. [2024-10-24 01:36:52,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:36:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 35957 states and 46813 transitions. [2024-10-24 01:36:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 01:36:52,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:36:52,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:36:52,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 01:36:52,834 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:36:52,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:36:52,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1026916521, now seen corresponding path program 1 times [2024-10-24 01:36:52,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:36:52,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805476914] [2024-10-24 01:36:52,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:36:52,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:36:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:36:55,050 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-24 01:36:55,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:36:55,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805476914] [2024-10-24 01:36:55,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805476914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:36:55,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:36:55,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-24 01:36:55,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119600313] [2024-10-24 01:36:55,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:36:55,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 01:36:55,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:36:55,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 01:36:55,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:36:55,053 INFO L87 Difference]: Start difference. First operand 35957 states and 46813 transitions. Second operand has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:01,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:37:01,749 INFO L93 Difference]: Finished difference Result 76542 states and 106019 transitions. [2024-10-24 01:37:01,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-24 01:37:01,749 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2024-10-24 01:37:01,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:37:01,821 INFO L225 Difference]: With dead ends: 76542 [2024-10-24 01:37:01,821 INFO L226 Difference]: Without dead ends: 72122 [2024-10-24 01:37:01,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2024-10-24 01:37:01,833 INFO L432 NwaCegarLoop]: 1229 mSDtfsCounter, 7324 mSDsluCounter, 16136 mSDsCounter, 0 mSdLazyCounter, 5633 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7324 SdHoareTripleChecker+Valid, 17365 SdHoareTripleChecker+Invalid, 5799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 5633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:37:01,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7324 Valid, 17365 Invalid, 5799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 5633 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 01:37:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72122 states. [2024-10-24 01:37:02,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72122 to 37323. [2024-10-24 01:37:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37323 states, 37318 states have (on average 1.297818746985369) internal successors, (48432), 37322 states have internal predecessors, (48432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37323 states to 37323 states and 48432 transitions. [2024-10-24 01:37:02,393 INFO L78 Accepts]: Start accepts. Automaton has 37323 states and 48432 transitions. Word has length 170 [2024-10-24 01:37:02,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:37:02,393 INFO L471 AbstractCegarLoop]: Abstraction has 37323 states and 48432 transitions. [2024-10-24 01:37:02,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 37323 states and 48432 transitions. [2024-10-24 01:37:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 01:37:02,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:37:02,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:37:02,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 01:37:02,418 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:37:02,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:37:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1705310020, now seen corresponding path program 1 times [2024-10-24 01:37:02,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:37:02,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082210295] [2024-10-24 01:37:02,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:37:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:37:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:37:02,797 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-24 01:37:02,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:37:02,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082210295] [2024-10-24 01:37:02,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082210295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:37:02,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:37:02,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 01:37:02,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95651724] [2024-10-24 01:37:02,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:37:02,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 01:37:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:37:02,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 01:37:02,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:37:02,799 INFO L87 Difference]: Start difference. First operand 37323 states and 48432 transitions. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:37:03,027 INFO L93 Difference]: Finished difference Result 60981 states and 80207 transitions. [2024-10-24 01:37:03,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:37:03,027 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2024-10-24 01:37:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:37:03,055 INFO L225 Difference]: With dead ends: 60981 [2024-10-24 01:37:03,056 INFO L226 Difference]: Without dead ends: 25898 [2024-10-24 01:37:03,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:37:03,081 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 1935 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1935 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:37:03,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1935 Valid, 585 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:37:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25898 states. [2024-10-24 01:37:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25898 to 20339. [2024-10-24 01:37:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20339 states, 20334 states have (on average 1.2814497885315235) internal successors, (26057), 20338 states have internal predecessors, (26057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20339 states to 20339 states and 26057 transitions. [2024-10-24 01:37:03,295 INFO L78 Accepts]: Start accepts. Automaton has 20339 states and 26057 transitions. Word has length 170 [2024-10-24 01:37:03,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:37:03,296 INFO L471 AbstractCegarLoop]: Abstraction has 20339 states and 26057 transitions. [2024-10-24 01:37:03,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 20339 states and 26057 transitions. [2024-10-24 01:37:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 01:37:03,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:37:03,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:37:03,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 01:37:03,308 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:37:03,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:37:03,309 INFO L85 PathProgramCache]: Analyzing trace with hash -617238689, now seen corresponding path program 1 times [2024-10-24 01:37:03,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:37:03,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721050708] [2024-10-24 01:37:03,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:37:03,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:37:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:37:05,082 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-24 01:37:05,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:37:05,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721050708] [2024-10-24 01:37:05,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721050708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:37:05,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:37:05,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-24 01:37:05,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715878090] [2024-10-24 01:37:05,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:37:05,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 01:37:05,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:37:05,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 01:37:05,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:37:05,085 INFO L87 Difference]: Start difference. First operand 20339 states and 26057 transitions. Second operand has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:37:10,864 INFO L93 Difference]: Finished difference Result 35478 states and 47518 transitions. [2024-10-24 01:37:10,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-24 01:37:10,864 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2024-10-24 01:37:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:37:10,904 INFO L225 Difference]: With dead ends: 35478 [2024-10-24 01:37:10,904 INFO L226 Difference]: Without dead ends: 34166 [2024-10-24 01:37:10,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=497, Invalid=1759, Unknown=0, NotChecked=0, Total=2256 [2024-10-24 01:37:10,919 INFO L432 NwaCegarLoop]: 1040 mSDtfsCounter, 5339 mSDsluCounter, 13306 mSDsCounter, 0 mSdLazyCounter, 4720 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5339 SdHoareTripleChecker+Valid, 14346 SdHoareTripleChecker+Invalid, 4787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 4720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:37:10,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5339 Valid, 14346 Invalid, 4787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 4720 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 01:37:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34166 states. [2024-10-24 01:37:11,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34166 to 22184. [2024-10-24 01:37:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22184 states, 22179 states have (on average 1.274313539834979) internal successors, (28263), 22183 states have internal predecessors, (28263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22184 states to 22184 states and 28263 transitions. [2024-10-24 01:37:11,338 INFO L78 Accepts]: Start accepts. Automaton has 22184 states and 28263 transitions. Word has length 170 [2024-10-24 01:37:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:37:11,338 INFO L471 AbstractCegarLoop]: Abstraction has 22184 states and 28263 transitions. [2024-10-24 01:37:11,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.391304347826087) internal successors, (170), 22 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 22184 states and 28263 transitions. [2024-10-24 01:37:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 01:37:11,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:37:11,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:37:11,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 01:37:11,355 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:37:11,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:37:11,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2045558982, now seen corresponding path program 1 times [2024-10-24 01:37:11,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:37:11,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527283397] [2024-10-24 01:37:11,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:37:11,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:37:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:37:11,464 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-24 01:37:11,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:37:11,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527283397] [2024-10-24 01:37:11,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527283397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:37:11,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:37:11,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:37:11,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615266548] [2024-10-24 01:37:11,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:37:11,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:37:11,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:37:11,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:37:11,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:37:11,466 INFO L87 Difference]: Start difference. First operand 22184 states and 28263 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:37:11,730 INFO L93 Difference]: Finished difference Result 52503 states and 67985 transitions. [2024-10-24 01:37:11,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:37:11,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2024-10-24 01:37:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:37:11,774 INFO L225 Difference]: With dead ends: 52503 [2024-10-24 01:37:11,774 INFO L226 Difference]: Without dead ends: 38188 [2024-10-24 01:37:11,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 01:37:11,796 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 343 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:37:11,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1001 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:37:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38188 states. [2024-10-24 01:37:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38188 to 37670. [2024-10-24 01:37:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37670 states, 37665 states have (on average 1.2767821585025887) internal successors, (48090), 37669 states have internal predecessors, (48090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37670 states to 37670 states and 48090 transitions. [2024-10-24 01:37:12,339 INFO L78 Accepts]: Start accepts. Automaton has 37670 states and 48090 transitions. Word has length 170 [2024-10-24 01:37:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:37:12,340 INFO L471 AbstractCegarLoop]: Abstraction has 37670 states and 48090 transitions. [2024-10-24 01:37:12,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 37670 states and 48090 transitions. [2024-10-24 01:37:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 01:37:12,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:37:12,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:37:12,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 01:37:12,369 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:37:12,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:37:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash 754482051, now seen corresponding path program 1 times [2024-10-24 01:37:12,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:37:12,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102029690] [2024-10-24 01:37:12,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:37:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:37:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:37:13,983 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-24 01:37:13,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:37:13,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102029690] [2024-10-24 01:37:13,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102029690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:37:13,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:37:13,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-10-24 01:37:13,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815763155] [2024-10-24 01:37:13,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:37:13,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 01:37:13,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:37:13,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 01:37:13,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-10-24 01:37:13,985 INFO L87 Difference]: Start difference. First operand 37670 states and 48090 transitions. Second operand has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 21 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:37:18,183 INFO L93 Difference]: Finished difference Result 57533 states and 76862 transitions. [2024-10-24 01:37:18,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 01:37:18,184 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 21 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2024-10-24 01:37:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:37:18,244 INFO L225 Difference]: With dead ends: 57533 [2024-10-24 01:37:18,244 INFO L226 Difference]: Without dead ends: 51782 [2024-10-24 01:37:18,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 01:37:18,268 INFO L432 NwaCegarLoop]: 1000 mSDtfsCounter, 2718 mSDsluCounter, 11422 mSDsCounter, 0 mSdLazyCounter, 4285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2718 SdHoareTripleChecker+Valid, 12422 SdHoareTripleChecker+Invalid, 4287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:37:18,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2718 Valid, 12422 Invalid, 4287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4285 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-24 01:37:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51782 states. [2024-10-24 01:37:18,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51782 to 37800. [2024-10-24 01:37:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37800 states, 37795 states have (on average 1.2765709749966927) internal successors, (48248), 37799 states have internal predecessors, (48248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37800 states to 37800 states and 48248 transitions. [2024-10-24 01:37:18,903 INFO L78 Accepts]: Start accepts. Automaton has 37800 states and 48248 transitions. Word has length 170 [2024-10-24 01:37:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:37:18,903 INFO L471 AbstractCegarLoop]: Abstraction has 37800 states and 48248 transitions. [2024-10-24 01:37:18,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 21 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:37:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 37800 states and 48248 transitions. [2024-10-24 01:37:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 01:37:18,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:37:18,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:37:18,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 01:37:18,932 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-24 01:37:18,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:37:18,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1513083237, now seen corresponding path program 1 times [2024-10-24 01:37:18,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:37:18,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168253263] [2024-10-24 01:37:18,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:37:18,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:37:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:37:20,646 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-24 01:37:20,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:37:20,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168253263] [2024-10-24 01:37:20,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168253263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:37:20,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:37:20,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-10-24 01:37:20,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50948157] [2024-10-24 01:37:20,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:37:20,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 01:37:20,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:37:20,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 01:37:20,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2024-10-24 01:37:20,648 INFO L87 Difference]: Start difference. First operand 37800 states and 48248 transitions. Second operand has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 21 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)