./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-58.i -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 ecf82f73685a389a6d8ab3479ee5cabf8a5c47771e1a4d141e5607a0c68dd324 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:39:23,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:39:23,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:39:23,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:39:23,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:39:23,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:39:23,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:39:23,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:39:23,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:39:23,382 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:39:23,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:39:23,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:39:23,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:39:23,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:39:23,386 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:39:23,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:39:23,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:39:23,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:39:23,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:39:23,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:39:23,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:39:23,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:39:23,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:39:23,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:39:23,389 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:39:23,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:39:23,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:39:23,390 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:39:23,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:39:23,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:39:23,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:39:23,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:39:23,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:39:23,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:39:23,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:39:23,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:39:23,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:39:23,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:39:23,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:39:23,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:39:23,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:39:23,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:39:23,398 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 -> ecf82f73685a389a6d8ab3479ee5cabf8a5c47771e1a4d141e5607a0c68dd324 [2024-10-24 11:39:23,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:39:23,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:39:23,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:39:23,656 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:39:23,657 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:39:23,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-58.i [2024-10-24 11:39:25,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:39:25,313 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:39:25,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-58.i [2024-10-24 11:39:25,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77feb71b8/c9029e79eef44fd6ba991bfb1f0fa969/FLAGd4c198630 [2024-10-24 11:39:25,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77feb71b8/c9029e79eef44fd6ba991bfb1f0fa969 [2024-10-24 11:39:25,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:39:25,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:39:25,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:39:25,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:39:25,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:39:25,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1407178e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25, skipping insertion in model container [2024-10-24 11:39:25,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:39:25,656 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-58.i[916,929] [2024-10-24 11:39:25,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:39:25,721 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:39:25,731 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-58.i[916,929] [2024-10-24 11:39:25,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:39:25,776 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:39:25,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25 WrapperNode [2024-10-24 11:39:25,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:39:25,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:39:25,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:39:25,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:39:25,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,833 INFO L138 Inliner]: procedures = 26, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 467 [2024-10-24 11:39:25,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:39:25,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:39:25,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:39:25,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:39:25,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,877 INFO L175 MemorySlicer]: Split 125 memory accesses to 12 slices as follows [2, 7, 28, 16, 8, 12, 7, 11, 6, 19, 6, 3]. 22 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 3, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1]. [2024-10-24 11:39:25,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:39:25,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:39:25,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:39:25,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:39:25,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25" (1/1) ... [2024-10-24 11:39:25,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:39:25,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:39:25,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:39:25,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:39:26,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:39:26,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:39:26,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:39:26,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:39:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:39:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:39:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:39:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 11:39:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 11:39:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-24 11:39:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-24 11:39:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-24 11:39:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-24 11:39:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:39:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:39:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:39:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:39:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:39:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:39:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 11:39:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 11:39:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-24 11:39:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-24 11:39:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-24 11:39:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-24 11:39:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:39:26,008 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:39:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:39:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:39:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:39:26,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:39:26,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:39:26,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:39:26,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 11:39:26,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 11:39:26,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-24 11:39:26,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-24 11:39:26,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-24 11:39:26,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-24 11:39:26,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:39:26,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:39:26,159 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:39:26,161 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:39:26,641 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-24 11:39:26,641 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:39:26,675 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:39:26,676 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:39:26,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:39:26 BoogieIcfgContainer [2024-10-24 11:39:26,676 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:39:26,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:39:26,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:39:26,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:39:26,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:39:25" (1/3) ... [2024-10-24 11:39:26,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a6ee56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:39:26, skipping insertion in model container [2024-10-24 11:39:26,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:25" (2/3) ... [2024-10-24 11:39:26,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a6ee56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:39:26, skipping insertion in model container [2024-10-24 11:39:26,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:39:26" (3/3) ... [2024-10-24 11:39:26,689 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-58.i [2024-10-24 11:39:26,705 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:39:26,706 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:39:26,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:39:26,775 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;@5e703dc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:39:26,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:39:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:39:26,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:39:26,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:26,797 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:26,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:26,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:26,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1705673958, now seen corresponding path program 1 times [2024-10-24 11:39:26,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:26,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92253476] [2024-10-24 11:39:26,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:26,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:27,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92253476] [2024-10-24 11:39:27,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92253476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:27,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:27,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:39:27,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382376278] [2024-10-24 11:39:27,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:27,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:39:27,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:39:27,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:39:27,333 INFO L87 Difference]: Start difference. First operand has 85 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:39:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:27,382 INFO L93 Difference]: Finished difference Result 163 states and 259 transitions. [2024-10-24 11:39:27,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:39:27,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 111 [2024-10-24 11:39:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:27,394 INFO L225 Difference]: With dead ends: 163 [2024-10-24 11:39:27,394 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 11:39:27,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:39:27,404 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:27,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:39:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 11:39:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-24 11:39:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:39:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2024-10-24 11:39:27,452 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 111 [2024-10-24 11:39:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:27,454 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2024-10-24 11:39:27,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 11:39:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2024-10-24 11:39:27,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:39:27,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:27,460 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:27,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:39:27,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:27,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1642599684, now seen corresponding path program 1 times [2024-10-24 11:39:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:27,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342705849] [2024-10-24 11:39:27,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:27,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:27,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:27,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342705849] [2024-10-24 11:39:27,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342705849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:27,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:27,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:39:27,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072840576] [2024-10-24 11:39:27,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:27,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:39:27,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:27,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:39:27,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:39:27,804 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:39:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:27,859 INFO L93 Difference]: Finished difference Result 160 states and 229 transitions. [2024-10-24 11:39:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:39:27,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-10-24 11:39:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:27,861 INFO L225 Difference]: With dead ends: 160 [2024-10-24 11:39:27,861 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 11:39:27,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:39:27,863 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 314 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-10-24 11:39:27,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 314 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:39:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 11:39:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-10-24 11:39:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:39:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-10-24 11:39:27,875 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 111 [2024-10-24 11:39:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:27,876 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-10-24 11:39:27,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:39:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-10-24 11:39:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:39:27,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:27,879 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:27,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:39:27,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:27,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1642659266, now seen corresponding path program 1 times [2024-10-24 11:39:27,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:27,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738160255] [2024-10-24 11:39:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:27,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:28,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:28,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738160255] [2024-10-24 11:39:28,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738160255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:28,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:28,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:39:28,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429861944] [2024-10-24 11:39:28,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:28,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:39:28,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:28,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:39:28,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:39:28,776 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:39:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:28,960 INFO L93 Difference]: Finished difference Result 204 states and 289 transitions. [2024-10-24 11:39:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:39:28,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-10-24 11:39:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:28,964 INFO L225 Difference]: With dead ends: 204 [2024-10-24 11:39:28,964 INFO L226 Difference]: Without dead ends: 124 [2024-10-24 11:39:28,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:39:28,966 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 52 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:28,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 513 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:39:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-24 11:39:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2024-10-24 11:39:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 11:39:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-10-24 11:39:28,985 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 111 [2024-10-24 11:39:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:28,986 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-10-24 11:39:28,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:39:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-10-24 11:39:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:39:28,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:28,992 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:28,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:39:28,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:28,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1951243452, now seen corresponding path program 1 times [2024-10-24 11:39:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190363483] [2024-10-24 11:39:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:31,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:31,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190363483] [2024-10-24 11:39:31,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190363483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:31,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:31,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 11:39:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939562132] [2024-10-24 11:39:31,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:31,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 11:39:31,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:31,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 11:39:31,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:39:31,245 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 16 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 8 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-24 11:39:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:32,165 INFO L93 Difference]: Finished difference Result 234 states and 329 transitions. [2024-10-24 11:39:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:39:32,168 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 8 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) Word has length 111 [2024-10-24 11:39:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:32,169 INFO L225 Difference]: With dead ends: 234 [2024-10-24 11:39:32,169 INFO L226 Difference]: Without dead ends: 140 [2024-10-24 11:39:32,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:39:32,175 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 230 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:32,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 544 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:39:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-24 11:39:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2024-10-24 11:39:32,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.3425925925925926) internal successors, (145), 109 states have internal predecessors, (145), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:39:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 179 transitions. [2024-10-24 11:39:32,203 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 179 transitions. Word has length 111 [2024-10-24 11:39:32,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:32,208 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 179 transitions. [2024-10-24 11:39:32,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 8 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-24 11:39:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 179 transitions. [2024-10-24 11:39:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:39:32,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:32,209 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:32,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:39:32,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:32,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1943293965, now seen corresponding path program 1 times [2024-10-24 11:39:32,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:32,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402281998] [2024-10-24 11:39:32,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:32,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:32,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:32,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402281998] [2024-10-24 11:39:32,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402281998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:32,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:32,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:39:32,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840751387] [2024-10-24 11:39:32,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:32,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:39:32,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:32,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:39:32,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:32,504 INFO L87 Difference]: Start difference. First operand 128 states and 179 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:39:32,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:32,716 INFO L93 Difference]: Finished difference Result 336 states and 469 transitions. [2024-10-24 11:39:32,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:39:32,717 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-10-24 11:39:32,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:32,720 INFO L225 Difference]: With dead ends: 336 [2024-10-24 11:39:32,720 INFO L226 Difference]: Without dead ends: 209 [2024-10-24 11:39:32,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:39:32,724 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 103 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:32,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 493 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:39:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-24 11:39:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-10-24 11:39:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 168 states have (on average 1.3095238095238095) internal successors, (220), 170 states have internal predecessors, (220), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:39:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2024-10-24 11:39:32,767 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 111 [2024-10-24 11:39:32,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:32,767 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2024-10-24 11:39:32,768 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:39:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2024-10-24 11:39:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:39:32,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:32,769 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:32,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:39:32,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:32,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash 621590912, now seen corresponding path program 1 times [2024-10-24 11:39:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:32,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961018466] [2024-10-24 11:39:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:33,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:33,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961018466] [2024-10-24 11:39:33,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961018466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:33,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:33,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:39:33,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276482459] [2024-10-24 11:39:33,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:33,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:39:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:33,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:39:33,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:39:33,946 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 15 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 8 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-24 11:39:34,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:34,710 INFO L93 Difference]: Finished difference Result 451 states and 627 transitions. [2024-10-24 11:39:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:39:34,711 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 8 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) Word has length 111 [2024-10-24 11:39:34,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:34,714 INFO L225 Difference]: With dead ends: 451 [2024-10-24 11:39:34,714 INFO L226 Difference]: Without dead ends: 253 [2024-10-24 11:39:34,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:39:34,716 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 464 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:34,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 734 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:39:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-24 11:39:34,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 221. [2024-10-24 11:39:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 184 states have internal predecessors, (239), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:39:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 307 transitions. [2024-10-24 11:39:34,749 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 307 transitions. Word has length 111 [2024-10-24 11:39:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:34,750 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 307 transitions. [2024-10-24 11:39:34,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 8 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-24 11:39:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 307 transitions. [2024-10-24 11:39:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 11:39:34,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:34,751 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:34,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:39:34,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:34,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:34,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1322655490, now seen corresponding path program 1 times [2024-10-24 11:39:34,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:34,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579689732] [2024-10-24 11:39:34,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:34,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:35,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:35,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579689732] [2024-10-24 11:39:35,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579689732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:35,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:35,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:39:35,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93964935] [2024-10-24 11:39:35,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:35,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:39:35,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:35,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:39:35,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:39:35,469 INFO L87 Difference]: Start difference. First operand 221 states and 307 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:39:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:35,848 INFO L93 Difference]: Finished difference Result 477 states and 660 transitions. [2024-10-24 11:39:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:39:35,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 111 [2024-10-24 11:39:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:35,851 INFO L225 Difference]: With dead ends: 477 [2024-10-24 11:39:35,851 INFO L226 Difference]: Without dead ends: 265 [2024-10-24 11:39:35,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:39:35,853 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 228 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:35,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 791 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:39:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-24 11:39:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2024-10-24 11:39:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 215 states have (on average 1.302325581395349) internal successors, (280), 218 states have internal predecessors, (280), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:39:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 360 transitions. [2024-10-24 11:39:35,893 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 360 transitions. Word has length 111 [2024-10-24 11:39:35,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:35,895 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 360 transitions. [2024-10-24 11:39:35,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:39:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 360 transitions. [2024-10-24 11:39:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 11:39:35,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:35,897 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:35,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:39:35,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:35,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:35,897 INFO L85 PathProgramCache]: Analyzing trace with hash 638888476, now seen corresponding path program 1 times [2024-10-24 11:39:35,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:35,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327132075] [2024-10-24 11:39:35,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:35,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:36,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:36,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327132075] [2024-10-24 11:39:36,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327132075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:36,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:36,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:39:36,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256943425] [2024-10-24 11:39:36,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:36,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:39:36,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:36,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:39:36,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:39:36,505 INFO L87 Difference]: Start difference. First operand 262 states and 360 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:39:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:36,866 INFO L93 Difference]: Finished difference Result 509 states and 699 transitions. [2024-10-24 11:39:36,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:39:36,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 112 [2024-10-24 11:39:36,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:36,869 INFO L225 Difference]: With dead ends: 509 [2024-10-24 11:39:36,870 INFO L226 Difference]: Without dead ends: 223 [2024-10-24 11:39:36,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:39:36,871 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 179 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:36,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 498 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:39:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-24 11:39:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2024-10-24 11:39:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 176 states have (on average 1.2613636363636365) internal successors, (222), 178 states have internal predecessors, (222), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 298 transitions. [2024-10-24 11:39:36,903 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 298 transitions. Word has length 112 [2024-10-24 11:39:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:36,903 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 298 transitions. [2024-10-24 11:39:36,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:39:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 298 transitions. [2024-10-24 11:39:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 11:39:36,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:36,905 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:36,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:39:36,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:36,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash 939523175, now seen corresponding path program 1 times [2024-10-24 11:39:36,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:36,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572610829] [2024-10-24 11:39:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:36,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:37,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:37,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572610829] [2024-10-24 11:39:37,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572610829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:37,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:37,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:39:37,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096438912] [2024-10-24 11:39:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:37,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:39:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:37,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:39:37,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:39:37,592 INFO L87 Difference]: Start difference. First operand 221 states and 298 transitions. Second operand has 10 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:39:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:38,124 INFO L93 Difference]: Finished difference Result 472 states and 639 transitions. [2024-10-24 11:39:38,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:39:38,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 112 [2024-10-24 11:39:38,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:38,127 INFO L225 Difference]: With dead ends: 472 [2024-10-24 11:39:38,127 INFO L226 Difference]: Without dead ends: 260 [2024-10-24 11:39:38,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:39:38,130 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 268 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:38,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 561 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:39:38,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-24 11:39:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 233. [2024-10-24 11:39:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 188 states have (on average 1.2659574468085106) internal successors, (238), 190 states have internal predecessors, (238), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 314 transitions. [2024-10-24 11:39:38,166 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 314 transitions. Word has length 112 [2024-10-24 11:39:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:38,166 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 314 transitions. [2024-10-24 11:39:38,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:39:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 314 transitions. [2024-10-24 11:39:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 11:39:38,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:38,168 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:38,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:39:38,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:38,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:38,169 INFO L85 PathProgramCache]: Analyzing trace with hash 238458597, now seen corresponding path program 1 times [2024-10-24 11:39:38,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:38,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816691049] [2024-10-24 11:39:38,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:38,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:38,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816691049] [2024-10-24 11:39:38,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816691049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:38,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:38,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:39:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837269327] [2024-10-24 11:39:38,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:38,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:39:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:38,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:39:38,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:39:38,654 INFO L87 Difference]: Start difference. First operand 233 states and 314 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:39:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:38,926 INFO L93 Difference]: Finished difference Result 484 states and 654 transitions. [2024-10-24 11:39:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:39:38,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-10-24 11:39:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:38,930 INFO L225 Difference]: With dead ends: 484 [2024-10-24 11:39:38,930 INFO L226 Difference]: Without dead ends: 260 [2024-10-24 11:39:38,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:39:38,931 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 48 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:38,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 772 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:39:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-24 11:39:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 236. [2024-10-24 11:39:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 191 states have (on average 1.2617801047120418) internal successors, (241), 193 states have internal predecessors, (241), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 317 transitions. [2024-10-24 11:39:38,965 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 317 transitions. Word has length 112 [2024-10-24 11:39:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:38,966 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 317 transitions. [2024-10-24 11:39:38,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:39:38,966 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 317 transitions. [2024-10-24 11:39:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 11:39:38,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:38,967 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:38,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:39:38,968 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:38,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:38,968 INFO L85 PathProgramCache]: Analyzing trace with hash -648824727, now seen corresponding path program 1 times [2024-10-24 11:39:38,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:38,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263782225] [2024-10-24 11:39:38,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:38,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:39,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:39,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263782225] [2024-10-24 11:39:39,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263782225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:39,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:39,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:39:39,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114675498] [2024-10-24 11:39:39,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:39,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:39:39,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:39,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:39:39,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:39:39,418 INFO L87 Difference]: Start difference. First operand 236 states and 317 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:39:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:39,665 INFO L93 Difference]: Finished difference Result 498 states and 669 transitions. [2024-10-24 11:39:39,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:39:39,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-10-24 11:39:39,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:39,668 INFO L225 Difference]: With dead ends: 498 [2024-10-24 11:39:39,669 INFO L226 Difference]: Without dead ends: 271 [2024-10-24 11:39:39,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:39:39,670 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 60 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:39,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 977 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:39:39,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-24 11:39:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 260. [2024-10-24 11:39:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 215 states have (on average 1.2744186046511627) internal successors, (274), 217 states have internal predecessors, (274), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 350 transitions. [2024-10-24 11:39:39,701 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 350 transitions. Word has length 112 [2024-10-24 11:39:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:39,701 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 350 transitions. [2024-10-24 11:39:39,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:39:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 350 transitions. [2024-10-24 11:39:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 11:39:39,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:39,703 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:39,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:39:39,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:39,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:39,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1349889305, now seen corresponding path program 1 times [2024-10-24 11:39:39,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:39,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026272288] [2024-10-24 11:39:39,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:39,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:40,263 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:40,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:40,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026272288] [2024-10-24 11:39:40,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026272288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:40,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:40,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:39:40,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083628734] [2024-10-24 11:39:40,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:40,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:39:40,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:40,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:39:40,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:39:40,265 INFO L87 Difference]: Start difference. First operand 260 states and 350 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:39:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:40,681 INFO L93 Difference]: Finished difference Result 519 states and 697 transitions. [2024-10-24 11:39:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:39:40,682 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 112 [2024-10-24 11:39:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:40,685 INFO L225 Difference]: With dead ends: 519 [2024-10-24 11:39:40,685 INFO L226 Difference]: Without dead ends: 260 [2024-10-24 11:39:40,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:39:40,686 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 228 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:40,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 555 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:39:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-24 11:39:40,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2024-10-24 11:39:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 212 states have (on average 1.2688679245283019) internal successors, (269), 214 states have internal predecessors, (269), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 345 transitions. [2024-10-24 11:39:40,720 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 345 transitions. Word has length 112 [2024-10-24 11:39:40,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:40,721 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 345 transitions. [2024-10-24 11:39:40,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:39:40,721 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 345 transitions. [2024-10-24 11:39:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 11:39:40,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:40,722 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:40,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:39:40,723 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:40,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:40,723 INFO L85 PathProgramCache]: Analyzing trace with hash -567829615, now seen corresponding path program 1 times [2024-10-24 11:39:40,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:40,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719088451] [2024-10-24 11:39:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:40,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:41,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:41,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719088451] [2024-10-24 11:39:41,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719088451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:41,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:41,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:39:41,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302775394] [2024-10-24 11:39:41,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:41,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:39:41,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:41,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:39:41,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:39:41,389 INFO L87 Difference]: Start difference. First operand 257 states and 345 transitions. Second operand has 10 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:39:41,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:41,776 INFO L93 Difference]: Finished difference Result 670 states and 889 transitions. [2024-10-24 11:39:41,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:39:41,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 113 [2024-10-24 11:39:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:41,780 INFO L225 Difference]: With dead ends: 670 [2024-10-24 11:39:41,781 INFO L226 Difference]: Without dead ends: 414 [2024-10-24 11:39:41,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:39:41,783 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 179 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:41,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 604 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:39:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-24 11:39:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 290. [2024-10-24 11:39:41,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 245 states have (on average 1.2448979591836735) internal successors, (305), 247 states have internal predecessors, (305), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 381 transitions. [2024-10-24 11:39:41,817 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 381 transitions. Word has length 113 [2024-10-24 11:39:41,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:41,818 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 381 transitions. [2024-10-24 11:39:41,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:39:41,818 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 381 transitions. [2024-10-24 11:39:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 11:39:41,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:41,820 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:41,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:39:41,821 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:41,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:41,821 INFO L85 PathProgramCache]: Analyzing trace with hash -600799736, now seen corresponding path program 1 times [2024-10-24 11:39:41,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:41,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046670651] [2024-10-24 11:39:41,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:41,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 11:39:43,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:43,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046670651] [2024-10-24 11:39:43,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046670651] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:39:43,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020942048] [2024-10-24 11:39:43,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:43,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:39:43,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:39:43,887 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:39:43,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:39:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-24 11:39:44,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:39:45,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-24 11:39:45,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:39:46,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 5 [2024-10-24 11:39:53,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2024-10-24 11:39:53,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2024-10-24 11:39:53,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2024-10-24 11:39:53,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-10-24 11:39:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 8 proven. 368 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-24 11:39:53,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:39:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:39:54,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020942048] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:39:54,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:39:54,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [20, 24] total 47 [2024-10-24 11:39:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54243326] [2024-10-24 11:39:54,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:54,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:39:54,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:54,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:39:54,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1960, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 11:39:54,557 INFO L87 Difference]: Start difference. First operand 290 states and 381 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:39:55,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:55,078 INFO L93 Difference]: Finished difference Result 683 states and 890 transitions. [2024-10-24 11:39:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:39:55,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 114 [2024-10-24 11:39:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:55,080 INFO L225 Difference]: With dead ends: 683 [2024-10-24 11:39:55,081 INFO L226 Difference]: Without dead ends: 394 [2024-10-24 11:39:55,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=219, Invalid=2133, Unknown=0, NotChecked=0, Total=2352 [2024-10-24 11:39:55,083 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 141 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:55,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 511 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:39:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-24 11:39:55,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 262. [2024-10-24 11:39:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 220 states have internal predecessors, (268), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:39:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 340 transitions. [2024-10-24 11:39:55,112 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 340 transitions. Word has length 114 [2024-10-24 11:39:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:55,113 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 340 transitions. [2024-10-24 11:39:55,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:39:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 340 transitions. [2024-10-24 11:39:55,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 11:39:55,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:55,114 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:39:55,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:39:55,318 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,SelfDestructingSolverStorable13 [2024-10-24 11:39:55,319 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:55,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:55,320 INFO L85 PathProgramCache]: Analyzing trace with hash -640146953, now seen corresponding path program 1 times [2024-10-24 11:39:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:55,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523738752] [2024-10-24 11:39:55,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:39:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 11:39:57,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:57,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523738752] [2024-10-24 11:39:57,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523738752] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:39:57,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763466994] [2024-10-24 11:39:57,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:57,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:39:57,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:39:57,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:39:57,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:39:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-10-24 11:39:58,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:39:58,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-24 11:39:58,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:39:58,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:39:59,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:39:59,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:00,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-24 11:40:00,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:01,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2024-10-24 11:40:01,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2024-10-24 11:40:01,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-10-24 11:40:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 8 proven. 364 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-24 11:40:01,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:40:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:40:02,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763466994] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:02,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:40:02,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [19, 25] total 47 [2024-10-24 11:40:02,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788941329] [2024-10-24 11:40:02,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:02,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:40:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:02,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:40:02,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1971, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 11:40:02,426 INFO L87 Difference]: Start difference. First operand 262 states and 340 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:40:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:02,974 INFO L93 Difference]: Finished difference Result 614 states and 795 transitions. [2024-10-24 11:40:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:40:02,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2024-10-24 11:40:02,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:02,977 INFO L225 Difference]: With dead ends: 614 [2024-10-24 11:40:02,978 INFO L226 Difference]: Without dead ends: 353 [2024-10-24 11:40:02,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=209, Invalid=2143, Unknown=0, NotChecked=0, Total=2352 [2024-10-24 11:40:02,980 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 145 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:02,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 497 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:40:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-24 11:40:03,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 262. [2024-10-24 11:40:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 220 states have internal predecessors, (267), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:40:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 339 transitions. [2024-10-24 11:40:03,011 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 339 transitions. Word has length 115 [2024-10-24 11:40:03,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:03,011 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 339 transitions. [2024-10-24 11:40:03,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:40:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 339 transitions. [2024-10-24 11:40:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 11:40:03,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:03,013 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:03,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:40:03,213 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,SelfDestructingSolverStorable14 [2024-10-24 11:40:03,214 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:03,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1845344712, now seen corresponding path program 1 times [2024-10-24 11:40:03,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:03,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842045844] [2024-10-24 11:40:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:03,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:40:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:40:03,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:03,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842045844] [2024-10-24 11:40:03,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842045844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:03,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:03,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:40:03,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865010416] [2024-10-24 11:40:03,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:03,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:40:03,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:03,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:40:03,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:40:03,820 INFO L87 Difference]: Start difference. First operand 262 states and 339 transitions. Second operand has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:40:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:04,096 INFO L93 Difference]: Finished difference Result 295 states and 377 transitions. [2024-10-24 11:40:04,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:40:04,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2024-10-24 11:40:04,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:04,098 INFO L225 Difference]: With dead ends: 295 [2024-10-24 11:40:04,098 INFO L226 Difference]: Without dead ends: 293 [2024-10-24 11:40:04,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:40:04,099 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 153 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:04,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 438 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:40:04,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-24 11:40:04,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 239. [2024-10-24 11:40:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 195 states have (on average 1.2) internal successors, (234), 196 states have internal predecessors, (234), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:40:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 306 transitions. [2024-10-24 11:40:04,137 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 306 transitions. Word has length 115 [2024-10-24 11:40:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:04,138 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 306 transitions. [2024-10-24 11:40:04,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 8 states have internal predecessors, (43), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:40:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 306 transitions. [2024-10-24 11:40:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 11:40:04,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:04,140 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:04,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:40:04,140 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:04,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:04,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1845285130, now seen corresponding path program 1 times [2024-10-24 11:40:04,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:04,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648906226] [2024-10-24 11:40:04,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:04,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:40:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:40:05,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:05,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648906226] [2024-10-24 11:40:05,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648906226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:05,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:05,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:40:05,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939348287] [2024-10-24 11:40:05,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:05,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:40:05,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:05,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:40:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:40:05,294 INFO L87 Difference]: Start difference. First operand 239 states and 306 transitions. Second operand has 12 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:40:06,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:06,022 INFO L93 Difference]: Finished difference Result 599 states and 764 transitions. [2024-10-24 11:40:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 11:40:06,023 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2024-10-24 11:40:06,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:06,025 INFO L225 Difference]: With dead ends: 599 [2024-10-24 11:40:06,025 INFO L226 Difference]: Without dead ends: 377 [2024-10-24 11:40:06,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2024-10-24 11:40:06,027 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 276 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:06,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 512 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:40:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-10-24 11:40:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 351. [2024-10-24 11:40:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 307 states have (on average 1.231270358306189) internal successors, (378), 308 states have internal predecessors, (378), 36 states have call successors, (36), 7 states have call predecessors, (36), 7 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:40:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 450 transitions. [2024-10-24 11:40:06,060 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 450 transitions. Word has length 115 [2024-10-24 11:40:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:06,060 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 450 transitions. [2024-10-24 11:40:06,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 11:40:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 450 transitions. [2024-10-24 11:40:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:40:06,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:06,062 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:06,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:40:06,063 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:06,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2059658580, now seen corresponding path program 1 times [2024-10-24 11:40:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:06,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492565956] [2024-10-24 11:40:06,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:40:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:40:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492565956] [2024-10-24 11:40:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492565956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:07,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:07,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-24 11:40:07,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9760259] [2024-10-24 11:40:07,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:07,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 11:40:07,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:07,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 11:40:07,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:40:07,880 INFO L87 Difference]: Start difference. First operand 351 states and 450 transitions. Second operand has 18 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 8 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-24 11:40:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:09,387 INFO L93 Difference]: Finished difference Result 787 states and 1001 transitions. [2024-10-24 11:40:09,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:40:09,388 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 8 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) Word has length 116 [2024-10-24 11:40:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:09,391 INFO L225 Difference]: With dead ends: 787 [2024-10-24 11:40:09,391 INFO L226 Difference]: Without dead ends: 453 [2024-10-24 11:40:09,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2024-10-24 11:40:09,392 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 231 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:09,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 734 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:40:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-10-24 11:40:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 426. [2024-10-24 11:40:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 376 states have (on average 1.226063829787234) internal successors, (461), 378 states have internal predecessors, (461), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:40:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 541 transitions. [2024-10-24 11:40:09,463 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 541 transitions. Word has length 116 [2024-10-24 11:40:09,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:09,463 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 541 transitions. [2024-10-24 11:40:09,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 3.142857142857143) internal successors, (44), 15 states have internal predecessors, (44), 8 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-24 11:40:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 541 transitions. [2024-10-24 11:40:09,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:40:09,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:09,466 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:09,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:40:09,467 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:09,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:09,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1636942188, now seen corresponding path program 1 times [2024-10-24 11:40:09,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:09,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798584112] [2024-10-24 11:40:09,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:09,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:40:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 11:40:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798584112] [2024-10-24 11:40:11,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798584112] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:11,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344659631] [2024-10-24 11:40:11,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:11,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:40:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:40:11,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:40:11,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 11:40:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:11,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-10-24 11:40:11,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:12,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-24 11:40:12,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-24 11:40:13,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-24 11:40:14,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 5 [2024-10-24 11:40:15,591 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-10-24 11:40:15,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-10-24 11:40:17,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2024-10-24 11:40:17,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2024-10-24 11:40:17,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2024-10-24 11:40:17,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-10-24 11:40:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 7 proven. 373 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-24 11:40:17,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:40:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:40:18,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344659631] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:18,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:40:18,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [19, 32] total 54 [2024-10-24 11:40:18,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299178430] [2024-10-24 11:40:18,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:18,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:40:18,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:18,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:40:18,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2608, Unknown=0, NotChecked=0, Total=2862 [2024-10-24 11:40:18,407 INFO L87 Difference]: Start difference. First operand 426 states and 541 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:40:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:18,834 INFO L93 Difference]: Finished difference Result 929 states and 1177 transitions. [2024-10-24 11:40:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:40:18,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-10-24 11:40:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:18,838 INFO L225 Difference]: With dead ends: 929 [2024-10-24 11:40:18,838 INFO L226 Difference]: Without dead ends: 520 [2024-10-24 11:40:18,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=272, Invalid=2808, Unknown=0, NotChecked=0, Total=3080 [2024-10-24 11:40:18,840 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 85 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:18,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 456 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:40:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-24 11:40:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 426. [2024-10-24 11:40:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 376 states have (on average 1.2207446808510638) internal successors, (459), 378 states have internal predecessors, (459), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:40:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 539 transitions. [2024-10-24 11:40:18,885 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 539 transitions. Word has length 116 [2024-10-24 11:40:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:18,885 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 539 transitions. [2024-10-24 11:40:18,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:40:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 539 transitions. [2024-10-24 11:40:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 11:40:18,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:18,886 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:18,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:40:19,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:40:19,090 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:19,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1244881833, now seen corresponding path program 1 times [2024-10-24 11:40:19,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:19,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273824950] [2024-10-24 11:40:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:40:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:40:19,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:19,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273824950] [2024-10-24 11:40:19,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273824950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:19,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:19,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:40:19,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609835379] [2024-10-24 11:40:19,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:19,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:40:19,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:19,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:40:19,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:40:19,425 INFO L87 Difference]: Start difference. First operand 426 states and 539 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:40:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:19,690 INFO L93 Difference]: Finished difference Result 861 states and 1081 transitions. [2024-10-24 11:40:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:40:19,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 116 [2024-10-24 11:40:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:19,693 INFO L225 Difference]: With dead ends: 861 [2024-10-24 11:40:19,694 INFO L226 Difference]: Without dead ends: 452 [2024-10-24 11:40:19,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:40:19,699 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 209 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:19,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 521 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:40:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-24 11:40:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 417. [2024-10-24 11:40:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 367 states have (on average 1.2098092643051772) internal successors, (444), 369 states have internal predecessors, (444), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:40:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 524 transitions. [2024-10-24 11:40:19,745 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 524 transitions. Word has length 116 [2024-10-24 11:40:19,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:19,746 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 524 transitions. [2024-10-24 11:40:19,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 11:40:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 524 transitions. [2024-10-24 11:40:19,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:40:19,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:19,747 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:19,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:40:19,748 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:19,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:19,748 INFO L85 PathProgramCache]: Analyzing trace with hash -767574167, now seen corresponding path program 1 times [2024-10-24 11:40:19,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:19,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094051704] [2024-10-24 11:40:19,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:19,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:40:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 45 proven. 33 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-10-24 11:40:21,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:21,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094051704] [2024-10-24 11:40:21,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094051704] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:21,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097788985] [2024-10-24 11:40:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:21,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:40:21,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:40:21,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:40:21,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 11:40:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-10-24 11:40:24,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:24,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:24,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-24 11:40:25,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:25,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:26,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:27,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 54 [2024-10-24 11:40:27,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2024-10-24 11:40:27,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-10-24 11:40:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 343 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-24 11:40:27,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:40:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:40:27,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097788985] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:27,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:40:27,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [23, 28] total 55 [2024-10-24 11:40:27,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981538460] [2024-10-24 11:40:27,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:27,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:40:27,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:27,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:40:27,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2791, Unknown=0, NotChecked=0, Total=2970 [2024-10-24 11:40:27,986 INFO L87 Difference]: Start difference. First operand 417 states and 524 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:40:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:28,422 INFO L93 Difference]: Finished difference Result 883 states and 1108 transitions. [2024-10-24 11:40:28,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:40:28,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-24 11:40:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:28,426 INFO L225 Difference]: With dead ends: 883 [2024-10-24 11:40:28,426 INFO L226 Difference]: Without dead ends: 483 [2024-10-24 11:40:28,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=193, Invalid=2999, Unknown=0, NotChecked=0, Total=3192 [2024-10-24 11:40:28,428 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 126 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:28,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 338 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:40:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-24 11:40:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 421. [2024-10-24 11:40:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 371 states have (on average 1.2129380053908356) internal successors, (450), 373 states have internal predecessors, (450), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:40:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 530 transitions. [2024-10-24 11:40:28,475 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 530 transitions. Word has length 117 [2024-10-24 11:40:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:28,475 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 530 transitions. [2024-10-24 11:40:28,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:40:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 530 transitions. [2024-10-24 11:40:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:40:28,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:28,477 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:28,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 11:40:28,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:40:28,678 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:28,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:28,679 INFO L85 PathProgramCache]: Analyzing trace with hash -66509589, now seen corresponding path program 1 times [2024-10-24 11:40:28,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:28,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512381387] [2024-10-24 11:40:28,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:28,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:40:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 11:40:30,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:30,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512381387] [2024-10-24 11:40:30,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512381387] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830080241] [2024-10-24 11:40:30,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:30,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:40:30,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:40:30,752 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:40:30,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 11:40:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:32,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-24 11:40:32,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:33,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-24 11:40:33,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:33,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:33,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2024-10-24 11:40:34,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2024-10-24 11:40:34,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-10-24 11:40:34,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-10-24 11:40:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 4 proven. 324 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-24 11:40:34,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:40:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 11:40:34,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830080241] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:34,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:40:34,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [22, 14] total 36 [2024-10-24 11:40:34,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369416444] [2024-10-24 11:40:34,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:34,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:40:34,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:34,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:40:34,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1127, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 11:40:34,511 INFO L87 Difference]: Start difference. First operand 421 states and 530 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:40:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:34,955 INFO L93 Difference]: Finished difference Result 872 states and 1089 transitions. [2024-10-24 11:40:34,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:40:34,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-24 11:40:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:34,961 INFO L225 Difference]: With dead ends: 872 [2024-10-24 11:40:34,961 INFO L226 Difference]: Without dead ends: 468 [2024-10-24 11:40:34,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=153, Invalid=1253, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 11:40:34,965 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 96 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:34,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 401 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:40:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-10-24 11:40:35,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 417. [2024-10-24 11:40:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 367 states have (on average 1.2043596730245232) internal successors, (442), 369 states have internal predecessors, (442), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:40:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 522 transitions. [2024-10-24 11:40:35,019 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 522 transitions. Word has length 117 [2024-10-24 11:40:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:35,019 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 522 transitions. [2024-10-24 11:40:35,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 11:40:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 522 transitions. [2024-10-24 11:40:35,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 11:40:35,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:35,020 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:40:35,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 11:40:35,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-24 11:40:35,227 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:35,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:35,227 INFO L85 PathProgramCache]: Analyzing trace with hash -725022507, now seen corresponding path program 1 times [2024-10-24 11:40:35,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:35,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447377045] [2024-10-24 11:40:35,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:35,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat