./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX --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 cc7a9a2f6e7b1ee77bf3f8df4593a14d130ce94528ae7e9cb4543cec3e179328 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:25:44,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:25:44,177 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:25:44,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:25:44,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:25:44,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:25:44,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:25:44,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:25:44,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:25:44,215 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:25:44,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:25:44,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:25:44,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:25:44,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:25:44,219 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:25:44,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:25:44,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:25:44,220 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:25:44,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:25:44,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:25:44,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:25:44,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:25:44,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:25:44,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:25:44,227 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:25:44,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:25:44,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:25:44,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:25:44,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:25:44,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:25:44,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:25:44,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:25:44,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:25:44,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:25:44,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:25:44,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:25:44,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:25:44,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:25:44,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:25:44,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:25:44,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:25:44,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:25:44,240 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX 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 -> cc7a9a2f6e7b1ee77bf3f8df4593a14d130ce94528ae7e9cb4543cec3e179328 [2024-11-08 16:25:44,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:25:44,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:25:44,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:25:44,616 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:25:44,617 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:25:44,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i Unable to find full path for "g++" [2024-11-08 16:25:46,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:25:47,092 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:25:47,093 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i [2024-11-08 16:25:47,103 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/data/7bb134211/84964294671a439fa16d57d3cef088d7/FLAG243aa10a3 [2024-11-08 16:25:47,464 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/data/7bb134211/84964294671a439fa16d57d3cef088d7 [2024-11-08 16:25:47,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:25:47,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:25:47,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:25:47,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:25:47,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:25:47,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:47,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e558d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47, skipping insertion in model container [2024-11-08 16:25:47,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:47,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:25:47,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i[917,930] [2024-11-08 16:25:47,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:25:47,794 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:25:47,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-89.i[917,930] [2024-11-08 16:25:47,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:25:47,870 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:25:47,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47 WrapperNode [2024-11-08 16:25:47,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:25:47,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:25:47,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:25:47,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:25:47,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:47,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:47,946 INFO L138 Inliner]: procedures = 27, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2024-11-08 16:25:47,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:25:47,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:25:47,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:25:47,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:25:47,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:47,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:47,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:47,995 INFO L175 MemorySlicer]: Split 108 memory accesses to 2 slices as follows [2, 106]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2024-11-08 16:25:47,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:47,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:48,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:48,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:48,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:48,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:48,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:25:48,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:25:48,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:25:48,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:25:48,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47" (1/1) ... [2024-11-08 16:25:48,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:25:48,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:25:48,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:25:48,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:25:48,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:25:48,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-08 16:25:48,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-08 16:25:48,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 16:25:48,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 16:25:48,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 16:25:48,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 16:25:48,129 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:25:48,129 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:25:48,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:25:48,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 16:25:48,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:25:48,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:25:48,319 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:25:48,321 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:25:49,031 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-08 16:25:49,031 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:25:49,047 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:25:49,048 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:25:49,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:25:49 BoogieIcfgContainer [2024-11-08 16:25:49,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:25:49,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:25:49,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:25:49,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:25:49,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:25:47" (1/3) ... [2024-11-08 16:25:49,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a31e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:25:49, skipping insertion in model container [2024-11-08 16:25:49,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:25:47" (2/3) ... [2024-11-08 16:25:49,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a31e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:25:49, skipping insertion in model container [2024-11-08 16:25:49,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:25:49" (3/3) ... [2024-11-08 16:25:49,063 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-89.i [2024-11-08 16:25:49,085 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:25:49,085 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:25:49,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:25:49,195 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;@38e28781, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:25:49,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:25:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 16:25:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:25:49,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:49,220 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:49,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:49,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1560830057, now seen corresponding path program 1 times [2024-11-08 16:25:49,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:49,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266756845] [2024-11-08 16:25:49,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:25:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:25:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:25:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:25:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:25:49,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:49,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266756845] [2024-11-08 16:25:49,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266756845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:49,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:49,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:25:49,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686460463] [2024-11-08 16:25:49,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:49,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:25:49,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:49,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:25:49,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:25:49,840 INFO L87 Difference]: Start difference. First operand has 102 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 16:25:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:49,919 INFO L93 Difference]: Finished difference Result 197 states and 307 transitions. [2024-11-08 16:25:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:25:49,921 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2024-11-08 16:25:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:49,934 INFO L225 Difference]: With dead ends: 197 [2024-11-08 16:25:49,934 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 16:25:49,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-11-08 16:25:49,945 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:49,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:25:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 16:25:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-08 16:25:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 16:25:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2024-11-08 16:25:50,008 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 109 [2024-11-08 16:25:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:50,009 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2024-11-08 16:25:50,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 16:25:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2024-11-08 16:25:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:25:50,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:50,018 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:50,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:25:50,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:50,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:50,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1712706447, now seen corresponding path program 1 times [2024-11-08 16:25:50,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:50,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938064151] [2024-11-08 16:25:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:50,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:25:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:25:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:25:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:25:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:25:50,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:50,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938064151] [2024-11-08 16:25:50,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938064151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:50,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:50,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:25:50,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631652241] [2024-11-08 16:25:50,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:50,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:25:50,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:50,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:25:50,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:25:50,475 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:25:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:50,549 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2024-11-08 16:25:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:25:50,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-08 16:25:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:50,553 INFO L225 Difference]: With dead ends: 196 [2024-11-08 16:25:50,556 INFO L226 Difference]: Without dead ends: 101 [2024-11-08 16:25:50,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 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-11-08 16:25:50,558 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:50,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:25:50,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-08 16:25:50,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-08 16:25:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 85 states have internal predecessors, (117), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 16:25:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2024-11-08 16:25:50,584 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 109 [2024-11-08 16:25:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:50,586 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2024-11-08 16:25:50,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:25:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2024-11-08 16:25:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:25:50,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:50,596 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:50,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:25:50,596 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:50,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:50,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1902202479, now seen corresponding path program 1 times [2024-11-08 16:25:50,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:50,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311333059] [2024-11-08 16:25:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:50,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:50,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:25:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:25:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:25:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:25:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:25:51,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:51,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311333059] [2024-11-08 16:25:51,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311333059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:51,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:51,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:25:51,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597935234] [2024-11-08 16:25:51,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:51,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:25:51,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:51,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:25:51,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:25:51,038 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:25:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:51,095 INFO L93 Difference]: Finished difference Result 200 states and 287 transitions. [2024-11-08 16:25:51,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:25:51,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-08 16:25:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:51,101 INFO L225 Difference]: With dead ends: 200 [2024-11-08 16:25:51,102 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 16:25:51,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 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-11-08 16:25:51,104 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:51,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 404 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:25:51,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 16:25:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-08 16:25:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 16:25:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2024-11-08 16:25:51,115 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 109 [2024-11-08 16:25:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:51,115 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2024-11-08 16:25:51,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:25:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2024-11-08 16:25:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:25:51,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:51,119 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:51,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:25:51,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:51,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:51,120 INFO L85 PathProgramCache]: Analyzing trace with hash -127195117, now seen corresponding path program 1 times [2024-11-08 16:25:51,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:51,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480795602] [2024-11-08 16:25:51,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:51,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:25:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:25:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:25:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:25:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:25:51,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:51,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480795602] [2024-11-08 16:25:51,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480795602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:51,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:51,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:25:51,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732858663] [2024-11-08 16:25:51,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:51,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:25:51,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:51,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:25:51,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:25:51,453 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:25:51,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:51,497 INFO L93 Difference]: Finished difference Result 204 states and 291 transitions. [2024-11-08 16:25:51,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:25:51,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-08 16:25:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:51,501 INFO L225 Difference]: With dead ends: 204 [2024-11-08 16:25:51,501 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 16:25:51,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 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-11-08 16:25:51,507 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:51,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:25:51,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 16:25:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-08 16:25:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 16:25:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2024-11-08 16:25:51,524 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 109 [2024-11-08 16:25:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:51,524 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2024-11-08 16:25:51,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:25:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2024-11-08 16:25:51,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:25:51,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:51,531 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:51,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:25:51,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:51,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash -125348075, now seen corresponding path program 1 times [2024-11-08 16:25:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:51,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994817452] [2024-11-08 16:25:51,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:51,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:25:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:25:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:25:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:25:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:25:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:25:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:25:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:25:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:25:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:25:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:25:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:25:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:25:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:25:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:25:56,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:25:56,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994817452] [2024-11-08 16:25:56,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994817452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:25:56,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:25:56,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 16:25:56,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368822191] [2024-11-08 16:25:56,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:25:56,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:25:56,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:25:56,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:25:56,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:25:56,304 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 16:25:57,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:25:57,958 INFO L93 Difference]: Finished difference Result 270 states and 383 transitions. [2024-11-08 16:25:57,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:25:57,959 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 109 [2024-11-08 16:25:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:25:57,961 INFO L225 Difference]: With dead ends: 270 [2024-11-08 16:25:57,961 INFO L226 Difference]: Without dead ends: 169 [2024-11-08 16:25:57,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:25:57,963 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 359 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:25:57,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 565 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 16:25:57,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-08 16:25:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 115. [2024-11-08 16:25:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 100 states have (on average 1.37) internal successors, (137), 100 states have internal predecessors, (137), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 16:25:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-08 16:25:57,984 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 109 [2024-11-08 16:25:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:25:57,984 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-08 16:25:57,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 14 states have internal predecessors, (47), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 16:25:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-08 16:25:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:25:57,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:25:57,987 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:25:57,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:25:57,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:25:57,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:25:57,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1146416429, now seen corresponding path program 1 times [2024-11-08 16:25:57,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:25:57,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190053212] [2024-11-08 16:25:57,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:25:57,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:25:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:01,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:01,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190053212] [2024-11-08 16:26:01,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190053212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:01,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:01,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:26:01,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88661821] [2024-11-08 16:26:01,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:01,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:26:01,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:01,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:26:01,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:26:01,388 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-08 16:26:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:02,696 INFO L93 Difference]: Finished difference Result 296 states and 417 transitions. [2024-11-08 16:26:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:26:02,697 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 109 [2024-11-08 16:26:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:02,698 INFO L225 Difference]: With dead ends: 296 [2024-11-08 16:26:02,699 INFO L226 Difference]: Without dead ends: 184 [2024-11-08 16:26:02,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:26:02,703 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 637 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:02,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 481 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 16:26:02,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-08 16:26:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 177. [2024-11-08 16:26:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.3670886075949367) internal successors, (216), 159 states have internal predecessors, (216), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:26:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 248 transitions. [2024-11-08 16:26:02,744 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 248 transitions. Word has length 109 [2024-11-08 16:26:02,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:02,745 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 248 transitions. [2024-11-08 16:26:02,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-08 16:26:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 248 transitions. [2024-11-08 16:26:02,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:26:02,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:02,749 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:02,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:26:02,750 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:02,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:02,751 INFO L85 PathProgramCache]: Analyzing trace with hash 196542444, now seen corresponding path program 1 times [2024-11-08 16:26:02,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:02,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998056149] [2024-11-08 16:26:02,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:02,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:07,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:07,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:07,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:07,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:07,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:07,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:08,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:08,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:08,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:08,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:08,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:08,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998056149] [2024-11-08 16:26:08,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998056149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:08,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:08,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:26:08,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161547696] [2024-11-08 16:26:08,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:08,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:26:08,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:08,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:26:08,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:26:08,120 INFO L87 Difference]: Start difference. First operand 177 states and 248 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 16:26:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:10,868 INFO L93 Difference]: Finished difference Result 508 states and 715 transitions. [2024-11-08 16:26:10,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:26:10,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 109 [2024-11-08 16:26:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:10,875 INFO L225 Difference]: With dead ends: 508 [2024-11-08 16:26:10,875 INFO L226 Difference]: Without dead ends: 334 [2024-11-08 16:26:10,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:26:10,879 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 119 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:10,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 633 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 16:26:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-08 16:26:10,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 228. [2024-11-08 16:26:10,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 195 states have (on average 1.3435897435897435) internal successors, (262), 196 states have internal predecessors, (262), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 16:26:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 320 transitions. [2024-11-08 16:26:10,938 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 320 transitions. Word has length 109 [2024-11-08 16:26:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:10,939 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 320 transitions. [2024-11-08 16:26:10,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 16:26:10,939 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 320 transitions. [2024-11-08 16:26:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:26:10,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:10,941 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:10,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:26:10,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:10,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:10,943 INFO L85 PathProgramCache]: Analyzing trace with hash 93506643, now seen corresponding path program 1 times [2024-11-08 16:26:10,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:10,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673554323] [2024-11-08 16:26:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:10,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:13,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:13,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673554323] [2024-11-08 16:26:13,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673554323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:13,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:13,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:26:13,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196762585] [2024-11-08 16:26:13,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:13,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:26:13,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:13,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:26:13,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:26:13,712 INFO L87 Difference]: Start difference. First operand 228 states and 320 transitions. Second operand has 12 states, 10 states have (on average 4.7) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-08 16:26:14,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:14,796 INFO L93 Difference]: Finished difference Result 478 states and 668 transitions. [2024-11-08 16:26:14,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:26:14,797 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.7) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 5 states have call successors, (13) Word has length 109 [2024-11-08 16:26:14,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:14,799 INFO L225 Difference]: With dead ends: 478 [2024-11-08 16:26:14,799 INFO L226 Difference]: Without dead ends: 304 [2024-11-08 16:26:14,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:26:14,801 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 406 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:14,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 463 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:26:14,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-08 16:26:14,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 245. [2024-11-08 16:26:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 212 states have internal predecessors, (286), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 16:26:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 344 transitions. [2024-11-08 16:26:14,856 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 344 transitions. Word has length 109 [2024-11-08 16:26:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:14,857 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 344 transitions. [2024-11-08 16:26:14,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.7) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-08 16:26:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 344 transitions. [2024-11-08 16:26:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:26:14,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:14,859 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:14,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:26:14,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:14,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash -927561711, now seen corresponding path program 1 times [2024-11-08 16:26:14,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:14,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659576065] [2024-11-08 16:26:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:14,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:15,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:15,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659576065] [2024-11-08 16:26:15,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659576065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:15,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:15,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:26:15,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112161537] [2024-11-08 16:26:15,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:15,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:26:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:15,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:26:15,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:26:15,790 INFO L87 Difference]: Start difference. First operand 245 states and 344 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:16,504 INFO L93 Difference]: Finished difference Result 485 states and 682 transitions. [2024-11-08 16:26:16,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:26:16,504 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-08 16:26:16,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:16,507 INFO L225 Difference]: With dead ends: 485 [2024-11-08 16:26:16,507 INFO L226 Difference]: Without dead ends: 298 [2024-11-08 16:26:16,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:26:16,509 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 185 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:16,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 918 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:26:16,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-08 16:26:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 248. [2024-11-08 16:26:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 214 states have (on average 1.355140186915888) internal successors, (290), 215 states have internal predecessors, (290), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 16:26:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 348 transitions. [2024-11-08 16:26:16,605 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 348 transitions. Word has length 109 [2024-11-08 16:26:16,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:16,606 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 348 transitions. [2024-11-08 16:26:16,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 348 transitions. [2024-11-08 16:26:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:26:16,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:16,611 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:16,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:26:16,611 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:16,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:16,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1036007402, now seen corresponding path program 1 times [2024-11-08 16:26:16,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:16,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485933555] [2024-11-08 16:26:16,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:16,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:18,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:18,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485933555] [2024-11-08 16:26:18,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485933555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:18,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:18,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:26:18,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816388503] [2024-11-08 16:26:18,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:18,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:26:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:18,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:26:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:26:18,830 INFO L87 Difference]: Start difference. First operand 248 states and 348 transitions. Second operand has 12 states, 10 states have (on average 4.7) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-08 16:26:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:19,927 INFO L93 Difference]: Finished difference Result 513 states and 721 transitions. [2024-11-08 16:26:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:26:19,929 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.7) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 5 states have call successors, (13) Word has length 109 [2024-11-08 16:26:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:19,931 INFO L225 Difference]: With dead ends: 513 [2024-11-08 16:26:19,931 INFO L226 Difference]: Without dead ends: 323 [2024-11-08 16:26:19,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:26:19,933 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 638 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:19,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 457 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:26:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-08 16:26:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 253. [2024-11-08 16:26:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 219 states have (on average 1.360730593607306) internal successors, (298), 220 states have internal predecessors, (298), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 16:26:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 356 transitions. [2024-11-08 16:26:19,982 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 356 transitions. Word has length 109 [2024-11-08 16:26:19,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:19,983 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 356 transitions. [2024-11-08 16:26:19,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.7) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-08 16:26:19,983 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 356 transitions. [2024-11-08 16:26:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:26:19,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:19,985 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:19,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:26:19,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:19,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:19,987 INFO L85 PathProgramCache]: Analyzing trace with hash 14939048, now seen corresponding path program 1 times [2024-11-08 16:26:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:19,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657817159] [2024-11-08 16:26:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:20,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:20,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657817159] [2024-11-08 16:26:20,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657817159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:20,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:20,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:26:20,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243742183] [2024-11-08 16:26:20,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:20,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:26:20,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:20,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:26:20,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:26:21,000 INFO L87 Difference]: Start difference. First operand 253 states and 356 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:21,705 INFO L93 Difference]: Finished difference Result 507 states and 716 transitions. [2024-11-08 16:26:21,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:26:21,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-08 16:26:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:21,709 INFO L225 Difference]: With dead ends: 507 [2024-11-08 16:26:21,709 INFO L226 Difference]: Without dead ends: 312 [2024-11-08 16:26:21,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:26:21,710 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 184 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:21,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 726 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:26:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-08 16:26:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 249. [2024-11-08 16:26:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 215 states have (on average 1.3534883720930233) internal successors, (291), 216 states have internal predecessors, (291), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 16:26:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 349 transitions. [2024-11-08 16:26:21,754 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 349 transitions. Word has length 109 [2024-11-08 16:26:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:21,755 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 349 transitions. [2024-11-08 16:26:21,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 349 transitions. [2024-11-08 16:26:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:26:21,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:21,761 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:21,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:26:21,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:21,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:21,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1357897921, now seen corresponding path program 1 times [2024-11-08 16:26:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:21,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562546388] [2024-11-08 16:26:21,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:21,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:23,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:23,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:23,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:23,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:23,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:23,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:23,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:23,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:23,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:23,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:23,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:23,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:24,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:24,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:24,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562546388] [2024-11-08 16:26:24,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562546388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:24,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:24,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 16:26:24,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964901164] [2024-11-08 16:26:24,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:24,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:26:24,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:24,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:26:24,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:26:24,022 INFO L87 Difference]: Start difference. First operand 249 states and 349 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-08 16:26:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:25,014 INFO L93 Difference]: Finished difference Result 519 states and 727 transitions. [2024-11-08 16:26:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:26:25,015 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 109 [2024-11-08 16:26:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:25,018 INFO L225 Difference]: With dead ends: 519 [2024-11-08 16:26:25,018 INFO L226 Difference]: Without dead ends: 328 [2024-11-08 16:26:25,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2024-11-08 16:26:25,020 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 422 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:25,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 408 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:26:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-08 16:26:25,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 264. [2024-11-08 16:26:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 230 states have (on average 1.3695652173913044) internal successors, (315), 231 states have internal predecessors, (315), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 16:26:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 373 transitions. [2024-11-08 16:26:25,066 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 373 transitions. Word has length 109 [2024-11-08 16:26:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:25,066 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 373 transitions. [2024-11-08 16:26:25,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-08 16:26:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 373 transitions. [2024-11-08 16:26:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:26:25,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:25,069 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:25,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:26:25,069 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:25,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:25,070 INFO L85 PathProgramCache]: Analyzing trace with hash 336829567, now seen corresponding path program 1 times [2024-11-08 16:26:25,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:25,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119807156] [2024-11-08 16:26:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:25,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119807156] [2024-11-08 16:26:25,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119807156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:25,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:25,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:26:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032940502] [2024-11-08 16:26:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:25,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:26:25,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:26:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:26:25,944 INFO L87 Difference]: Start difference. First operand 264 states and 373 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:26,586 INFO L93 Difference]: Finished difference Result 521 states and 735 transitions. [2024-11-08 16:26:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:26:26,587 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-08 16:26:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:26,589 INFO L225 Difference]: With dead ends: 521 [2024-11-08 16:26:26,589 INFO L226 Difference]: Without dead ends: 315 [2024-11-08 16:26:26,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:26:26,590 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 256 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:26,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 861 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:26:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-08 16:26:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 266. [2024-11-08 16:26:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 232 states have (on average 1.3663793103448276) internal successors, (317), 233 states have internal predecessors, (317), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 16:26:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 375 transitions. [2024-11-08 16:26:26,638 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 375 transitions. Word has length 109 [2024-11-08 16:26:26,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:26,639 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 375 transitions. [2024-11-08 16:26:26,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 375 transitions. [2024-11-08 16:26:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:26:26,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:26,641 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:26,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:26:26,641 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:26,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash 817152684, now seen corresponding path program 1 times [2024-11-08 16:26:26,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:26,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655611142] [2024-11-08 16:26:26,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:29,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:29,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:29,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:29,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:29,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:29,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:29,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:30,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:30,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:30,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:30,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:30,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:30,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:30,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:30,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655611142] [2024-11-08 16:26:30,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655611142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:30,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:30,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:26:30,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563034276] [2024-11-08 16:26:30,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:30,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:26:30,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:30,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:26:30,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:26:30,107 INFO L87 Difference]: Start difference. First operand 266 states and 375 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 16:26:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:31,585 INFO L93 Difference]: Finished difference Result 593 states and 841 transitions. [2024-11-08 16:26:31,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:26:31,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2024-11-08 16:26:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:31,589 INFO L225 Difference]: With dead ends: 593 [2024-11-08 16:26:31,590 INFO L226 Difference]: Without dead ends: 385 [2024-11-08 16:26:31,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:26:31,592 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 204 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:31,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 562 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 16:26:31,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-08 16:26:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 281. [2024-11-08 16:26:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 247 states have (on average 1.3724696356275303) internal successors, (339), 248 states have internal predecessors, (339), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 16:26:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 397 transitions. [2024-11-08 16:26:31,647 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 397 transitions. Word has length 109 [2024-11-08 16:26:31,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:31,648 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 397 transitions. [2024-11-08 16:26:31,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 16:26:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 397 transitions. [2024-11-08 16:26:31,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:26:31,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:31,650 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:31,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:26:31,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:31,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:31,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1139043203, now seen corresponding path program 1 times [2024-11-08 16:26:31,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:31,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870671124] [2024-11-08 16:26:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:31,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:33,464 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:33,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:33,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870671124] [2024-11-08 16:26:33,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870671124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:33,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:26:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844220111] [2024-11-08 16:26:33,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:33,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:26:33,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:33,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:26:33,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:26:33,468 INFO L87 Difference]: Start difference. First operand 281 states and 397 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:34,733 INFO L93 Difference]: Finished difference Result 543 states and 768 transitions. [2024-11-08 16:26:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:26:34,734 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 109 [2024-11-08 16:26:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:34,737 INFO L225 Difference]: With dead ends: 543 [2024-11-08 16:26:34,737 INFO L226 Difference]: Without dead ends: 335 [2024-11-08 16:26:34,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:26:34,739 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 306 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:34,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 729 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:26:34,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-08 16:26:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 287. [2024-11-08 16:26:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 253 states have (on average 1.3715415019762847) internal successors, (347), 254 states have internal predecessors, (347), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 16:26:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 405 transitions. [2024-11-08 16:26:34,820 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 405 transitions. Word has length 109 [2024-11-08 16:26:34,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:34,820 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 405 transitions. [2024-11-08 16:26:34,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 405 transitions. [2024-11-08 16:26:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 16:26:34,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:34,823 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:34,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 16:26:34,823 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:34,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash 117974849, now seen corresponding path program 1 times [2024-11-08 16:26:34,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:34,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274969113] [2024-11-08 16:26:34,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:34,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:36,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:36,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274969113] [2024-11-08 16:26:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274969113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:36,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:36,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:26:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771137373] [2024-11-08 16:26:36,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:36,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:26:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:36,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:26:36,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:26:36,522 INFO L87 Difference]: Start difference. First operand 287 states and 405 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 16:26:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:37,304 INFO L93 Difference]: Finished difference Result 562 states and 792 transitions. [2024-11-08 16:26:37,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:26:37,305 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 109 [2024-11-08 16:26:37,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:37,307 INFO L225 Difference]: With dead ends: 562 [2024-11-08 16:26:37,307 INFO L226 Difference]: Without dead ends: 348 [2024-11-08 16:26:37,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:26:37,311 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 550 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:37,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 534 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:26:37,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-08 16:26:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 288. [2024-11-08 16:26:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 254 states have (on average 1.374015748031496) internal successors, (349), 255 states have internal predecessors, (349), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 16:26:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 407 transitions. [2024-11-08 16:26:37,366 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 407 transitions. Word has length 109 [2024-11-08 16:26:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:37,366 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 407 transitions. [2024-11-08 16:26:37,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 16:26:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 407 transitions. [2024-11-08 16:26:37,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 16:26:37,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:37,368 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:37,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:26:37,368 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:37,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:37,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2030274489, now seen corresponding path program 1 times [2024-11-08 16:26:37,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:37,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350730959] [2024-11-08 16:26:37,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:37,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:37,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:37,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350730959] [2024-11-08 16:26:37,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350730959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:37,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:37,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:26:37,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875015429] [2024-11-08 16:26:37,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:37,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:26:37,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:37,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:26:37,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:26:37,520 INFO L87 Difference]: Start difference. First operand 288 states and 407 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:37,585 INFO L93 Difference]: Finished difference Result 509 states and 722 transitions. [2024-11-08 16:26:37,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:26:37,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2024-11-08 16:26:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:37,588 INFO L225 Difference]: With dead ends: 509 [2024-11-08 16:26:37,588 INFO L226 Difference]: Without dead ends: 294 [2024-11-08 16:26:37,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:26:37,589 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:37,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:26:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-08 16:26:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-08 16:26:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 260 states have (on average 1.3653846153846154) internal successors, (355), 261 states have internal predecessors, (355), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 16:26:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 413 transitions. [2024-11-08 16:26:37,632 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 413 transitions. Word has length 111 [2024-11-08 16:26:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:37,632 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 413 transitions. [2024-11-08 16:26:37,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 413 transitions. [2024-11-08 16:26:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 16:26:37,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:37,634 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:37,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 16:26:37,634 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:37,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:37,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1998368871, now seen corresponding path program 1 times [2024-11-08 16:26:37,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:37,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919138010] [2024-11-08 16:26:37,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:37,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:38,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:38,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919138010] [2024-11-08 16:26:38,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919138010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:38,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:38,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:26:38,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062960876] [2024-11-08 16:26:38,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:38,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:26:38,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:38,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:26:38,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:26:38,163 INFO L87 Difference]: Start difference. First operand 294 states and 413 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:39,719 INFO L93 Difference]: Finished difference Result 653 states and 919 transitions. [2024-11-08 16:26:39,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:26:39,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 111 [2024-11-08 16:26:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:39,722 INFO L225 Difference]: With dead ends: 653 [2024-11-08 16:26:39,722 INFO L226 Difference]: Without dead ends: 432 [2024-11-08 16:26:39,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:26:39,724 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 105 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:39,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 454 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 16:26:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-08 16:26:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 356. [2024-11-08 16:26:39,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 322 states have (on average 1.3788819875776397) internal successors, (444), 323 states have internal predecessors, (444), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 16:26:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 502 transitions. [2024-11-08 16:26:39,774 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 502 transitions. Word has length 111 [2024-11-08 16:26:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:39,775 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 502 transitions. [2024-11-08 16:26:39,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 502 transitions. [2024-11-08 16:26:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 16:26:39,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:39,776 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:39,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 16:26:39,777 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:39,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:39,777 INFO L85 PathProgramCache]: Analyzing trace with hash -980908195, now seen corresponding path program 1 times [2024-11-08 16:26:39,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:39,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127078007] [2024-11-08 16:26:39,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:39,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:41,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:41,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127078007] [2024-11-08 16:26:41,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127078007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:41,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:41,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:26:41,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459947939] [2024-11-08 16:26:41,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:41,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:26:41,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:41,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:26:41,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:26:41,407 INFO L87 Difference]: Start difference. First operand 356 states and 502 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 16:26:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:41,983 INFO L93 Difference]: Finished difference Result 741 states and 1049 transitions. [2024-11-08 16:26:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:26:41,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2024-11-08 16:26:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:41,986 INFO L225 Difference]: With dead ends: 741 [2024-11-08 16:26:41,986 INFO L226 Difference]: Without dead ends: 511 [2024-11-08 16:26:41,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:26:41,988 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 193 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:41,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 400 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:26:41,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-08 16:26:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 485. [2024-11-08 16:26:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 436 states have (on average 1.3577981651376148) internal successors, (592), 437 states have internal predecessors, (592), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:26:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 676 transitions. [2024-11-08 16:26:42,057 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 676 transitions. Word has length 112 [2024-11-08 16:26:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:42,058 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 676 transitions. [2024-11-08 16:26:42,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 16:26:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 676 transitions. [2024-11-08 16:26:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 16:26:42,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:42,059 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:42,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 16:26:42,060 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:42,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash -991767513, now seen corresponding path program 1 times [2024-11-08 16:26:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121166440] [2024-11-08 16:26:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:42,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:42,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:42,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121166440] [2024-11-08 16:26:42,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121166440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:42,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:42,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:26:42,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938230618] [2024-11-08 16:26:42,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:42,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:26:42,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:26:42,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:26:42,952 INFO L87 Difference]: Start difference. First operand 485 states and 676 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:43,433 INFO L93 Difference]: Finished difference Result 543 states and 752 transitions. [2024-11-08 16:26:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:26:43,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2024-11-08 16:26:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:43,436 INFO L225 Difference]: With dead ends: 543 [2024-11-08 16:26:43,436 INFO L226 Difference]: Without dead ends: 541 [2024-11-08 16:26:43,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:26:43,437 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 225 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:43,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 522 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:26:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-08 16:26:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 527. [2024-11-08 16:26:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 478 states have (on average 1.3619246861924685) internal successors, (651), 479 states have internal predecessors, (651), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:26:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 735 transitions. [2024-11-08 16:26:43,514 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 735 transitions. Word has length 113 [2024-11-08 16:26:43,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:43,515 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 735 transitions. [2024-11-08 16:26:43,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 735 transitions. [2024-11-08 16:26:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 16:26:43,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:43,517 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:43,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 16:26:43,517 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:43,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:43,517 INFO L85 PathProgramCache]: Analyzing trace with hash -989920471, now seen corresponding path program 1 times [2024-11-08 16:26:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:43,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64914541] [2024-11-08 16:26:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:43,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:45,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:45,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64914541] [2024-11-08 16:26:45,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64914541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:45,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:45,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:26:45,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716784288] [2024-11-08 16:26:45,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:45,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:26:45,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:45,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:26:45,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:26:45,967 INFO L87 Difference]: Start difference. First operand 527 states and 735 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 16:26:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:47,112 INFO L93 Difference]: Finished difference Result 944 states and 1323 transitions. [2024-11-08 16:26:47,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:26:47,113 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2024-11-08 16:26:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:47,116 INFO L225 Difference]: With dead ends: 944 [2024-11-08 16:26:47,116 INFO L226 Difference]: Without dead ends: 553 [2024-11-08 16:26:47,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:26:47,118 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 341 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:47,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 556 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:26:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-08 16:26:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 527. [2024-11-08 16:26:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 478 states have (on average 1.3598326359832635) internal successors, (650), 479 states have internal predecessors, (650), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:26:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 734 transitions. [2024-11-08 16:26:47,213 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 734 transitions. Word has length 113 [2024-11-08 16:26:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:47,214 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 734 transitions. [2024-11-08 16:26:47,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 16:26:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 734 transitions. [2024-11-08 16:26:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 16:26:47,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:47,216 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:47,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 16:26:47,216 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:47,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:47,217 INFO L85 PathProgramCache]: Analyzing trace with hash 785086891, now seen corresponding path program 1 times [2024-11-08 16:26:47,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:47,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134981893] [2024-11-08 16:26:47,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:47,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:47,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:47,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134981893] [2024-11-08 16:26:47,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134981893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:47,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:47,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:26:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711044471] [2024-11-08 16:26:47,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:47,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:26:47,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:26:47,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:26:47,714 INFO L87 Difference]: Start difference. First operand 527 states and 734 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:48,174 INFO L93 Difference]: Finished difference Result 932 states and 1296 transitions. [2024-11-08 16:26:48,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:26:48,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2024-11-08 16:26:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:48,181 INFO L225 Difference]: With dead ends: 932 [2024-11-08 16:26:48,181 INFO L226 Difference]: Without dead ends: 541 [2024-11-08 16:26:48,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:26:48,183 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 225 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:48,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 371 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:26:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-08 16:26:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 527. [2024-11-08 16:26:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 478 states have (on average 1.3556485355648535) internal successors, (648), 479 states have internal predecessors, (648), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:26:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 732 transitions. [2024-11-08 16:26:48,265 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 732 transitions. Word has length 113 [2024-11-08 16:26:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:48,266 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 732 transitions. [2024-11-08 16:26:48,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 732 transitions. [2024-11-08 16:26:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 16:26:48,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:48,267 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:48,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 16:26:48,268 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:48,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:48,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1465145261, now seen corresponding path program 1 times [2024-11-08 16:26:48,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:48,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792660190] [2024-11-08 16:26:48,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:48,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:48,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:48,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792660190] [2024-11-08 16:26:48,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792660190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:48,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:48,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:26:48,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322812353] [2024-11-08 16:26:48,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:48,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:26:48,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:48,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:26:48,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:26:48,454 INFO L87 Difference]: Start difference. First operand 527 states and 732 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:48,552 INFO L93 Difference]: Finished difference Result 930 states and 1294 transitions. [2024-11-08 16:26:48,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:26:48,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2024-11-08 16:26:48,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:48,556 INFO L225 Difference]: With dead ends: 930 [2024-11-08 16:26:48,556 INFO L226 Difference]: Without dead ends: 539 [2024-11-08 16:26:48,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:26:48,557 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:48,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:26:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-08 16:26:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2024-11-08 16:26:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 490 states have (on average 1.346938775510204) internal successors, (660), 491 states have internal predecessors, (660), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:26:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 744 transitions. [2024-11-08 16:26:48,642 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 744 transitions. Word has length 113 [2024-11-08 16:26:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:48,642 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 744 transitions. [2024-11-08 16:26:48,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 744 transitions. [2024-11-08 16:26:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:26:48,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:48,644 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:48,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 16:26:48,644 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:48,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash -661242022, now seen corresponding path program 1 times [2024-11-08 16:26:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:48,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163060467] [2024-11-08 16:26:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:48,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:50,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:50,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163060467] [2024-11-08 16:26:50,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163060467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:50,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:50,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:26:50,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372474952] [2024-11-08 16:26:50,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:50,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:26:50,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:50,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:26:50,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:26:50,303 INFO L87 Difference]: Start difference. First operand 539 states and 744 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 16:26:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:51,039 INFO L93 Difference]: Finished difference Result 868 states and 1210 transitions. [2024-11-08 16:26:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:26:51,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-11-08 16:26:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:51,042 INFO L225 Difference]: With dead ends: 868 [2024-11-08 16:26:51,042 INFO L226 Difference]: Without dead ends: 565 [2024-11-08 16:26:51,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:26:51,044 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 278 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:51,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 391 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:26:51,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-08 16:26:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 547. [2024-11-08 16:26:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 498 states have (on average 1.3333333333333333) internal successors, (664), 499 states have internal predecessors, (664), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:26:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 748 transitions. [2024-11-08 16:26:51,129 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 748 transitions. Word has length 115 [2024-11-08 16:26:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:51,129 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 748 transitions. [2024-11-08 16:26:51,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 16:26:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 748 transitions. [2024-11-08 16:26:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 16:26:51,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:51,131 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:51,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 16:26:51,132 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:51,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1929884745, now seen corresponding path program 1 times [2024-11-08 16:26:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:51,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064301612] [2024-11-08 16:26:51,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:51,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:52,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:53,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:53,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:53,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:53,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:53,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:53,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:53,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:53,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:53,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:53,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:53,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:53,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064301612] [2024-11-08 16:26:53,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064301612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:53,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:53,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:26:53,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448114115] [2024-11-08 16:26:53,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:53,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:26:53,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:53,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:26:53,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:26:53,132 INFO L87 Difference]: Start difference. First operand 547 states and 748 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 16:26:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:53,992 INFO L93 Difference]: Finished difference Result 868 states and 1202 transitions. [2024-11-08 16:26:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:26:53,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2024-11-08 16:26:53,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:53,996 INFO L225 Difference]: With dead ends: 868 [2024-11-08 16:26:53,996 INFO L226 Difference]: Without dead ends: 565 [2024-11-08 16:26:53,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-08 16:26:53,998 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 190 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:53,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 525 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:26:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-08 16:26:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 551. [2024-11-08 16:26:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 502 states have (on average 1.3227091633466135) internal successors, (664), 503 states have internal predecessors, (664), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:26:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 748 transitions. [2024-11-08 16:26:54,078 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 748 transitions. Word has length 116 [2024-11-08 16:26:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:54,079 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 748 transitions. [2024-11-08 16:26:54,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 16:26:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 748 transitions. [2024-11-08 16:26:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 16:26:54,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:54,081 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:54,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 16:26:54,082 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:54,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:54,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1789343743, now seen corresponding path program 1 times [2024-11-08 16:26:54,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:54,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741959960] [2024-11-08 16:26:54,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:54,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:54,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:54,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741959960] [2024-11-08 16:26:54,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741959960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:54,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:54,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:26:54,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290253442] [2024-11-08 16:26:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:54,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:26:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:54,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:26:54,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:26:54,266 INFO L87 Difference]: Start difference. First operand 551 states and 748 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:54,399 INFO L93 Difference]: Finished difference Result 982 states and 1338 transitions. [2024-11-08 16:26:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:26:54,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 116 [2024-11-08 16:26:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:54,403 INFO L225 Difference]: With dead ends: 982 [2024-11-08 16:26:54,403 INFO L226 Difference]: Without dead ends: 567 [2024-11-08 16:26:54,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:26:54,405 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:54,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 665 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:26:54,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-11-08 16:26:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 555. [2024-11-08 16:26:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 506 states have (on average 1.3201581027667983) internal successors, (668), 507 states have internal predecessors, (668), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:26:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 752 transitions. [2024-11-08 16:26:54,505 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 752 transitions. Word has length 116 [2024-11-08 16:26:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:54,505 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 752 transitions. [2024-11-08 16:26:54,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:26:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 752 transitions. [2024-11-08 16:26:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 16:26:54,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:54,507 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:54,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 16:26:54,508 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:54,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash -576036777, now seen corresponding path program 1 times [2024-11-08 16:26:54,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:54,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669506500] [2024-11-08 16:26:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:54,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:56,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:56,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669506500] [2024-11-08 16:26:56,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669506500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:56,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:56,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:26:56,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611159436] [2024-11-08 16:26:56,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:56,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:26:56,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:56,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:26:56,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:26:56,339 INFO L87 Difference]: Start difference. First operand 555 states and 752 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 16:26:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:26:57,292 INFO L93 Difference]: Finished difference Result 841 states and 1151 transitions. [2024-11-08 16:26:57,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:26:57,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-11-08 16:26:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:26:57,296 INFO L225 Difference]: With dead ends: 841 [2024-11-08 16:26:57,296 INFO L226 Difference]: Without dead ends: 550 [2024-11-08 16:26:57,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:26:57,298 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 189 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:26:57,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 612 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:26:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-08 16:26:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 508. [2024-11-08 16:26:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 459 states have (on average 1.328976034858388) internal successors, (610), 460 states have internal predecessors, (610), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:26:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 694 transitions. [2024-11-08 16:26:57,394 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 694 transitions. Word has length 117 [2024-11-08 16:26:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:26:57,395 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 694 transitions. [2024-11-08 16:26:57,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 16:26:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 694 transitions. [2024-11-08 16:26:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 16:26:57,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:26:57,397 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:26:57,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 16:26:57,398 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:26:57,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:26:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1301959803, now seen corresponding path program 1 times [2024-11-08 16:26:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:26:57,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123837808] [2024-11-08 16:26:57,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:26:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:26:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:26:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:26:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:26:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:26:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:26:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:26:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:26:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:26:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:26:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:26:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:26:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:26:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:26:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:26:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:26:59,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:26:59,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123837808] [2024-11-08 16:26:59,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123837808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:26:59,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:26:59,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:26:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326358503] [2024-11-08 16:26:59,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:26:59,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:26:59,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:26:59,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:26:59,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:26:59,458 INFO L87 Difference]: Start difference. First operand 508 states and 694 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 16:27:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:00,184 INFO L93 Difference]: Finished difference Result 923 states and 1265 transitions. [2024-11-08 16:27:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:27:00,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-11-08 16:27:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:00,187 INFO L225 Difference]: With dead ends: 923 [2024-11-08 16:27:00,188 INFO L226 Difference]: Without dead ends: 514 [2024-11-08 16:27:00,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:27:00,190 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 103 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:00,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 503 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:27:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-08 16:27:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 508. [2024-11-08 16:27:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 459 states have (on average 1.326797385620915) internal successors, (609), 460 states have internal predecessors, (609), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:27:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 693 transitions. [2024-11-08 16:27:00,278 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 693 transitions. Word has length 118 [2024-11-08 16:27:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:00,279 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 693 transitions. [2024-11-08 16:27:00,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 16:27:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 693 transitions. [2024-11-08 16:27:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:27:00,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:00,281 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:00,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 16:27:00,282 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:00,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:00,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1727303555, now seen corresponding path program 1 times [2024-11-08 16:27:00,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:27:00,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853449808] [2024-11-08 16:27:00,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:27:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:27:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:27:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:27:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:27:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:27:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:27:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:27:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:27:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:27:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:27:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:27:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:27:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:27:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:27:01,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:27:01,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853449808] [2024-11-08 16:27:01,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853449808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:01,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:01,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 16:27:01,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815347984] [2024-11-08 16:27:01,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:01,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:27:01,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:27:01,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:27:01,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:27:01,919 INFO L87 Difference]: Start difference. First operand 508 states and 693 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:27:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:03,040 INFO L93 Difference]: Finished difference Result 803 states and 1099 transitions. [2024-11-08 16:27:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:27:03,043 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 119 [2024-11-08 16:27:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:03,046 INFO L225 Difference]: With dead ends: 803 [2024-11-08 16:27:03,046 INFO L226 Difference]: Without dead ends: 531 [2024-11-08 16:27:03,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2024-11-08 16:27:03,048 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 569 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:03,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 748 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:27:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-08 16:27:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 517. [2024-11-08 16:27:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 468 states have (on average 1.3205128205128205) internal successors, (618), 469 states have internal predecessors, (618), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:27:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 702 transitions. [2024-11-08 16:27:03,121 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 702 transitions. Word has length 119 [2024-11-08 16:27:03,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:03,121 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 702 transitions. [2024-11-08 16:27:03,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:27:03,122 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 702 transitions. [2024-11-08 16:27:03,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:27:03,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:03,123 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:03,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 16:27:03,123 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:03,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:03,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1546595387, now seen corresponding path program 1 times [2024-11-08 16:27:03,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:27:03,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075298309] [2024-11-08 16:27:03,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:03,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:27:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:27:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:27:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:27:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:27:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:27:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:27:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:27:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:27:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:27:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:27:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:27:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:27:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:27:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 16:27:03,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:27:03,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075298309] [2024-11-08 16:27:03,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075298309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:03,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:03,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:27:03,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772053700] [2024-11-08 16:27:03,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:03,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:27:03,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:27:03,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:27:03,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:27:03,610 INFO L87 Difference]: Start difference. First operand 517 states and 702 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:27:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:04,039 INFO L93 Difference]: Finished difference Result 870 states and 1186 transitions. [2024-11-08 16:27:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:27:04,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 119 [2024-11-08 16:27:04,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:04,042 INFO L225 Difference]: With dead ends: 870 [2024-11-08 16:27:04,043 INFO L226 Difference]: Without dead ends: 588 [2024-11-08 16:27:04,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:27:04,044 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 280 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:04,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 424 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:27:04,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-08 16:27:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 525. [2024-11-08 16:27:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 476 states have (on average 1.319327731092437) internal successors, (628), 477 states have internal predecessors, (628), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 16:27:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 712 transitions. [2024-11-08 16:27:04,139 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 712 transitions. Word has length 119 [2024-11-08 16:27:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:04,139 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 712 transitions. [2024-11-08 16:27:04,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 16:27:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 712 transitions. [2024-11-08 16:27:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 16:27:04,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:04,141 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:04,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 16:27:04,141 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:04,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1405413036, now seen corresponding path program 1 times [2024-11-08 16:27:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:27:04,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547436880] [2024-11-08 16:27:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:27:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:27:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:27:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:27:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:27:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:27:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:27:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:27:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:27:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:27:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:27:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:27:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:27:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:27:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-08 16:27:05,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:27:05,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547436880] [2024-11-08 16:27:05,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547436880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:27:05,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303410082] [2024-11-08 16:27:05,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:05,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:27:05,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:27:05,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:27:05,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d33a65-f150-434b-a85b-a9a4f4e620af/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:27:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:05,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-08 16:27:05,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:27:07,979 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-11-08 16:27:08,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 16:27:09,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 16:27:10,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:27:10,339 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-08 16:27:10,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-08 16:27:10,681 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-08 16:27:10,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 54 [2024-11-08 16:27:10,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:27:10,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:27:10,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:27:10,809 INFO L349 Elim1Store]: treesize reduction 46, result has 16.4 percent of original size [2024-11-08 16:27:10,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 80 [2024-11-08 16:27:10,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:27:10,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:27:10,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:27:10,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2024-11-08 16:27:11,152 INFO L349 Elim1Store]: treesize reduction 27, result has 40.0 percent of original size [2024-11-08 16:27:11,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 73 [2024-11-08 16:27:11,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:27:11,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:27:12,309 INFO L349 Elim1Store]: treesize reduction 840, result has 17.4 percent of original size [2024-11-08 16:27:12,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 39 case distinctions, treesize of input 133 treesize of output 377 [2024-11-08 16:31:54,655 WARN L286 SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 2408 DAG size of output: 2474 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:38:31,969 WARN L286 SmtUtils]: Spent 37.47s on a formula simplification. DAG size of input: 18951 DAG size of output: 18952 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)