./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-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 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:57:33,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:57:33,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:57:33,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:57:33,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:57:33,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:57:33,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:57:33,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:57:33,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:57:33,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:57:33,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:57:33,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:57:33,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:57:33,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:57:33,868 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:57:33,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:57:33,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:57:33,869 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:57:33,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:57:33,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:57:33,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:57:33,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:57:33,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:57:33,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:57:33,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:57:33,877 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:57:33,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:57:33,878 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:57:33,878 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:57:33,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:57:33,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:57:33,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:57:33,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:57:33,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:57:33,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:57:33,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:57:33,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:57:33,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:57:33,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:57:33,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:57:33,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:57:33,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:57:33,883 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 -> 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 [2024-11-09 23:57:34,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:57:34,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:57:34,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:57:34,184 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:57:34,184 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:57:34,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-09 23:57:35,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:57:35,962 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:57:35,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-09 23:57:35,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b28ff7b1/eae76a0a85224d5ebffcac8d0faf1f4c/FLAG19da2b5b4 [2024-11-09 23:57:36,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b28ff7b1/eae76a0a85224d5ebffcac8d0faf1f4c [2024-11-09 23:57:36,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:57:36,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:57:36,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:57:36,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:57:36,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:57:36,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@105af3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36, skipping insertion in model container [2024-11-09 23:57:36,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:57:36,617 WARN L250 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_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2024-11-09 23:57:36,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:57:36,669 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:57:36,698 WARN L250 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_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2024-11-09 23:57:36,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:57:36,724 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:57:36,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36 WrapperNode [2024-11-09 23:57:36,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:57:36,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:57:36,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:57:36,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:57:36,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,765 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 290 [2024-11-09 23:57:36,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:57:36,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:57:36,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:57:36,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:57:36,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,801 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-11-09 23:57:36,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,814 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:57:36,832 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:57:36,832 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:57:36,832 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:57:36,833 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36" (1/1) ... [2024-11-09 23:57:36,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:57:36,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:57:36,870 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-11-09 23:57:36,875 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-11-09 23:57:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:57:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:57:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:57:36,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:57:37,021 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:57:37,023 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:57:37,365 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-09 23:57:37,368 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L358: havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-09 23:57:37,368 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L194: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:57:37,368 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L194: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:57:37,368 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L194: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:57:37,368 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L194: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:57:37,369 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L194: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:57:37,369 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-09 23:57:37,369 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,369 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,369 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,369 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,369 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,369 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,369 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,370 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,370 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,370 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,370 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,370 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,370 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,370 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,370 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,370 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,371 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:37,371 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-09 23:57:37,371 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-09 23:57:37,371 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc main_~node3__m3~0#1;havoc main_~node2__m2~0#1; [2024-11-09 23:57:37,418 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-09 23:57:37,419 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:57:37,439 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:57:37,440 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:57:37,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:57:37 BoogieIcfgContainer [2024-11-09 23:57:37,441 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:57:37,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:57:37,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:57:37,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:57:37,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:57:36" (1/3) ... [2024-11-09 23:57:37,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd6327d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:57:37, skipping insertion in model container [2024-11-09 23:57:37,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:36" (2/3) ... [2024-11-09 23:57:37,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd6327d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:57:37, skipping insertion in model container [2024-11-09 23:57:37,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:57:37" (3/3) ... [2024-11-09 23:57:37,472 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-09 23:57:37,489 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:57:37,489 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:57:37,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:57:37,569 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;@197bbd0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:57:37,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:57:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 67 states have internal predecessors, (109), 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-11-09 23:57:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 23:57:37,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:37,582 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] [2024-11-09 23:57:37,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:37,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:37,588 INFO L85 PathProgramCache]: Analyzing trace with hash 46602337, now seen corresponding path program 1 times [2024-11-09 23:57:37,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:37,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340584493] [2024-11-09 23:57:37,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:37,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:38,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:38,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340584493] [2024-11-09 23:57:38,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340584493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:38,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:38,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:38,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529782640] [2024-11-09 23:57:38,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:38,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:38,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:38,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:38,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:38,056 INFO L87 Difference]: Start difference. First operand has 68 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 67 states have internal predecessors, (109), 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 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-11-09 23:57:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:38,116 INFO L93 Difference]: Finished difference Result 156 states and 240 transitions. [2024-11-09 23:57:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:38,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2024-11-09 23:57:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:38,142 INFO L225 Difference]: With dead ends: 156 [2024-11-09 23:57:38,143 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 23:57:38,146 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-11-09 23:57:38,151 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 64 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:38,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 220 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 23:57:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-11-09 23:57:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 98 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 142 transitions. [2024-11-09 23:57:38,188 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 142 transitions. Word has length 37 [2024-11-09 23:57:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:38,189 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 142 transitions. [2024-11-09 23:57:38,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-11-09 23:57:38,189 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 142 transitions. [2024-11-09 23:57:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 23:57:38,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:38,191 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] [2024-11-09 23:57:38,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:57:38,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:38,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:38,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1065804074, now seen corresponding path program 1 times [2024-11-09 23:57:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132780329] [2024-11-09 23:57:38,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:38,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:38,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:38,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132780329] [2024-11-09 23:57:38,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132780329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:38,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:38,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:38,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845880955] [2024-11-09 23:57:38,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:38,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:38,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:38,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:38,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:38,358 INFO L87 Difference]: Start difference. First operand 99 states and 142 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-11-09 23:57:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:38,397 INFO L93 Difference]: Finished difference Result 243 states and 362 transitions. [2024-11-09 23:57:38,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:38,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2024-11-09 23:57:38,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:38,402 INFO L225 Difference]: With dead ends: 243 [2024-11-09 23:57:38,402 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 23:57:38,403 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-11-09 23:57:38,404 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 49 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:38,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 185 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 23:57:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2024-11-09 23:57:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.475) internal successors, (236), 160 states have internal predecessors, (236), 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-11-09 23:57:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 236 transitions. [2024-11-09 23:57:38,419 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 236 transitions. Word has length 38 [2024-11-09 23:57:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:38,419 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 236 transitions. [2024-11-09 23:57:38,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-11-09 23:57:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2024-11-09 23:57:38,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 23:57:38,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:38,421 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] [2024-11-09 23:57:38,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:57:38,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:38,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:38,422 INFO L85 PathProgramCache]: Analyzing trace with hash 465615407, now seen corresponding path program 1 times [2024-11-09 23:57:38,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:38,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287719750] [2024-11-09 23:57:38,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:38,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:38,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:38,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287719750] [2024-11-09 23:57:38,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287719750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:38,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:38,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:38,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537231503] [2024-11-09 23:57:38,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:38,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:38,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:38,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:38,599 INFO L87 Difference]: Start difference. First operand 161 states and 236 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-11-09 23:57:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:38,754 INFO L93 Difference]: Finished difference Result 1013 states and 1538 transitions. [2024-11-09 23:57:38,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:57:38,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2024-11-09 23:57:38,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:38,765 INFO L225 Difference]: With dead ends: 1013 [2024-11-09 23:57:38,769 INFO L226 Difference]: Without dead ends: 871 [2024-11-09 23:57:38,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:57:38,773 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 386 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:38,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 641 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-11-09 23:57:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 301. [2024-11-09 23:57:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.48) internal successors, (444), 300 states have internal predecessors, (444), 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-11-09 23:57:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 444 transitions. [2024-11-09 23:57:38,828 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 444 transitions. Word has length 39 [2024-11-09 23:57:38,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:38,830 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 444 transitions. [2024-11-09 23:57:38,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-11-09 23:57:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 444 transitions. [2024-11-09 23:57:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 23:57:38,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:38,832 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] [2024-11-09 23:57:38,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:57:38,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:38,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash -178008617, now seen corresponding path program 1 times [2024-11-09 23:57:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253359409] [2024-11-09 23:57:38,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:38,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:39,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:39,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253359409] [2024-11-09 23:57:39,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253359409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:39,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:39,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:39,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524628993] [2024-11-09 23:57:39,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:39,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:39,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:39,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:39,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:39,155 INFO L87 Difference]: Start difference. First operand 301 states and 444 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-11-09 23:57:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:39,234 INFO L93 Difference]: Finished difference Result 585 states and 870 transitions. [2024-11-09 23:57:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:39,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 42 [2024-11-09 23:57:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:39,237 INFO L225 Difference]: With dead ends: 585 [2024-11-09 23:57:39,238 INFO L226 Difference]: Without dead ends: 303 [2024-11-09 23:57:39,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:57:39,242 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:39,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 298 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-09 23:57:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2024-11-09 23:57:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.4666666666666666) internal successors, (440), 300 states have internal predecessors, (440), 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-11-09 23:57:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 440 transitions. [2024-11-09 23:57:39,262 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 440 transitions. Word has length 42 [2024-11-09 23:57:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:39,262 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 440 transitions. [2024-11-09 23:57:39,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-11-09 23:57:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 440 transitions. [2024-11-09 23:57:39,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 23:57:39,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:39,264 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] [2024-11-09 23:57:39,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:57:39,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:39,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash 802217979, now seen corresponding path program 1 times [2024-11-09 23:57:39,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:39,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403826582] [2024-11-09 23:57:39,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:39,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:39,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:39,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403826582] [2024-11-09 23:57:39,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403826582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:39,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:39,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:39,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84613128] [2024-11-09 23:57:39,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:39,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:39,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:39,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:39,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:39,323 INFO L87 Difference]: Start difference. First operand 301 states and 440 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-11-09 23:57:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:39,341 INFO L93 Difference]: Finished difference Result 785 states and 1154 transitions. [2024-11-09 23:57:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:39,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2024-11-09 23:57:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:39,344 INFO L225 Difference]: With dead ends: 785 [2024-11-09 23:57:39,344 INFO L226 Difference]: Without dead ends: 503 [2024-11-09 23:57:39,345 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-11-09 23:57:39,346 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 56 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:39,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 201 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-09 23:57:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501. [2024-11-09 23:57:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.448) internal successors, (724), 500 states have internal predecessors, (724), 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-11-09 23:57:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 724 transitions. [2024-11-09 23:57:39,362 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 724 transitions. Word has length 42 [2024-11-09 23:57:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:39,363 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 724 transitions. [2024-11-09 23:57:39,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-11-09 23:57:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 724 transitions. [2024-11-09 23:57:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 23:57:39,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:39,366 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] [2024-11-09 23:57:39,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:57:39,366 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:39,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash 681255764, now seen corresponding path program 1 times [2024-11-09 23:57:39,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:39,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349328407] [2024-11-09 23:57:39,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:39,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:39,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:39,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349328407] [2024-11-09 23:57:39,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349328407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:39,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:39,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259239583] [2024-11-09 23:57:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:39,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:39,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:39,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:39,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:39,431 INFO L87 Difference]: Start difference. First operand 501 states and 724 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11-09 23:57:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:39,457 INFO L93 Difference]: Finished difference Result 1215 states and 1768 transitions. [2024-11-09 23:57:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:39,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2024-11-09 23:57:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:39,460 INFO L225 Difference]: With dead ends: 1215 [2024-11-09 23:57:39,460 INFO L226 Difference]: Without dead ends: 733 [2024-11-09 23:57:39,461 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-11-09 23:57:39,462 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:39,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 146 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:39,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-09 23:57:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 723. [2024-11-09 23:57:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 1.4321329639889198) internal successors, (1034), 722 states have internal predecessors, (1034), 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-11-09 23:57:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1034 transitions. [2024-11-09 23:57:39,477 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1034 transitions. Word has length 44 [2024-11-09 23:57:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:39,478 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1034 transitions. [2024-11-09 23:57:39,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11-09 23:57:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1034 transitions. [2024-11-09 23:57:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 23:57:39,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:39,480 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] [2024-11-09 23:57:39,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:57:39,480 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:39,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:39,481 INFO L85 PathProgramCache]: Analyzing trace with hash -947408902, now seen corresponding path program 1 times [2024-11-09 23:57:39,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:39,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632969451] [2024-11-09 23:57:39,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:39,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:39,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:39,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632969451] [2024-11-09 23:57:39,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632969451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:39,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:39,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:39,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116936670] [2024-11-09 23:57:39,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:39,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:39,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:39,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:39,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:39,730 INFO L87 Difference]: Start difference. First operand 723 states and 1034 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-11-09 23:57:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:39,759 INFO L93 Difference]: Finished difference Result 789 states and 1115 transitions. [2024-11-09 23:57:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:39,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 45 [2024-11-09 23:57:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:39,762 INFO L225 Difference]: With dead ends: 789 [2024-11-09 23:57:39,762 INFO L226 Difference]: Without dead ends: 787 [2024-11-09 23:57:39,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:39,764 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:39,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:39,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-09 23:57:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 787. [2024-11-09 23:57:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3918575063613232) internal successors, (1094), 786 states have internal predecessors, (1094), 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-11-09 23:57:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1094 transitions. [2024-11-09 23:57:39,781 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1094 transitions. Word has length 45 [2024-11-09 23:57:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:39,781 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1094 transitions. [2024-11-09 23:57:39,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-11-09 23:57:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1094 transitions. [2024-11-09 23:57:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 23:57:39,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:39,787 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:39,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:57:39,788 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:39,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1184404536, now seen corresponding path program 1 times [2024-11-09 23:57:39,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:39,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720908332] [2024-11-09 23:57:39,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:39,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:57:39,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:39,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720908332] [2024-11-09 23:57:39,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720908332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:39,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:39,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:39,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080253188] [2024-11-09 23:57:39,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:39,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:39,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:39,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:39,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:39,917 INFO L87 Difference]: Start difference. First operand 787 states and 1094 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-11-09 23:57:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:40,004 INFO L93 Difference]: Finished difference Result 3255 states and 4534 transitions. [2024-11-09 23:57:40,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:40,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 64 [2024-11-09 23:57:40,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:40,015 INFO L225 Difference]: With dead ends: 3255 [2024-11-09 23:57:40,015 INFO L226 Difference]: Without dead ends: 2489 [2024-11-09 23:57:40,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:40,020 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 233 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:40,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 393 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:40,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2024-11-09 23:57:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 1551. [2024-11-09 23:57:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1550 states have (on average 1.3896774193548387) internal successors, (2154), 1550 states have internal predecessors, (2154), 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-11-09 23:57:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2154 transitions. [2024-11-09 23:57:40,059 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2154 transitions. Word has length 64 [2024-11-09 23:57:40,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:40,060 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2154 transitions. [2024-11-09 23:57:40,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-11-09 23:57:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2154 transitions. [2024-11-09 23:57:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 23:57:40,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:40,065 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:40,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:57:40,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:40,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1263166073, now seen corresponding path program 1 times [2024-11-09 23:57:40,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:40,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124686483] [2024-11-09 23:57:40,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:40,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 23:57:40,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:40,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124686483] [2024-11-09 23:57:40,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124686483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:40,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:40,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:40,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875194771] [2024-11-09 23:57:40,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:40,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:40,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:40,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:40,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:40,245 INFO L87 Difference]: Start difference. First operand 1551 states and 2154 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-11-09 23:57:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:40,331 INFO L93 Difference]: Finished difference Result 4019 states and 5594 transitions. [2024-11-09 23:57:40,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:40,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 64 [2024-11-09 23:57:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:40,344 INFO L225 Difference]: With dead ends: 4019 [2024-11-09 23:57:40,344 INFO L226 Difference]: Without dead ends: 3253 [2024-11-09 23:57:40,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:40,349 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 241 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:40,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 379 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3253 states. [2024-11-09 23:57:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3253 to 2703. [2024-11-09 23:57:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2703 states, 2702 states have (on average 1.383419689119171) internal successors, (3738), 2702 states have internal predecessors, (3738), 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-11-09 23:57:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 3738 transitions. [2024-11-09 23:57:40,408 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 3738 transitions. Word has length 64 [2024-11-09 23:57:40,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:40,408 INFO L471 AbstractCegarLoop]: Abstraction has 2703 states and 3738 transitions. [2024-11-09 23:57:40,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-11-09 23:57:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3738 transitions. [2024-11-09 23:57:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:57:40,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:40,411 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:40,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:57:40,411 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:40,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:40,415 INFO L85 PathProgramCache]: Analyzing trace with hash -541213517, now seen corresponding path program 1 times [2024-11-09 23:57:40,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:40,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283649834] [2024-11-09 23:57:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:40,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 23:57:40,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:40,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283649834] [2024-11-09 23:57:40,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283649834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:40,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:40,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:40,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054102962] [2024-11-09 23:57:40,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:40,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:40,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:40,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:40,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:40,525 INFO L87 Difference]: Start difference. First operand 2703 states and 3738 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-11-09 23:57:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:40,604 INFO L93 Difference]: Finished difference Result 4343 states and 6046 transitions. [2024-11-09 23:57:40,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:40,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 65 [2024-11-09 23:57:40,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:40,616 INFO L225 Difference]: With dead ends: 4343 [2024-11-09 23:57:40,616 INFO L226 Difference]: Without dead ends: 3797 [2024-11-09 23:57:40,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:40,619 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 231 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:40,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 407 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2024-11-09 23:57:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3247. [2024-11-09 23:57:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3247 states, 3246 states have (on average 1.385705483672212) internal successors, (4498), 3246 states have internal predecessors, (4498), 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-11-09 23:57:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3247 states to 3247 states and 4498 transitions. [2024-11-09 23:57:40,680 INFO L78 Accepts]: Start accepts. Automaton has 3247 states and 4498 transitions. Word has length 65 [2024-11-09 23:57:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:40,680 INFO L471 AbstractCegarLoop]: Abstraction has 3247 states and 4498 transitions. [2024-11-09 23:57:40,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-11-09 23:57:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3247 states and 4498 transitions. [2024-11-09 23:57:40,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:57:40,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:40,682 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:40,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:57:40,682 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:40,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:40,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1181741804, now seen corresponding path program 1 times [2024-11-09 23:57:40,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:40,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580839562] [2024-11-09 23:57:40,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:40,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:40,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:40,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580839562] [2024-11-09 23:57:40,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580839562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:40,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:40,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:40,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119432252] [2024-11-09 23:57:40,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:40,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:40,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:40,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:40,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:40,780 INFO L87 Difference]: Start difference. First operand 3247 states and 4498 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-11-09 23:57:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:40,809 INFO L93 Difference]: Finished difference Result 5728 states and 7956 transitions. [2024-11-09 23:57:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:40,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 66 [2024-11-09 23:57:40,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:40,818 INFO L225 Difference]: With dead ends: 5728 [2024-11-09 23:57:40,818 INFO L226 Difference]: Without dead ends: 2502 [2024-11-09 23:57:40,822 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-11-09 23:57:40,823 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 40 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:40,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:40,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2024-11-09 23:57:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2500. [2024-11-09 23:57:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 2499 states have (on average 1.3769507803121248) internal successors, (3441), 2499 states have internal predecessors, (3441), 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-11-09 23:57:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3441 transitions. [2024-11-09 23:57:40,871 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3441 transitions. Word has length 66 [2024-11-09 23:57:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:40,872 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 3441 transitions. [2024-11-09 23:57:40,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-11-09 23:57:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3441 transitions. [2024-11-09 23:57:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:57:40,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:40,873 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:40,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:57:40,873 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:40,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1722076018, now seen corresponding path program 1 times [2024-11-09 23:57:40,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:40,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014196064] [2024-11-09 23:57:40,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:41,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:41,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014196064] [2024-11-09 23:57:41,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014196064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:57:41,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204200008] [2024-11-09 23:57:41,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:41,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:57:41,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:57:41,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:57:41,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:57:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:41,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 23:57:41,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:57:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:42,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:57:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:43,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204200008] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:57:43,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:57:43,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2024-11-09 23:57:43,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251640491] [2024-11-09 23:57:43,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:57:43,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 23:57:43,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:43,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 23:57:43,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2024-11-09 23:57:43,378 INFO L87 Difference]: Start difference. First operand 2500 states and 3441 transitions. Second operand has 30 states, 30 states have (on average 6.133333333333334) internal successors, (184), 30 states have internal predecessors, (184), 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-11-09 23:57:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:57,341 INFO L93 Difference]: Finished difference Result 65789 states and 91115 transitions. [2024-11-09 23:57:57,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2024-11-09 23:57:57,341 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.133333333333334) internal successors, (184), 30 states have internal predecessors, (184), 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 67 [2024-11-09 23:57:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:57,484 INFO L225 Difference]: With dead ends: 65789 [2024-11-09 23:57:57,484 INFO L226 Difference]: Without dead ends: 63312 [2024-11-09 23:57:57,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43925 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=12022, Invalid=89420, Unknown=0, NotChecked=0, Total=101442 [2024-11-09 23:57:57,522 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 8249 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8249 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 2679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:57,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8249 Valid, 1752 Invalid, 2679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 23:57:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63312 states. [2024-11-09 23:57:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63312 to 32995. [2024-11-09 23:57:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32995 states, 32994 states have (on average 1.3655816209007698) internal successors, (45056), 32994 states have internal predecessors, (45056), 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-11-09 23:57:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32995 states to 32995 states and 45056 transitions. [2024-11-09 23:57:58,432 INFO L78 Accepts]: Start accepts. Automaton has 32995 states and 45056 transitions. Word has length 67 [2024-11-09 23:57:58,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:58,432 INFO L471 AbstractCegarLoop]: Abstraction has 32995 states and 45056 transitions. [2024-11-09 23:57:58,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.133333333333334) internal successors, (184), 30 states have internal predecessors, (184), 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-11-09 23:57:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 32995 states and 45056 transitions. [2024-11-09 23:57:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 23:57:58,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:58,437 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:58,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:57:58,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 23:57:58,642 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:58,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash -233109516, now seen corresponding path program 1 times [2024-11-09 23:57:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:58,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929983630] [2024-11-09 23:57:58,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:58,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:58,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929983630] [2024-11-09 23:57:58,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929983630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:58,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:58,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:58,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716862166] [2024-11-09 23:57:58,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:58,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:58,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:58,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:58,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:58,746 INFO L87 Difference]: Start difference. First operand 32995 states and 45056 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-11-09 23:57:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:58,985 INFO L93 Difference]: Finished difference Result 51116 states and 69952 transitions. [2024-11-09 23:57:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:58,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 68 [2024-11-09 23:57:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:59,007 INFO L225 Difference]: With dead ends: 51116 [2024-11-09 23:57:59,008 INFO L226 Difference]: Without dead ends: 18237 [2024-11-09 23:57:59,036 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-11-09 23:57:59,037 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:59,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18237 states. [2024-11-09 23:57:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18237 to 18181. [2024-11-09 23:57:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18181 states, 18180 states have (on average 1.3481298129812982) internal successors, (24509), 18180 states have internal predecessors, (24509), 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-11-09 23:57:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18181 states to 18181 states and 24509 transitions. [2024-11-09 23:57:59,446 INFO L78 Accepts]: Start accepts. Automaton has 18181 states and 24509 transitions. Word has length 68 [2024-11-09 23:57:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:59,447 INFO L471 AbstractCegarLoop]: Abstraction has 18181 states and 24509 transitions. [2024-11-09 23:57:59,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-11-09 23:57:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 18181 states and 24509 transitions. [2024-11-09 23:57:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 23:57:59,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:59,449 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:59,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:57:59,449 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:59,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:59,449 INFO L85 PathProgramCache]: Analyzing trace with hash 469583285, now seen corresponding path program 1 times [2024-11-09 23:57:59,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:59,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049205751] [2024-11-09 23:57:59,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:59,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:00,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:00,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049205751] [2024-11-09 23:58:00,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049205751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:58:00,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184570900] [2024-11-09 23:58:00,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:00,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:58:00,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:58:00,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:58:00,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:58:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:00,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 23:58:00,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:58:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:01,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:58:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:02,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184570900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:58:02,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:58:02,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 39 [2024-11-09 23:58:02,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406977216] [2024-11-09 23:58:02,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:58:02,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 23:58:02,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:02,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 23:58:02,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 23:58:02,272 INFO L87 Difference]: Start difference. First operand 18181 states and 24509 transitions. Second operand has 39 states, 39 states have (on average 4.871794871794871) internal successors, (190), 39 states have internal predecessors, (190), 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-11-09 23:58:09,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:09,668 INFO L93 Difference]: Finished difference Result 81759 states and 110055 transitions. [2024-11-09 23:58:09,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2024-11-09 23:58:09,668 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.871794871794871) internal successors, (190), 39 states have internal predecessors, (190), 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 68 [2024-11-09 23:58:09,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:09,780 INFO L225 Difference]: With dead ends: 81759 [2024-11-09 23:58:09,780 INFO L226 Difference]: Without dead ends: 69715 [2024-11-09 23:58:09,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6281 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=3639, Invalid=17823, Unknown=0, NotChecked=0, Total=21462 [2024-11-09 23:58:09,811 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 5624 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5624 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:09,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5624 Valid, 1795 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 23:58:09,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69715 states. [2024-11-09 23:58:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69715 to 57684. [2024-11-09 23:58:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57684 states, 57683 states have (on average 1.3418858242463116) internal successors, (77404), 57683 states have internal predecessors, (77404), 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-11-09 23:58:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57684 states to 57684 states and 77404 transitions. [2024-11-09 23:58:10,573 INFO L78 Accepts]: Start accepts. Automaton has 57684 states and 77404 transitions. Word has length 68 [2024-11-09 23:58:10,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:10,573 INFO L471 AbstractCegarLoop]: Abstraction has 57684 states and 77404 transitions. [2024-11-09 23:58:10,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.871794871794871) internal successors, (190), 39 states have internal predecessors, (190), 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-11-09 23:58:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 57684 states and 77404 transitions. [2024-11-09 23:58:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:58:10,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:10,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:10,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 23:58:10,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 23:58:10,781 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:10,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash -577690950, now seen corresponding path program 1 times [2024-11-09 23:58:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033890145] [2024-11-09 23:58:10,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 23:58:10,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:10,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033890145] [2024-11-09 23:58:10,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033890145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:10,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:10,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:58:10,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526118000] [2024-11-09 23:58:10,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:10,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:58:10,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:10,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:58:10,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:10,828 INFO L87 Difference]: Start difference. First operand 57684 states and 77404 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-11-09 23:58:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:11,058 INFO L93 Difference]: Finished difference Result 105062 states and 141089 transitions. [2024-11-09 23:58:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:58:11,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 69 [2024-11-09 23:58:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:11,364 INFO L225 Difference]: With dead ends: 105062 [2024-11-09 23:58:11,364 INFO L226 Difference]: Without dead ends: 47480 [2024-11-09 23:58:11,426 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-11-09 23:58:11,426 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 58 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:11,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 98 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:11,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47480 states. [2024-11-09 23:58:11,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47480 to 47480. [2024-11-09 23:58:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47480 states, 47479 states have (on average 1.328418879925862) internal successors, (63072), 47479 states have internal predecessors, (63072), 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-11-09 23:58:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47480 states to 47480 states and 63072 transitions. [2024-11-09 23:58:12,040 INFO L78 Accepts]: Start accepts. Automaton has 47480 states and 63072 transitions. Word has length 69 [2024-11-09 23:58:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:12,041 INFO L471 AbstractCegarLoop]: Abstraction has 47480 states and 63072 transitions. [2024-11-09 23:58:12,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-11-09 23:58:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 47480 states and 63072 transitions. [2024-11-09 23:58:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:58:12,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:12,043 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:12,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:58:12,043 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:12,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1997036702, now seen corresponding path program 1 times [2024-11-09 23:58:12,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:12,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470435734] [2024-11-09 23:58:12,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 23:58:12,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:12,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470435734] [2024-11-09 23:58:12,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470435734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:12,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:12,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:58:12,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605307838] [2024-11-09 23:58:12,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:12,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:58:12,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:12,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:58:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:12,084 INFO L87 Difference]: Start difference. First operand 47480 states and 63072 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-11-09 23:58:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:12,244 INFO L93 Difference]: Finished difference Result 73647 states and 97789 transitions. [2024-11-09 23:58:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:58:12,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 69 [2024-11-09 23:58:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:12,270 INFO L225 Difference]: With dead ends: 73647 [2024-11-09 23:58:12,270 INFO L226 Difference]: Without dead ends: 26229 [2024-11-09 23:58:12,295 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-11-09 23:58:12,296 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 56 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:12,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 105 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26229 states. [2024-11-09 23:58:12,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26229 to 26229. [2024-11-09 23:58:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26229 states, 26228 states have (on average 1.315731279548574) internal successors, (34509), 26228 states have internal predecessors, (34509), 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-11-09 23:58:12,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26229 states to 26229 states and 34509 transitions. [2024-11-09 23:58:12,749 INFO L78 Accepts]: Start accepts. Automaton has 26229 states and 34509 transitions. Word has length 69 [2024-11-09 23:58:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:12,749 INFO L471 AbstractCegarLoop]: Abstraction has 26229 states and 34509 transitions. [2024-11-09 23:58:12,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-11-09 23:58:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 26229 states and 34509 transitions. [2024-11-09 23:58:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 23:58:12,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:12,751 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:12,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:58:12,751 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:12,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1160176581, now seen corresponding path program 1 times [2024-11-09 23:58:12,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:12,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337210747] [2024-11-09 23:58:12,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:12,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:58:12,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:12,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337210747] [2024-11-09 23:58:12,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337210747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:12,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:12,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:58:12,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357880190] [2024-11-09 23:58:12,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:12,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:58:12,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:12,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:58:12,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:58:12,839 INFO L87 Difference]: Start difference. First operand 26229 states and 34509 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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-11-09 23:58:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:13,242 INFO L93 Difference]: Finished difference Result 52411 states and 68969 transitions. [2024-11-09 23:58:13,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:58:13,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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 70 [2024-11-09 23:58:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:13,282 INFO L225 Difference]: With dead ends: 52411 [2024-11-09 23:58:13,282 INFO L226 Difference]: Without dead ends: 26229 [2024-11-09 23:58:13,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:58:13,305 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 199 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:13,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 75 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:58:13,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26229 states. [2024-11-09 23:58:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26229 to 26229. [2024-11-09 23:58:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26229 states, 26228 states have (on average 1.3032636876620405) internal successors, (34182), 26228 states have internal predecessors, (34182), 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-11-09 23:58:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26229 states to 26229 states and 34182 transitions. [2024-11-09 23:58:13,850 INFO L78 Accepts]: Start accepts. Automaton has 26229 states and 34182 transitions. Word has length 70 [2024-11-09 23:58:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:13,851 INFO L471 AbstractCegarLoop]: Abstraction has 26229 states and 34182 transitions. [2024-11-09 23:58:13,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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-11-09 23:58:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 26229 states and 34182 transitions. [2024-11-09 23:58:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 23:58:13,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:13,853 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:13,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:58:13,854 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:13,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2027260844, now seen corresponding path program 1 times [2024-11-09 23:58:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:13,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004511995] [2024-11-09 23:58:13,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:13,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:14,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:14,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004511995] [2024-11-09 23:58:14,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004511995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:58:14,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065327804] [2024-11-09 23:58:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:14,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:58:14,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:58:14,404 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:58:14,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:58:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:14,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 23:58:14,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:58:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:14,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:58:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:14,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065327804] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:58:14,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:58:14,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2024-11-09 23:58:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918521075] [2024-11-09 23:58:14,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:58:14,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 23:58:14,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 23:58:14,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:58:14,872 INFO L87 Difference]: Start difference. First operand 26229 states and 34182 transitions. Second operand has 21 states, 21 states have (on average 9.428571428571429) internal successors, (198), 21 states have internal predecessors, (198), 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-11-09 23:58:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:19,210 INFO L93 Difference]: Finished difference Result 105174 states and 135656 transitions. [2024-11-09 23:58:19,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2024-11-09 23:58:19,210 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.428571428571429) internal successors, (198), 21 states have internal predecessors, (198), 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 71 [2024-11-09 23:58:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:19,284 INFO L225 Difference]: With dead ends: 105174 [2024-11-09 23:58:19,284 INFO L226 Difference]: Without dead ends: 78071 [2024-11-09 23:58:19,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7107 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2933, Invalid=14889, Unknown=0, NotChecked=0, Total=17822 [2024-11-09 23:58:19,313 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 4074 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4074 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:19,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4074 Valid, 1022 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:58:19,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78071 states. [2024-11-09 23:58:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78071 to 65752. [2024-11-09 23:58:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65752 states, 65751 states have (on average 1.2742924061991452) internal successors, (83786), 65751 states have internal predecessors, (83786), 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-11-09 23:58:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65752 states to 65752 states and 83786 transitions. [2024-11-09 23:58:20,109 INFO L78 Accepts]: Start accepts. Automaton has 65752 states and 83786 transitions. Word has length 71 [2024-11-09 23:58:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:20,109 INFO L471 AbstractCegarLoop]: Abstraction has 65752 states and 83786 transitions. [2024-11-09 23:58:20,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.428571428571429) internal successors, (198), 21 states have internal predecessors, (198), 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-11-09 23:58:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 65752 states and 83786 transitions. [2024-11-09 23:58:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 23:58:20,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:20,110 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:20,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 23:58:20,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 23:58:20,311 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:20,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1500537114, now seen corresponding path program 1 times [2024-11-09 23:58:20,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:20,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842000271] [2024-11-09 23:58:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:20,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:58:20,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:20,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842000271] [2024-11-09 23:58:20,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842000271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:20,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:20,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:58:20,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691881555] [2024-11-09 23:58:20,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:20,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:58:20,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:20,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:58:20,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:20,372 INFO L87 Difference]: Start difference. First operand 65752 states and 83786 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-11-09 23:58:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:21,042 INFO L93 Difference]: Finished difference Result 124035 states and 158188 transitions. [2024-11-09 23:58:21,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:58:21,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 71 [2024-11-09 23:58:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:21,150 INFO L225 Difference]: With dead ends: 124035 [2024-11-09 23:58:21,150 INFO L226 Difference]: Without dead ends: 58350 [2024-11-09 23:58:21,173 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-11-09 23:58:21,173 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:21,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 80 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58350 states. [2024-11-09 23:58:21,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58350 to 58350. [2024-11-09 23:58:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58350 states, 58349 states have (on average 1.261101304221152) internal successors, (73584), 58349 states have internal predecessors, (73584), 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-11-09 23:58:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58350 states to 58350 states and 73584 transitions. [2024-11-09 23:58:22,000 INFO L78 Accepts]: Start accepts. Automaton has 58350 states and 73584 transitions. Word has length 71 [2024-11-09 23:58:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:22,000 INFO L471 AbstractCegarLoop]: Abstraction has 58350 states and 73584 transitions. [2024-11-09 23:58:22,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-11-09 23:58:22,001 INFO L276 IsEmpty]: Start isEmpty. Operand 58350 states and 73584 transitions. [2024-11-09 23:58:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 23:58:22,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:22,003 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 23:58:22,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:58:22,003 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:22,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1942088249, now seen corresponding path program 1 times [2024-11-09 23:58:22,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:22,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868740405] [2024-11-09 23:58:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:22,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:22,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:22,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868740405] [2024-11-09 23:58:22,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868740405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:58:22,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368695045] [2024-11-09 23:58:22,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:22,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:58:22,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:58:22,161 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:58:22,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:58:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:22,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:58:22,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:58:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:22,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:58:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:22,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368695045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:58:22,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:58:22,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-09 23:58:22,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800636910] [2024-11-09 23:58:22,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:58:22,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:58:22,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:58:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:58:22,622 INFO L87 Difference]: Start difference. First operand 58350 states and 73584 transitions. Second operand has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 10 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:22,909 INFO L93 Difference]: Finished difference Result 92971 states and 117457 transitions. [2024-11-09 23:58:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:58:22,910 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 10 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-09 23:58:22,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:22,970 INFO L225 Difference]: With dead ends: 92971 [2024-11-09 23:58:22,970 INFO L226 Difference]: Without dead ends: 51472 [2024-11-09 23:58:22,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 178 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:58:22,999 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 338 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:22,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 254 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:58:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51472 states. [2024-11-09 23:58:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51472 to 51470. [2024-11-09 23:58:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51470 states, 51469 states have (on average 1.2429229244788125) internal successors, (63972), 51469 states have internal predecessors, (63972), 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-11-09 23:58:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51470 states to 51470 states and 63972 transitions. [2024-11-09 23:58:23,634 INFO L78 Accepts]: Start accepts. Automaton has 51470 states and 63972 transitions. Word has length 94 [2024-11-09 23:58:23,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:23,634 INFO L471 AbstractCegarLoop]: Abstraction has 51470 states and 63972 transitions. [2024-11-09 23:58:23,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 10 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 51470 states and 63972 transitions. [2024-11-09 23:58:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 23:58:23,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:23,639 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-11-09 23:58:23,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 23:58:23,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:58:23,839 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:23,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:23,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1548708700, now seen corresponding path program 1 times [2024-11-09 23:58:23,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:23,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238786004] [2024-11-09 23:58:23,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:23,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:24,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:24,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238786004] [2024-11-09 23:58:24,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238786004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:58:24,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102032740] [2024-11-09 23:58:24,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:24,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:58:24,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:58:24,908 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:58:24,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 23:58:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:25,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 23:58:25,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:58:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 30 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:27,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:58:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 30 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:30,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102032740] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:58:30,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:58:30,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25, 22] total 61 [2024-11-09 23:58:30,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063866847] [2024-11-09 23:58:30,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:58:30,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-09 23:58:30,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:30,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-09 23:58:30,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2024-11-09 23:58:30,067 INFO L87 Difference]: Start difference. First operand 51470 states and 63972 transitions. Second operand has 61 states, 61 states have (on average 5.344262295081967) internal successors, (326), 61 states have internal predecessors, (326), 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)