./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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_opt-floodmax.3.ufo.BOUNDED-6.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 59940e8fe87e3366018bea7f282f7e760705d94648fe4a1dff4928a6bf4a13ec --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:35:05,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:35:05,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:35:05,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:35:05,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:35:06,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:35:06,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:35:06,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:35:06,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:35:06,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:35:06,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:35:06,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:35:06,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:35:06,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:35:06,011 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:35:06,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:35:06,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:35:06,014 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:35:06,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:35:06,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:35:06,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:35:06,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:35:06,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:35:06,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:35:06,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:35:06,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:35:06,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:35:06,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:35:06,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:35:06,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:35:06,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:35:06,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:35:06,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:35:06,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:35:06,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:35:06,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:35:06,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:35:06,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:35:06,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:35:06,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:35:06,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:35:06,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:35:06,022 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 -> 59940e8fe87e3366018bea7f282f7e760705d94648fe4a1dff4928a6bf4a13ec [2024-10-12 20:35:06,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:35:06,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:35:06,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:35:06,242 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:35:06,242 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:35:06,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:35:07,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:35:07,856 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:35:07,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:35:07,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d8b9c9b/e1941f0f56644f3e87acdeac0ec0fe19/FLAGf6ce7ddb9 [2024-10-12 20:35:07,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3d8b9c9b/e1941f0f56644f3e87acdeac0ec0fe19 [2024-10-12 20:35:07,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:35:07,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:35:07,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:35:07,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:35:07,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:35:07,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:35:07" (1/1) ... [2024-10-12 20:35:07,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@933aaf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:07, skipping insertion in model container [2024-10-12 20:35:07,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:35:07" (1/1) ... [2024-10-12 20:35:07,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:35:08,253 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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15611,15624] [2024-10-12 20:35:08,267 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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[16258,16271] [2024-10-12 20:35:08,284 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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[17599,17612] [2024-10-12 20:35:08,297 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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18659,18672] [2024-10-12 20:35:08,360 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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[27944,27957] [2024-10-12 20:35:08,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:35:08,460 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:35:08,607 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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15611,15624] [2024-10-12 20:35:08,645 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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[16258,16271] [2024-10-12 20:35:08,680 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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[17599,17612] [2024-10-12 20:35:08,723 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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[18659,18672] [2024-10-12 20:35:08,760 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_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[27944,27957] [2024-10-12 20:35:08,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:35:08,807 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:35:08,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08 WrapperNode [2024-10-12 20:35:08,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:35:08,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:35:08,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:35:08,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:35:08,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08" (1/1) ... [2024-10-12 20:35:08,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08" (1/1) ... [2024-10-12 20:35:08,912 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1792 [2024-10-12 20:35:08,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:35:08,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:35:08,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:35:08,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:35:08,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08" (1/1) ... [2024-10-12 20:35:08,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08" (1/1) ... [2024-10-12 20:35:08,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08" (1/1) ... [2024-10-12 20:35:08,963 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-12 20:35:08,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08" (1/1) ... [2024-10-12 20:35:08,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08" (1/1) ... [2024-10-12 20:35:08,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08" (1/1) ... [2024-10-12 20:35:08,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08" (1/1) ... [2024-10-12 20:35:08,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08" (1/1) ... [2024-10-12 20:35:09,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08" (1/1) ... [2024-10-12 20:35:09,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:35:09,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:35:09,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:35:09,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:35:09,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08" (1/1) ... [2024-10-12 20:35:09,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:35:09,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:35:09,051 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-12 20:35:09,055 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-12 20:35:09,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:35:09,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:35:09,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:35:09,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:35:09,234 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:35:09,236 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:35:10,210 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-12 20:35:10,211 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:35:10,271 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:35:10,274 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:35:10,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:35:10 BoogieIcfgContainer [2024-10-12 20:35:10,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:35:10,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:35:10,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:35:10,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:35:10,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:35:07" (1/3) ... [2024-10-12 20:35:10,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6888f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:35:10, skipping insertion in model container [2024-10-12 20:35:10,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:35:08" (2/3) ... [2024-10-12 20:35:10,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6888f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:35:10, skipping insertion in model container [2024-10-12 20:35:10,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:35:10" (3/3) ... [2024-10-12 20:35:10,283 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:35:10,297 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:35:10,297 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-10-12 20:35:10,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:35:10,361 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;@2e5cf241, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:35:10,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-12 20:35:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 411 states, 405 states have (on average 1.8098765432098765) internal successors, (733), 410 states have internal predecessors, (733), 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-12 20:35:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-12 20:35:10,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:10,381 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] [2024-10-12 20:35:10,381 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-12 20:35:10,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:10,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1930345017, now seen corresponding path program 1 times [2024-10-12 20:35:10,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:10,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697974175] [2024-10-12 20:35:10,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:10,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:10,937 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-12 20:35:10,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:10,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697974175] [2024-10-12 20:35:10,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697974175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:10,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:10,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:10,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792587673] [2024-10-12 20:35:10,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:10,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:10,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:10,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:10,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:10,975 INFO L87 Difference]: Start difference. First operand has 411 states, 405 states have (on average 1.8098765432098765) internal successors, (733), 410 states have internal predecessors, (733), 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 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-12 20:35:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:11,174 INFO L93 Difference]: Finished difference Result 759 states and 1340 transitions. [2024-10-12 20:35:11,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:11,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 147 [2024-10-12 20:35:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:11,190 INFO L225 Difference]: With dead ends: 759 [2024-10-12 20:35:11,190 INFO L226 Difference]: Without dead ends: 628 [2024-10-12 20:35:11,193 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-12 20:35:11,196 INFO L432 NwaCegarLoop]: 829 mSDtfsCounter, 454 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1306 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:11,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1306 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-10-12 20:35:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2024-10-12 20:35:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 621 states have (on average 1.4879227053140096) internal successors, (924), 625 states have internal predecessors, (924), 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-12 20:35:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 924 transitions. [2024-10-12 20:35:11,266 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 924 transitions. Word has length 147 [2024-10-12 20:35:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:11,266 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 924 transitions. [2024-10-12 20:35:11,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-12 20:35:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 924 transitions. [2024-10-12 20:35:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-12 20:35:11,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:11,271 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] [2024-10-12 20:35:11,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:35:11,272 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-12 20:35:11,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1929914041, now seen corresponding path program 1 times [2024-10-12 20:35:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:11,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159535178] [2024-10-12 20:35:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:11,800 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-12 20:35:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:11,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159535178] [2024-10-12 20:35:11,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159535178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:11,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:11,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:11,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186184066] [2024-10-12 20:35:11,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:11,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:11,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:11,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:11,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:11,805 INFO L87 Difference]: Start difference. First operand 626 states and 924 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 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-12 20:35:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:11,951 INFO L93 Difference]: Finished difference Result 3037 states and 4461 transitions. [2024-10-12 20:35:11,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:35:11,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 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 147 [2024-10-12 20:35:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:11,959 INFO L225 Difference]: With dead ends: 3037 [2024-10-12 20:35:11,959 INFO L226 Difference]: Without dead ends: 2419 [2024-10-12 20:35:11,962 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-12 20:35:11,963 INFO L432 NwaCegarLoop]: 955 mSDtfsCounter, 1776 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:11,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 2519 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:11,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2024-10-12 20:35:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1175. [2024-10-12 20:35:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1170 states have (on average 1.4760683760683762) internal successors, (1727), 1174 states have internal predecessors, (1727), 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-12 20:35:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1727 transitions. [2024-10-12 20:35:12,031 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1727 transitions. Word has length 147 [2024-10-12 20:35:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:12,032 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1727 transitions. [2024-10-12 20:35:12,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 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-12 20:35:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1727 transitions. [2024-10-12 20:35:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-12 20:35:12,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:12,035 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-12 20:35:12,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:35:12,036 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-12 20:35:12,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:12,037 INFO L85 PathProgramCache]: Analyzing trace with hash 177520071, now seen corresponding path program 1 times [2024-10-12 20:35:12,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:12,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572311923] [2024-10-12 20:35:12,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:12,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:12,110 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-12 20:35:12,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:12,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572311923] [2024-10-12 20:35:12,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572311923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:12,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:12,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:12,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905247414] [2024-10-12 20:35:12,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:12,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:12,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:12,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:12,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:12,112 INFO L87 Difference]: Start difference. First operand 1175 states and 1727 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) 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-12 20:35:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:12,134 INFO L93 Difference]: Finished difference Result 2325 states and 3412 transitions. [2024-10-12 20:35:12,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:12,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) 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-12 20:35:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:12,138 INFO L225 Difference]: With dead ends: 2325 [2024-10-12 20:35:12,138 INFO L226 Difference]: Without dead ends: 1177 [2024-10-12 20:35:12,139 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-12 20:35:12,140 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 0 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1175 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-12 20:35:12,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:12,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2024-10-12 20:35:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1177. [2024-10-12 20:35:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1172 states have (on average 1.4752559726962458) internal successors, (1729), 1176 states have internal predecessors, (1729), 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-12 20:35:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1729 transitions. [2024-10-12 20:35:12,158 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1729 transitions. Word has length 148 [2024-10-12 20:35:12,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:12,159 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1729 transitions. [2024-10-12 20:35:12,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) 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-12 20:35:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1729 transitions. [2024-10-12 20:35:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-12 20:35:12,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:12,161 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-12 20:35:12,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:35:12,161 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-12 20:35:12,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:12,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1051875898, now seen corresponding path program 1 times [2024-10-12 20:35:12,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:12,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451831154] [2024-10-12 20:35:12,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:12,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:12,583 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-12 20:35:12,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:12,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451831154] [2024-10-12 20:35:12,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451831154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:12,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:12,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:12,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560185116] [2024-10-12 20:35:12,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:12,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:12,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:12,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:12,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:12,588 INFO L87 Difference]: Start difference. First operand 1177 states and 1729 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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-12 20:35:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:12,620 INFO L93 Difference]: Finished difference Result 2341 states and 3438 transitions. [2024-10-12 20:35:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:12,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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-12 20:35:12,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:12,625 INFO L225 Difference]: With dead ends: 2341 [2024-10-12 20:35:12,625 INFO L226 Difference]: Without dead ends: 1177 [2024-10-12 20:35:12,628 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-12 20:35:12,629 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 20 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1834 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-12 20:35:12,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1834 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2024-10-12 20:35:12,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1176. [2024-10-12 20:35:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1171 states have (on average 1.4739538855678906) internal successors, (1726), 1175 states have internal predecessors, (1726), 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-12 20:35:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1726 transitions. [2024-10-12 20:35:12,652 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1726 transitions. Word has length 149 [2024-10-12 20:35:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:12,653 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1726 transitions. [2024-10-12 20:35:12,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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-12 20:35:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1726 transitions. [2024-10-12 20:35:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-12 20:35:12,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:12,656 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-12 20:35:12,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:35:12,656 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-12 20:35:12,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:12,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1563056624, now seen corresponding path program 1 times [2024-10-12 20:35:12,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:12,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431730734] [2024-10-12 20:35:12,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:12,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:13,148 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-12 20:35:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431730734] [2024-10-12 20:35:13,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431730734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:13,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:13,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:13,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208157859] [2024-10-12 20:35:13,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:13,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:13,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:13,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:13,154 INFO L87 Difference]: Start difference. First operand 1176 states and 1726 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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-12 20:35:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:13,181 INFO L93 Difference]: Finished difference Result 2344 states and 3440 transitions. [2024-10-12 20:35:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:13,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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-12 20:35:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:13,185 INFO L225 Difference]: With dead ends: 2344 [2024-10-12 20:35:13,185 INFO L226 Difference]: Without dead ends: 1174 [2024-10-12 20:35:13,187 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-12 20:35:13,187 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 23 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1836 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-12 20:35:13,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1836 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2024-10-12 20:35:13,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2024-10-12 20:35:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1169 states have (on average 1.473053892215569) internal successors, (1722), 1173 states have internal predecessors, (1722), 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-12 20:35:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1722 transitions. [2024-10-12 20:35:13,207 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1722 transitions. Word has length 149 [2024-10-12 20:35:13,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:13,208 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1722 transitions. [2024-10-12 20:35:13,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 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-12 20:35:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1722 transitions. [2024-10-12 20:35:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-12 20:35:13,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:13,210 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-12 20:35:13,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:35:13,210 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-12 20:35:13,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:13,211 INFO L85 PathProgramCache]: Analyzing trace with hash -747142253, now seen corresponding path program 1 times [2024-10-12 20:35:13,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:13,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355854075] [2024-10-12 20:35:13,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:13,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:13,337 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-12 20:35:13,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:13,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355854075] [2024-10-12 20:35:13,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355854075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:13,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:13,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:13,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745574063] [2024-10-12 20:35:13,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:13,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:13,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:13,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:13,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:13,341 INFO L87 Difference]: Start difference. First operand 1174 states and 1722 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-12 20:35:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:13,388 INFO L93 Difference]: Finished difference Result 2745 states and 4028 transitions. [2024-10-12 20:35:13,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:13,389 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-12 20:35:13,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:13,395 INFO L225 Difference]: With dead ends: 2745 [2024-10-12 20:35:13,398 INFO L226 Difference]: Without dead ends: 1762 [2024-10-12 20:35:13,399 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-12 20:35:13,400 INFO L432 NwaCegarLoop]: 1112 mSDtfsCounter, 511 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:13,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1642 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2024-10-12 20:35:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1722. [2024-10-12 20:35:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1717 states have (on average 1.4554455445544554) internal successors, (2499), 1721 states have internal predecessors, (2499), 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-12 20:35:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2499 transitions. [2024-10-12 20:35:13,434 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2499 transitions. Word has length 149 [2024-10-12 20:35:13,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:13,435 INFO L471 AbstractCegarLoop]: Abstraction has 1722 states and 2499 transitions. [2024-10-12 20:35:13,436 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-12 20:35:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2499 transitions. [2024-10-12 20:35:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-12 20:35:13,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:13,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:35:13,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:35:13,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:13,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash -583499596, now seen corresponding path program 1 times [2024-10-12 20:35:13,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:13,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827643668] [2024-10-12 20:35:13,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:13,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:13,512 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-12 20:35:13,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:13,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827643668] [2024-10-12 20:35:13,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827643668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:13,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:13,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:13,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394998795] [2024-10-12 20:35:13,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:13,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:13,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:13,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:13,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:13,516 INFO L87 Difference]: Start difference. First operand 1722 states and 2499 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-12 20:35:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:13,558 INFO L93 Difference]: Finished difference Result 4000 states and 5922 transitions. [2024-10-12 20:35:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:13,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 151 [2024-10-12 20:35:13,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:13,565 INFO L225 Difference]: With dead ends: 4000 [2024-10-12 20:35:13,565 INFO L226 Difference]: Without dead ends: 2462 [2024-10-12 20:35:13,568 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-12 20:35:13,568 INFO L432 NwaCegarLoop]: 781 mSDtfsCounter, 307 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:13,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1236 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2024-10-12 20:35:13,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2146. [2024-10-12 20:35:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 2141 states have (on average 1.488556749182625) internal successors, (3187), 2145 states have internal predecessors, (3187), 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-12 20:35:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3187 transitions. [2024-10-12 20:35:13,604 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3187 transitions. Word has length 151 [2024-10-12 20:35:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:13,605 INFO L471 AbstractCegarLoop]: Abstraction has 2146 states and 3187 transitions. [2024-10-12 20:35:13,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-12 20:35:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3187 transitions. [2024-10-12 20:35:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-12 20:35:13,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:13,607 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] [2024-10-12 20:35:13,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:35:13,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:13,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:13,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1522765601, now seen corresponding path program 1 times [2024-10-12 20:35:13,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:13,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278822148] [2024-10-12 20:35:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:13,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:13,682 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-12 20:35:13,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:13,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278822148] [2024-10-12 20:35:13,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278822148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:13,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:13,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:13,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180154854] [2024-10-12 20:35:13,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:13,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:13,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:13,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:13,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:13,685 INFO L87 Difference]: Start difference. First operand 2146 states and 3187 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-12 20:35:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:13,741 INFO L93 Difference]: Finished difference Result 5170 states and 7854 transitions. [2024-10-12 20:35:13,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:13,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 153 [2024-10-12 20:35:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:13,750 INFO L225 Difference]: With dead ends: 5170 [2024-10-12 20:35:13,751 INFO L226 Difference]: Without dead ends: 3292 [2024-10-12 20:35:13,753 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-12 20:35:13,755 INFO L432 NwaCegarLoop]: 802 mSDtfsCounter, 336 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:13,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1234 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2024-10-12 20:35:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 2900. [2024-10-12 20:35:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2895 states have (on average 1.5226252158894646) internal successors, (4408), 2899 states have internal predecessors, (4408), 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-12 20:35:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 4408 transitions. [2024-10-12 20:35:13,814 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 4408 transitions. Word has length 153 [2024-10-12 20:35:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:13,815 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 4408 transitions. [2024-10-12 20:35:13,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-12 20:35:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4408 transitions. [2024-10-12 20:35:13,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-12 20:35:13,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:13,817 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] [2024-10-12 20:35:13,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:35:13,818 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:13,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:13,818 INFO L85 PathProgramCache]: Analyzing trace with hash 981442020, now seen corresponding path program 1 times [2024-10-12 20:35:13,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:13,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661264229] [2024-10-12 20:35:13,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:13,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:14,149 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-12 20:35:14,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:14,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661264229] [2024-10-12 20:35:14,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661264229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:14,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:14,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:14,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015056542] [2024-10-12 20:35:14,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:14,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:14,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:14,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:14,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:14,152 INFO L87 Difference]: Start difference. First operand 2900 states and 4408 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 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-12 20:35:14,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:14,258 INFO L93 Difference]: Finished difference Result 7521 states and 11427 transitions. [2024-10-12 20:35:14,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:35:14,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 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 154 [2024-10-12 20:35:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:14,274 INFO L225 Difference]: With dead ends: 7521 [2024-10-12 20:35:14,274 INFO L226 Difference]: Without dead ends: 4647 [2024-10-12 20:35:14,279 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-12 20:35:14,279 INFO L432 NwaCegarLoop]: 980 mSDtfsCounter, 511 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:14,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 2451 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4647 states. [2024-10-12 20:35:14,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4647 to 4613. [2024-10-12 20:35:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4613 states, 4608 states have (on average 1.5084635416666667) internal successors, (6951), 4612 states have internal predecessors, (6951), 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-12 20:35:14,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 6951 transitions. [2024-10-12 20:35:14,359 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 6951 transitions. Word has length 154 [2024-10-12 20:35:14,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:14,360 INFO L471 AbstractCegarLoop]: Abstraction has 4613 states and 6951 transitions. [2024-10-12 20:35:14,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 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-12 20:35:14,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 6951 transitions. [2024-10-12 20:35:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-12 20:35:14,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:14,363 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-12 20:35:14,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:35:14,364 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:14,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:14,364 INFO L85 PathProgramCache]: Analyzing trace with hash -720029480, now seen corresponding path program 1 times [2024-10-12 20:35:14,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:14,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470897602] [2024-10-12 20:35:14,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:14,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:14,461 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-12 20:35:14,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:14,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470897602] [2024-10-12 20:35:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470897602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:14,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822029494] [2024-10-12 20:35:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:14,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:14,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:14,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:14,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:14,463 INFO L87 Difference]: Start difference. First operand 4613 states and 6951 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-12 20:35:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:14,535 INFO L93 Difference]: Finished difference Result 11408 states and 17235 transitions. [2024-10-12 20:35:14,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:14,536 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-12 20:35:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:14,554 INFO L225 Difference]: With dead ends: 11408 [2024-10-12 20:35:14,555 INFO L226 Difference]: Without dead ends: 7149 [2024-10-12 20:35:14,561 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-12 20:35:14,562 INFO L432 NwaCegarLoop]: 675 mSDtfsCounter, 508 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:14,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1191 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7149 states. [2024-10-12 20:35:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7149 to 7119. [2024-10-12 20:35:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7119 states, 7114 states have (on average 1.489879111610908) internal successors, (10599), 7118 states have internal predecessors, (10599), 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-12 20:35:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7119 states to 7119 states and 10599 transitions. [2024-10-12 20:35:14,675 INFO L78 Accepts]: Start accepts. Automaton has 7119 states and 10599 transitions. Word has length 156 [2024-10-12 20:35:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:14,675 INFO L471 AbstractCegarLoop]: Abstraction has 7119 states and 10599 transitions. [2024-10-12 20:35:14,675 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-12 20:35:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 7119 states and 10599 transitions. [2024-10-12 20:35:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-12 20:35:14,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:14,680 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-12 20:35:14,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:35:14,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:14,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:14,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1153354104, now seen corresponding path program 1 times [2024-10-12 20:35:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:14,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776739998] [2024-10-12 20:35:14,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:14,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:14,747 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-12 20:35:14,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:14,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776739998] [2024-10-12 20:35:14,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776739998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:14,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:14,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:14,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497540783] [2024-10-12 20:35:14,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:14,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:14,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:14,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:14,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:14,749 INFO L87 Difference]: Start difference. First operand 7119 states and 10599 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 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-12 20:35:14,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:14,832 INFO L93 Difference]: Finished difference Result 18326 states and 27734 transitions. [2024-10-12 20:35:14,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:14,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 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-12 20:35:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:14,854 INFO L225 Difference]: With dead ends: 18326 [2024-10-12 20:35:14,855 INFO L226 Difference]: Without dead ends: 11543 [2024-10-12 20:35:14,866 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-12 20:35:14,866 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 303 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:14,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1221 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:14,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11543 states. [2024-10-12 20:35:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11543 to 10517. [2024-10-12 20:35:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10517 states, 10512 states have (on average 1.5241628614916287) internal successors, (16022), 10516 states have internal predecessors, (16022), 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-12 20:35:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10517 states to 10517 states and 16022 transitions. [2024-10-12 20:35:15,107 INFO L78 Accepts]: Start accepts. Automaton has 10517 states and 16022 transitions. Word has length 160 [2024-10-12 20:35:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:15,107 INFO L471 AbstractCegarLoop]: Abstraction has 10517 states and 16022 transitions. [2024-10-12 20:35:15,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 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-12 20:35:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 10517 states and 16022 transitions. [2024-10-12 20:35:15,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:35:15,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:15,113 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] [2024-10-12 20:35:15,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:35:15,114 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:15,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:15,114 INFO L85 PathProgramCache]: Analyzing trace with hash 455307304, now seen corresponding path program 1 times [2024-10-12 20:35:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:15,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063673842] [2024-10-12 20:35:15,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:15,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:15,570 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-12 20:35:15,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:15,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063673842] [2024-10-12 20:35:15,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063673842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:15,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:15,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:35:15,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926852961] [2024-10-12 20:35:15,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:15,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:35:15,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:15,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:35:15,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:35:15,572 INFO L87 Difference]: Start difference. First operand 10517 states and 16022 transitions. Second operand has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 8 states have internal predecessors, (161), 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-12 20:35:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:16,474 INFO L93 Difference]: Finished difference Result 47444 states and 73303 transitions. [2024-10-12 20:35:16,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:35:16,475 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 8 states have internal predecessors, (161), 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 161 [2024-10-12 20:35:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:16,540 INFO L225 Difference]: With dead ends: 47444 [2024-10-12 20:35:16,540 INFO L226 Difference]: Without dead ends: 37337 [2024-10-12 20:35:16,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:35:16,566 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 5399 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5399 SdHoareTripleChecker+Valid, 2671 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:16,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5399 Valid, 2671 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:35:16,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37337 states. [2024-10-12 20:35:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37337 to 22566. [2024-10-12 20:35:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22566 states, 22561 states have (on average 1.532112938256283) internal successors, (34566), 22565 states have internal predecessors, (34566), 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-12 20:35:17,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22566 states to 22566 states and 34566 transitions. [2024-10-12 20:35:17,040 INFO L78 Accepts]: Start accepts. Automaton has 22566 states and 34566 transitions. Word has length 161 [2024-10-12 20:35:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:17,041 INFO L471 AbstractCegarLoop]: Abstraction has 22566 states and 34566 transitions. [2024-10-12 20:35:17,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.88888888888889) internal successors, (161), 8 states have internal predecessors, (161), 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-12 20:35:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 22566 states and 34566 transitions. [2024-10-12 20:35:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 20:35:17,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:17,048 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] [2024-10-12 20:35:17,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:35:17,048 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:17,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash -46332201, now seen corresponding path program 1 times [2024-10-12 20:35:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491218080] [2024-10-12 20:35:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:17,477 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-12 20:35:17,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:17,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491218080] [2024-10-12 20:35:17,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491218080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:17,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:17,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:17,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674630812] [2024-10-12 20:35:17,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:17,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:17,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:17,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:17,480 INFO L87 Difference]: Start difference. First operand 22566 states and 34566 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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-12 20:35:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:17,918 INFO L93 Difference]: Finished difference Result 103369 states and 157905 transitions. [2024-10-12 20:35:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:35:17,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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 161 [2024-10-12 20:35:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:18,082 INFO L225 Difference]: With dead ends: 103369 [2024-10-12 20:35:18,083 INFO L226 Difference]: Without dead ends: 80841 [2024-10-12 20:35:18,125 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-12 20:35:18,126 INFO L432 NwaCegarLoop]: 994 mSDtfsCounter, 1612 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 2563 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-12 20:35:18,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 2563 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80841 states. [2024-10-12 20:35:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80841 to 40409. [2024-10-12 20:35:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40409 states, 40404 states have (on average 1.5117562617562617) internal successors, (61081), 40408 states have internal predecessors, (61081), 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-12 20:35:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40409 states to 40409 states and 61081 transitions. [2024-10-12 20:35:19,167 INFO L78 Accepts]: Start accepts. Automaton has 40409 states and 61081 transitions. Word has length 161 [2024-10-12 20:35:19,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:19,168 INFO L471 AbstractCegarLoop]: Abstraction has 40409 states and 61081 transitions. [2024-10-12 20:35:19,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 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-12 20:35:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 40409 states and 61081 transitions. [2024-10-12 20:35:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 20:35:19,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:19,177 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] [2024-10-12 20:35:19,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:35:19,177 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:19,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:19,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1862983257, now seen corresponding path program 1 times [2024-10-12 20:35:19,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:19,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193716509] [2024-10-12 20:35:19,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:19,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:19,241 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-12 20:35:19,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:19,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193716509] [2024-10-12 20:35:19,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193716509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:19,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:19,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138351952] [2024-10-12 20:35:19,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:19,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:19,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:19,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:19,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:19,243 INFO L87 Difference]: Start difference. First operand 40409 states and 61081 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-12 20:35:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:19,753 INFO L93 Difference]: Finished difference Result 80719 states and 122033 transitions. [2024-10-12 20:35:19,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:19,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 162 [2024-10-12 20:35:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:19,820 INFO L225 Difference]: With dead ends: 80719 [2024-10-12 20:35:19,821 INFO L226 Difference]: Without dead ends: 40415 [2024-10-12 20:35:19,854 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-12 20:35:19,854 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 0 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1143 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-12 20:35:19,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1143 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:19,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40415 states. [2024-10-12 20:35:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40415 to 40415. [2024-10-12 20:35:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40415 states, 40410 states have (on average 1.5116802771591191) internal successors, (61087), 40414 states have internal predecessors, (61087), 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-12 20:35:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40415 states to 40415 states and 61087 transitions. [2024-10-12 20:35:20,511 INFO L78 Accepts]: Start accepts. Automaton has 40415 states and 61087 transitions. Word has length 162 [2024-10-12 20:35:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:20,511 INFO L471 AbstractCegarLoop]: Abstraction has 40415 states and 61087 transitions. [2024-10-12 20:35:20,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-12 20:35:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 40415 states and 61087 transitions. [2024-10-12 20:35:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-12 20:35:20,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:20,520 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] [2024-10-12 20:35:20,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:35:20,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:20,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:20,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1932469653, now seen corresponding path program 1 times [2024-10-12 20:35:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:20,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756009224] [2024-10-12 20:35:20,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:20,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:20,596 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-12 20:35:20,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:20,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756009224] [2024-10-12 20:35:20,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756009224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:20,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:20,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:20,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941521160] [2024-10-12 20:35:20,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:20,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:35:20,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:20,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:35:20,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:35:20,598 INFO L87 Difference]: Start difference. First operand 40415 states and 61087 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-12 20:35:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:21,005 INFO L93 Difference]: Finished difference Result 113686 states and 171825 transitions. [2024-10-12 20:35:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:35:21,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 163 [2024-10-12 20:35:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:21,110 INFO L225 Difference]: With dead ends: 113686 [2024-10-12 20:35:21,110 INFO L226 Difference]: Without dead ends: 74025 [2024-10-12 20:35:21,149 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-12 20:35:21,150 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 487 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1610 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-12 20:35:21,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1610 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74025 states. [2024-10-12 20:35:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74025 to 73967. [2024-10-12 20:35:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73967 states, 73962 states have (on average 1.4974851951001866) internal successors, (110757), 73966 states have internal predecessors, (110757), 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-12 20:35:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73967 states to 73967 states and 110757 transitions. [2024-10-12 20:35:22,471 INFO L78 Accepts]: Start accepts. Automaton has 73967 states and 110757 transitions. Word has length 163 [2024-10-12 20:35:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:22,471 INFO L471 AbstractCegarLoop]: Abstraction has 73967 states and 110757 transitions. [2024-10-12 20:35:22,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-12 20:35:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 73967 states and 110757 transitions. [2024-10-12 20:35:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-12 20:35:22,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:22,487 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] [2024-10-12 20:35:22,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:35:22,488 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:22,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1256418226, now seen corresponding path program 1 times [2024-10-12 20:35:22,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:22,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414702232] [2024-10-12 20:35:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:22,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:22,998 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-12 20:35:22,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:22,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414702232] [2024-10-12 20:35:22,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414702232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:22,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:22,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:22,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317715186] [2024-10-12 20:35:22,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:22,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:22,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:22,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:22,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:22,999 INFO L87 Difference]: Start difference. First operand 73967 states and 110757 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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-12 20:35:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:23,296 INFO L93 Difference]: Finished difference Result 131276 states and 196531 transitions. [2024-10-12 20:35:23,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:23,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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 163 [2024-10-12 20:35:23,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:23,387 INFO L225 Difference]: With dead ends: 131276 [2024-10-12 20:35:23,387 INFO L226 Difference]: Without dead ends: 74326 [2024-10-12 20:35:23,662 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-12 20:35:23,666 INFO L432 NwaCegarLoop]: 988 mSDtfsCounter, 985 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:23,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 1491 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74326 states. [2024-10-12 20:35:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74326 to 74146. [2024-10-12 20:35:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74146 states, 74141 states have (on average 1.496567351398012) internal successors, (110957), 74145 states have internal predecessors, (110957), 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-12 20:35:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74146 states to 74146 states and 110957 transitions. [2024-10-12 20:35:24,854 INFO L78 Accepts]: Start accepts. Automaton has 74146 states and 110957 transitions. Word has length 163 [2024-10-12 20:35:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:24,855 INFO L471 AbstractCegarLoop]: Abstraction has 74146 states and 110957 transitions. [2024-10-12 20:35:24,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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-12 20:35:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 74146 states and 110957 transitions. [2024-10-12 20:35:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-12 20:35:24,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:24,868 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] [2024-10-12 20:35:24,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:35:24,869 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:24,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash 54285656, now seen corresponding path program 1 times [2024-10-12 20:35:24,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020075367] [2024-10-12 20:35:24,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:25,642 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-12 20:35:25,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:25,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020075367] [2024-10-12 20:35:25,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020075367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:25,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:25,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:25,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634712318] [2024-10-12 20:35:25,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:25,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:25,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:25,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:25,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:25,643 INFO L87 Difference]: Start difference. First operand 74146 states and 110957 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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-12 20:35:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:25,913 INFO L93 Difference]: Finished difference Result 127784 states and 191238 transitions. [2024-10-12 20:35:25,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:25,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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 163 [2024-10-12 20:35:25,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:25,977 INFO L225 Difference]: With dead ends: 127784 [2024-10-12 20:35:25,978 INFO L226 Difference]: Without dead ends: 54217 [2024-10-12 20:35:26,027 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-12 20:35:26,027 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 14 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1774 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-12 20:35:26,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1774 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54217 states. [2024-10-12 20:35:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54217 to 54217. [2024-10-12 20:35:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54217 states, 54212 states have (on average 1.4933962960230207) internal successors, (80960), 54216 states have internal predecessors, (80960), 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-12 20:35:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54217 states to 54217 states and 80960 transitions. [2024-10-12 20:35:26,873 INFO L78 Accepts]: Start accepts. Automaton has 54217 states and 80960 transitions. Word has length 163 [2024-10-12 20:35:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:26,874 INFO L471 AbstractCegarLoop]: Abstraction has 54217 states and 80960 transitions. [2024-10-12 20:35:26,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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-12 20:35:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 54217 states and 80960 transitions. [2024-10-12 20:35:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-12 20:35:26,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:26,883 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-12 20:35:26,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:35:26,884 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:26,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:26,884 INFO L85 PathProgramCache]: Analyzing trace with hash 828281979, now seen corresponding path program 1 times [2024-10-12 20:35:26,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:26,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611650321] [2024-10-12 20:35:26,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:26,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:27,615 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-12 20:35:27,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:27,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611650321] [2024-10-12 20:35:27,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611650321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:27,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:27,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:35:27,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99031939] [2024-10-12 20:35:27,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:27,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 20:35:27,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:27,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 20:35:27,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:35:27,618 INFO L87 Difference]: Start difference. First operand 54217 states and 80960 transitions. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 8 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-12 20:35:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:29,098 INFO L93 Difference]: Finished difference Result 285046 states and 424977 transitions. [2024-10-12 20:35:29,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:35:29,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 8 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-12 20:35:29,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:29,944 INFO L225 Difference]: With dead ends: 285046 [2024-10-12 20:35:29,944 INFO L226 Difference]: Without dead ends: 231552 [2024-10-12 20:35:29,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:35:29,990 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 5668 mSDsluCounter, 2345 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5668 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:29,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5668 Valid, 2798 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 20:35:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231552 states. [2024-10-12 20:35:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231552 to 134193. [2024-10-12 20:35:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134193 states, 134188 states have (on average 1.4922198706292664) internal successors, (200238), 134192 states have internal predecessors, (200238), 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-12 20:35:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134193 states to 134193 states and 200238 transitions. [2024-10-12 20:35:32,841 INFO L78 Accepts]: Start accepts. Automaton has 134193 states and 200238 transitions. Word has length 170 [2024-10-12 20:35:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:32,844 INFO L471 AbstractCegarLoop]: Abstraction has 134193 states and 200238 transitions. [2024-10-12 20:35:32,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 8 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-12 20:35:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 134193 states and 200238 transitions. [2024-10-12 20:35:32,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-12 20:35:32,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:32,871 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-12 20:35:32,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:35:32,871 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:32,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash 815875816, now seen corresponding path program 1 times [2024-10-12 20:35:32,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:32,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169577182] [2024-10-12 20:35:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:32,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:33,303 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-12 20:35:33,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:33,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169577182] [2024-10-12 20:35:33,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169577182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:33,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:33,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:33,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096856581] [2024-10-12 20:35:33,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:33,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:33,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:33,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:33,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:33,306 INFO L87 Difference]: Start difference. First operand 134193 states and 200238 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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-12 20:35:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:34,318 INFO L93 Difference]: Finished difference Result 276914 states and 419086 transitions. [2024-10-12 20:35:34,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:34,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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-12 20:35:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:35,145 INFO L225 Difference]: With dead ends: 276914 [2024-10-12 20:35:35,146 INFO L226 Difference]: Without dead ends: 163642 [2024-10-12 20:35:35,213 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-12 20:35:35,217 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 941 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:35,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 991 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163642 states. [2024-10-12 20:35:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163642 to 163640. [2024-10-12 20:35:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163640 states, 163635 states have (on average 1.4913435389739358) internal successors, (244036), 163639 states have internal predecessors, (244036), 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-12 20:35:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163640 states to 163640 states and 244036 transitions. [2024-10-12 20:35:37,779 INFO L78 Accepts]: Start accepts. Automaton has 163640 states and 244036 transitions. Word has length 170 [2024-10-12 20:35:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:37,780 INFO L471 AbstractCegarLoop]: Abstraction has 163640 states and 244036 transitions. [2024-10-12 20:35:37,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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-12 20:35:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 163640 states and 244036 transitions. [2024-10-12 20:35:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-12 20:35:37,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:37,798 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-12 20:35:37,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:35:37,801 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:37,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:37,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1488655360, now seen corresponding path program 1 times [2024-10-12 20:35:37,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:37,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788872558] [2024-10-12 20:35:37,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:37,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:38,161 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-12 20:35:38,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:38,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788872558] [2024-10-12 20:35:38,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788872558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:38,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:38,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:38,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090763636] [2024-10-12 20:35:38,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:38,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:38,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:38,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:38,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:38,165 INFO L87 Difference]: Start difference. First operand 163640 states and 244036 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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-12 20:35:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:39,948 INFO L93 Difference]: Finished difference Result 217870 states and 326293 transitions. [2024-10-12 20:35:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:39,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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-12 20:35:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:40,119 INFO L225 Difference]: With dead ends: 217870 [2024-10-12 20:35:40,119 INFO L226 Difference]: Without dead ends: 102963 [2024-10-12 20:35:40,182 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-12 20:35:40,182 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 677 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:40,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 1074 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102963 states. [2024-10-12 20:35:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102963 to 102961. [2024-10-12 20:35:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102961 states, 102956 states have (on average 1.4689770387349936) internal successors, (151240), 102960 states have internal predecessors, (151240), 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-12 20:35:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102961 states to 102961 states and 151240 transitions. [2024-10-12 20:35:42,002 INFO L78 Accepts]: Start accepts. Automaton has 102961 states and 151240 transitions. Word has length 170 [2024-10-12 20:35:42,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:42,002 INFO L471 AbstractCegarLoop]: Abstraction has 102961 states and 151240 transitions. [2024-10-12 20:35:42,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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-12 20:35:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 102961 states and 151240 transitions. [2024-10-12 20:35:42,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-12 20:35:42,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:42,017 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-12 20:35:42,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:35:42,017 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:42,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:42,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2075197725, now seen corresponding path program 1 times [2024-10-12 20:35:42,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:42,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515201325] [2024-10-12 20:35:42,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:42,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:42,206 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-12 20:35:42,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:42,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515201325] [2024-10-12 20:35:42,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515201325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:42,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:42,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:35:42,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759716082] [2024-10-12 20:35:42,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:42,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:35:42,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:42,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:35:42,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:35:42,208 INFO L87 Difference]: Start difference. First operand 102961 states and 151240 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 7 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-12 20:35:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:43,878 INFO L93 Difference]: Finished difference Result 388146 states and 567477 transitions. [2024-10-12 20:35:43,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:35:43,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 7 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-12 20:35:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:44,407 INFO L225 Difference]: With dead ends: 388146 [2024-10-12 20:35:44,407 INFO L226 Difference]: Without dead ends: 286098 [2024-10-12 20:35:44,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:35:44,542 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 6671 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6671 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:44,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6671 Valid, 1457 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:35:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286098 states. [2024-10-12 20:35:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286098 to 138544. [2024-10-12 20:35:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138544 states, 138539 states have (on average 1.4422292639617724) internal successors, (199805), 138543 states have internal predecessors, (199805), 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-12 20:35:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138544 states to 138544 states and 199805 transitions. [2024-10-12 20:35:48,556 INFO L78 Accepts]: Start accepts. Automaton has 138544 states and 199805 transitions. Word has length 170 [2024-10-12 20:35:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:48,557 INFO L471 AbstractCegarLoop]: Abstraction has 138544 states and 199805 transitions. [2024-10-12 20:35:48,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 7 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-12 20:35:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 138544 states and 199805 transitions. [2024-10-12 20:35:48,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-12 20:35:48,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:48,577 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-12 20:35:48,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:35:48,577 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-12 20:35:48,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash 636916773, now seen corresponding path program 1 times [2024-10-12 20:35:48,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:48,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881348956] [2024-10-12 20:35:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:48,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:48,813 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-12 20:35:48,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:48,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881348956] [2024-10-12 20:35:48,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881348956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:48,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:48,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:35:48,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589532560] [2024-10-12 20:35:48,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:48,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:48,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:48,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:48,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:48,814 INFO L87 Difference]: Start difference. First operand 138544 states and 199805 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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-12 20:35:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:49,934 INFO L93 Difference]: Finished difference Result 186813 states and 271259 transitions. [2024-10-12 20:35:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:35:49,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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-12 20:35:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:50,328 INFO L225 Difference]: With dead ends: 186813 [2024-10-12 20:35:50,328 INFO L226 Difference]: Without dead ends: 134925 [2024-10-12 20:35:50,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-12 20:35:50,358 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 91 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:50,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1800 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:35:50,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134925 states. [2024-10-12 20:35:51,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134925 to 134925. [2024-10-12 20:35:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134925 states, 134920 states have (on average 1.4488882300622592) internal successors, (195484), 134924 states have internal predecessors, (195484), 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-12 20:35:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134925 states to 134925 states and 195484 transitions. [2024-10-12 20:35:52,231 INFO L78 Accepts]: Start accepts. Automaton has 134925 states and 195484 transitions. Word has length 170 [2024-10-12 20:35:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:35:52,231 INFO L471 AbstractCegarLoop]: Abstraction has 134925 states and 195484 transitions. [2024-10-12 20:35:52,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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-12 20:35:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 134925 states and 195484 transitions. [2024-10-12 20:35:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-12 20:35:52,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:35:52,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:35:52,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:35:52,247 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-12 20:35:52,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:35:52,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1859455869, now seen corresponding path program 1 times [2024-10-12 20:35:52,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:35:52,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696486452] [2024-10-12 20:35:52,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:35:52,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:35:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:35:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:35:53,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:35:53,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696486452] [2024-10-12 20:35:53,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696486452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:35:53,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:35:53,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:35:53,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503539163] [2024-10-12 20:35:53,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:35:53,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:35:53,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:35:53,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:35:53,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:35:53,152 INFO L87 Difference]: Start difference. First operand 134925 states and 195484 transitions. Second operand has 4 states, 4 states have (on average 42.5) 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-12 20:35:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:35:54,644 INFO L93 Difference]: Finished difference Result 405166 states and 586813 transitions. [2024-10-12 20:35:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:35:54,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) 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-12 20:35:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:35:55,114 INFO L225 Difference]: With dead ends: 405166 [2024-10-12 20:35:55,114 INFO L226 Difference]: Without dead ends: 270411 [2024-10-12 20:35:55,257 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-12 20:35:55,257 INFO L432 NwaCegarLoop]: 948 mSDtfsCounter, 1552 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:35:55,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 2438 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:35:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270411 states.