./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:31:29,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:31:29,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:31:29,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:31:29,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:31:29,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:31:29,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:31:29,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:31:29,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:31:29,222 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:31:29,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:31:29,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:31:29,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:31:29,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:31:29,226 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:31:29,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:31:29,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:31:29,227 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:31:29,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:31:29,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:31:29,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:31:29,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:31:29,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:31:29,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:31:29,232 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:31:29,232 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:31:29,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:31:29,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:31:29,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:31:29,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:31:29,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:31:29,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:31:29,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:31:29,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:31:29,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:31:29,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:31:29,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:31:29,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:31:29,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:31:29,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:31:29,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:31:29,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:31:29,238 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 [2024-10-11 16:31:29,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:31:29,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:31:29,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:31:29,518 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:31:29,519 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:31:29,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-10-11 16:31:31,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:31:31,385 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:31:31,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-10-11 16:31:31,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9ebe5671/d60ba0069d4d418b8ed6492b8017178d/FLAG9e4e3e334 [2024-10-11 16:31:31,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9ebe5671/d60ba0069d4d418b8ed6492b8017178d [2024-10-11 16:31:31,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:31:31,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:31:31,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:31:31,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:31:31,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:31:31,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:31:31" (1/1) ... [2024-10-11 16:31:31,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb0741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:31, skipping insertion in model container [2024-10-11 16:31:31,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:31:31" (1/1) ... [2024-10-11 16:31:31,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:31:32,068 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i[44118,44131] [2024-10-11 16:31:32,093 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i[44660,44673] [2024-10-11 16:31:32,211 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i[56247,56260] [2024-10-11 16:31:32,212 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i[56368,56381] [2024-10-11 16:31:32,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:31:32,247 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:31:32,286 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i[44118,44131] [2024-10-11 16:31:32,288 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i[44660,44673] [2024-10-11 16:31:32,351 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i[56247,56260] [2024-10-11 16:31:32,352 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i[56368,56381] [2024-10-11 16:31:32,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:31:32,443 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:31:32,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32 WrapperNode [2024-10-11 16:31:32,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:31:32,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:31:32,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:31:32,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:31:32,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32" (1/1) ... [2024-10-11 16:31:32,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32" (1/1) ... [2024-10-11 16:31:32,590 INFO L138 Inliner]: procedures = 282, calls = 339, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1638 [2024-10-11 16:31:32,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:31:32,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:31:32,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:31:32,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:31:32,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32" (1/1) ... [2024-10-11 16:31:32,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32" (1/1) ... [2024-10-11 16:31:32,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32" (1/1) ... [2024-10-11 16:31:32,729 INFO L175 MemorySlicer]: Split 309 memory accesses to 4 slices as follows [2, 3, 34, 270]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 63 writes are split as follows [0, 2, 4, 57]. [2024-10-11 16:31:32,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32" (1/1) ... [2024-10-11 16:31:32,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32" (1/1) ... [2024-10-11 16:31:32,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32" (1/1) ... [2024-10-11 16:31:32,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32" (1/1) ... [2024-10-11 16:31:32,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32" (1/1) ... [2024-10-11 16:31:32,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32" (1/1) ... [2024-10-11 16:31:32,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:31:32,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:31:32,825 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:31:32,825 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:31:32,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32" (1/1) ... [2024-10-11 16:31:32,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:31:32,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:31:32,863 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:31:32,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:31:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:31:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:31:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:31:32,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:31:32,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 16:31:32,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:31:32,919 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-11 16:31:32,919 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-11 16:31:32,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:31:32,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:31:32,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:31:32,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 16:31:32,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:31:32,920 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:31:32,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:31:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:31:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:31:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 16:31:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:31:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:31:32,922 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-11 16:31:32,922 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-11 16:31:32,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:31:32,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:31:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:31:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 16:31:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-11 16:31:32,923 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-11 16:31:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:31:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:31:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:31:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 16:31:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:31:32,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:31:33,222 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:31:33,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:31:34,823 INFO L? ?]: Removed 364 outVars from TransFormulas that were not future-live. [2024-10-11 16:31:34,824 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:31:34,891 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:31:34,891 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-11 16:31:34,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:31:34 BoogieIcfgContainer [2024-10-11 16:31:34,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:31:34,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:31:34,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:31:34,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:31:34,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:31:31" (1/3) ... [2024-10-11 16:31:34,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250abcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:31:34, skipping insertion in model container [2024-10-11 16:31:34,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:31:32" (2/3) ... [2024-10-11 16:31:34,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250abcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:31:34, skipping insertion in model container [2024-10-11 16:31:34,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:31:34" (3/3) ... [2024-10-11 16:31:34,905 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-2.i [2024-10-11 16:31:34,922 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:31:34,922 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 16:31:35,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:31:35,016 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;@54ecc6c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:31:35,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 16:31:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 462 states, 438 states have (on average 1.6141552511415524) internal successors, (707), 442 states have internal predecessors, (707), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:31:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 16:31:35,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:35,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:35,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:35,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:35,038 INFO L85 PathProgramCache]: Analyzing trace with hash 123534520, now seen corresponding path program 1 times [2024-10-11 16:31:35,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:35,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529315884] [2024-10-11 16:31:35,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:35,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:35,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:35,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529315884] [2024-10-11 16:31:35,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529315884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:35,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:35,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:31:35,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422520513] [2024-10-11 16:31:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:35,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:31:35,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:35,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:31:35,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:31:35,319 INFO L87 Difference]: Start difference. First operand has 462 states, 438 states have (on average 1.6141552511415524) internal successors, (707), 442 states have internal predecessors, (707), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:35,409 INFO L93 Difference]: Finished difference Result 921 states and 1486 transitions. [2024-10-11 16:31:35,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:31:35,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 16:31:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:35,430 INFO L225 Difference]: With dead ends: 921 [2024-10-11 16:31:35,430 INFO L226 Difference]: Without dead ends: 458 [2024-10-11 16:31:35,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:31:35,447 INFO L432 NwaCegarLoop]: 647 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:35,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 647 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:31:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-11 16:31:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2024-10-11 16:31:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 435 states have (on average 1.4344827586206896) internal successors, (624), 439 states have internal predecessors, (624), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 654 transitions. [2024-10-11 16:31:35,532 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 654 transitions. Word has length 7 [2024-10-11 16:31:35,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:35,532 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 654 transitions. [2024-10-11 16:31:35,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:35,533 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 654 transitions. [2024-10-11 16:31:35,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 16:31:35,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:35,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:35,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:31:35,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:35,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:35,535 INFO L85 PathProgramCache]: Analyzing trace with hash 215496090, now seen corresponding path program 1 times [2024-10-11 16:31:35,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:35,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362451480] [2024-10-11 16:31:35,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:35,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:35,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:35,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362451480] [2024-10-11 16:31:35,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362451480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:35,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:35,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:31:35,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557823655] [2024-10-11 16:31:35,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:35,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:31:35,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:35,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:31:35,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:31:35,734 INFO L87 Difference]: Start difference. First operand 458 states and 654 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:35,986 INFO L93 Difference]: Finished difference Result 1141 states and 1637 transitions. [2024-10-11 16:31:35,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:31:35,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 16:31:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:35,992 INFO L225 Difference]: With dead ends: 1141 [2024-10-11 16:31:35,992 INFO L226 Difference]: Without dead ends: 894 [2024-10-11 16:31:35,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:31:35,994 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 602 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:35,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2059 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:31:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-10-11 16:31:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 460. [2024-10-11 16:31:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 437 states have (on average 1.4324942791762014) internal successors, (626), 441 states have internal predecessors, (626), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 656 transitions. [2024-10-11 16:31:36,028 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 656 transitions. Word has length 9 [2024-10-11 16:31:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:36,029 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 656 transitions. [2024-10-11 16:31:36,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 656 transitions. [2024-10-11 16:31:36,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 16:31:36,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:36,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:36,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:31:36,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:36,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1344700540, now seen corresponding path program 1 times [2024-10-11 16:31:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:36,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883341481] [2024-10-11 16:31:36,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:36,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:36,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:36,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883341481] [2024-10-11 16:31:36,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883341481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:36,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:31:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366622363] [2024-10-11 16:31:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:36,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:31:36,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:36,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:31:36,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:31:36,302 INFO L87 Difference]: Start difference. First operand 460 states and 656 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:36,432 INFO L93 Difference]: Finished difference Result 920 states and 1312 transitions. [2024-10-11 16:31:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:31:36,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-11 16:31:36,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:36,435 INFO L225 Difference]: With dead ends: 920 [2024-10-11 16:31:36,436 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 16:31:36,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:31:36,438 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 106 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:36,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1763 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:31:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 16:31:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 460. [2024-10-11 16:31:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 437 states have (on average 1.4164759725400458) internal successors, (619), 441 states have internal predecessors, (619), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 649 transitions. [2024-10-11 16:31:36,461 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 649 transitions. Word has length 64 [2024-10-11 16:31:36,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:36,462 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 649 transitions. [2024-10-11 16:31:36,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 649 transitions. [2024-10-11 16:31:36,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 16:31:36,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:36,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:36,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:31:36,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:36,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1049205422, now seen corresponding path program 1 times [2024-10-11 16:31:36,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:36,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253896652] [2024-10-11 16:31:36,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:36,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:36,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:36,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253896652] [2024-10-11 16:31:36,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253896652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:36,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:36,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:31:36,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896151546] [2024-10-11 16:31:36,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:36,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:31:36,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:36,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:31:36,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:31:36,669 INFO L87 Difference]: Start difference. First operand 460 states and 649 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:36,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:36,802 INFO L93 Difference]: Finished difference Result 869 states and 1220 transitions. [2024-10-11 16:31:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:31:36,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-11 16:31:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:36,805 INFO L225 Difference]: With dead ends: 869 [2024-10-11 16:31:36,805 INFO L226 Difference]: Without dead ends: 412 [2024-10-11 16:31:36,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:31:36,811 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 9 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:36,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1612 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:31:36,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-11 16:31:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-10-11 16:31:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 389 states have (on average 1.3856041131105399) internal successors, (539), 393 states have internal predecessors, (539), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 569 transitions. [2024-10-11 16:31:36,829 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 569 transitions. Word has length 64 [2024-10-11 16:31:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:36,831 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 569 transitions. [2024-10-11 16:31:36,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 569 transitions. [2024-10-11 16:31:36,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 16:31:36,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:36,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:36,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:31:36,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:36,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:36,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1873954576, now seen corresponding path program 1 times [2024-10-11 16:31:36,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:36,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620481082] [2024-10-11 16:31:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:36,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:37,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:37,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620481082] [2024-10-11 16:31:37,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620481082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:37,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:37,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:31:37,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460740708] [2024-10-11 16:31:37,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:37,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:31:37,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:37,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:31:37,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:31:37,339 INFO L87 Difference]: Start difference. First operand 412 states and 569 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:37,781 INFO L93 Difference]: Finished difference Result 826 states and 1143 transitions. [2024-10-11 16:31:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:31:37,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-11 16:31:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:37,785 INFO L225 Difference]: With dead ends: 826 [2024-10-11 16:31:37,785 INFO L226 Difference]: Without dead ends: 417 [2024-10-11 16:31:37,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:31:37,788 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 10 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:37,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2431 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:31:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-11 16:31:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2024-10-11 16:31:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 391 states have (on average 1.3836317135549872) internal successors, (541), 395 states have internal predecessors, (541), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:37,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 571 transitions. [2024-10-11 16:31:37,812 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 571 transitions. Word has length 64 [2024-10-11 16:31:37,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:37,812 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 571 transitions. [2024-10-11 16:31:37,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 571 transitions. [2024-10-11 16:31:37,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:31:37,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:37,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:37,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:31:37,814 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:37,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1439444555, now seen corresponding path program 1 times [2024-10-11 16:31:37,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:37,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049675542] [2024-10-11 16:31:37,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:37,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:38,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:38,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049675542] [2024-10-11 16:31:38,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049675542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:38,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:38,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:31:38,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479577358] [2024-10-11 16:31:38,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:38,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:31:38,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:38,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:31:38,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:31:38,171 INFO L87 Difference]: Start difference. First operand 414 states and 571 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:38,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:38,323 INFO L93 Difference]: Finished difference Result 825 states and 1139 transitions. [2024-10-11 16:31:38,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:31:38,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-11 16:31:38,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:38,326 INFO L225 Difference]: With dead ends: 825 [2024-10-11 16:31:38,326 INFO L226 Difference]: Without dead ends: 414 [2024-10-11 16:31:38,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:31:38,328 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 13 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:38,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1524 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:31:38,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-11 16:31:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2024-10-11 16:31:38,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 391 states have (on average 1.381074168797954) internal successors, (540), 395 states have internal predecessors, (540), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 570 transitions. [2024-10-11 16:31:38,342 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 570 transitions. Word has length 65 [2024-10-11 16:31:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:38,342 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 570 transitions. [2024-10-11 16:31:38,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 570 transitions. [2024-10-11 16:31:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:31:38,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:38,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:38,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:31:38,347 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:38,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:38,347 INFO L85 PathProgramCache]: Analyzing trace with hash -395161161, now seen corresponding path program 1 times [2024-10-11 16:31:38,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:38,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676384357] [2024-10-11 16:31:38,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:38,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:38,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:38,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:38,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676384357] [2024-10-11 16:31:38,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676384357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:38,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:38,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:31:38,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178464752] [2024-10-11 16:31:38,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:38,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:31:38,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:31:38,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:31:38,648 INFO L87 Difference]: Start difference. First operand 414 states and 570 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:39,014 INFO L93 Difference]: Finished difference Result 830 states and 1145 transitions. [2024-10-11 16:31:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:31:39,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-11 16:31:39,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:39,018 INFO L225 Difference]: With dead ends: 830 [2024-10-11 16:31:39,018 INFO L226 Difference]: Without dead ends: 419 [2024-10-11 16:31:39,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:31:39,020 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 10 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:39,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2917 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:31:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-11 16:31:39,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 418. [2024-10-11 16:31:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 395 states have (on average 1.379746835443038) internal successors, (545), 399 states have internal predecessors, (545), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 575 transitions. [2024-10-11 16:31:39,035 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 575 transitions. Word has length 65 [2024-10-11 16:31:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:39,037 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 575 transitions. [2024-10-11 16:31:39,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 575 transitions. [2024-10-11 16:31:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 16:31:39,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:39,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:39,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:31:39,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:39,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1465365099, now seen corresponding path program 1 times [2024-10-11 16:31:39,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:39,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931830292] [2024-10-11 16:31:39,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:39,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:39,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:39,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:39,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931830292] [2024-10-11 16:31:39,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931830292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:39,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:39,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:31:39,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491670954] [2024-10-11 16:31:39,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:39,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:31:39,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:39,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:31:39,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:31:39,308 INFO L87 Difference]: Start difference. First operand 418 states and 575 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:39,571 INFO L93 Difference]: Finished difference Result 836 states and 1152 transitions. [2024-10-11 16:31:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:31:39,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 16:31:39,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:39,575 INFO L225 Difference]: With dead ends: 836 [2024-10-11 16:31:39,576 INFO L226 Difference]: Without dead ends: 421 [2024-10-11 16:31:39,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:31:39,577 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 4 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:39,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1996 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 16:31:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-11 16:31:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-10-11 16:31:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 402 states have internal predecessors, (548), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 578 transitions. [2024-10-11 16:31:39,594 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 578 transitions. Word has length 66 [2024-10-11 16:31:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:39,595 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 578 transitions. [2024-10-11 16:31:39,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 578 transitions. [2024-10-11 16:31:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 16:31:39,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:39,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:39,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 16:31:39,597 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:39,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:39,597 INFO L85 PathProgramCache]: Analyzing trace with hash 55631932, now seen corresponding path program 1 times [2024-10-11 16:31:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:39,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277972784] [2024-10-11 16:31:39,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:39,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:39,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:39,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277972784] [2024-10-11 16:31:39,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277972784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:39,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:39,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:31:39,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889922926] [2024-10-11 16:31:39,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:39,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:31:39,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:39,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:31:39,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:31:39,986 INFO L87 Difference]: Start difference. First operand 421 states and 578 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:40,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:40,512 INFO L93 Difference]: Finished difference Result 852 states and 1174 transitions. [2024-10-11 16:31:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 16:31:40,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 16:31:40,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:40,515 INFO L225 Difference]: With dead ends: 852 [2024-10-11 16:31:40,516 INFO L226 Difference]: Without dead ends: 434 [2024-10-11 16:31:40,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:31:40,517 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 30 mSDsluCounter, 3397 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3936 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:40,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3936 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:31:40,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-11 16:31:40,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2024-10-11 16:31:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.3774509803921569) internal successors, (562), 412 states have internal predecessors, (562), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 592 transitions. [2024-10-11 16:31:40,535 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 592 transitions. Word has length 66 [2024-10-11 16:31:40,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:40,535 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 592 transitions. [2024-10-11 16:31:40,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 592 transitions. [2024-10-11 16:31:40,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 16:31:40,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:40,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:40,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 16:31:40,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:40,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:40,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1668302933, now seen corresponding path program 1 times [2024-10-11 16:31:40,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:40,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628200889] [2024-10-11 16:31:40,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:40,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628200889] [2024-10-11 16:31:40,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628200889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:40,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:40,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:31:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806168766] [2024-10-11 16:31:40,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:40,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:31:40,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:40,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:31:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:31:40,994 INFO L87 Difference]: Start difference. First operand 431 states and 592 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:41,414 INFO L93 Difference]: Finished difference Result 862 states and 1186 transitions. [2024-10-11 16:31:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:31:41,415 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 16:31:41,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:41,417 INFO L225 Difference]: With dead ends: 862 [2024-10-11 16:31:41,417 INFO L226 Difference]: Without dead ends: 434 [2024-10-11 16:31:41,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:31:41,419 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 23 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:41,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3447 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:31:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-11 16:31:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2024-10-11 16:31:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 411 states have (on average 1.3746958637469586) internal successors, (565), 415 states have internal predecessors, (565), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 595 transitions. [2024-10-11 16:31:41,432 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 595 transitions. Word has length 66 [2024-10-11 16:31:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:41,432 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 595 transitions. [2024-10-11 16:31:41,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 595 transitions. [2024-10-11 16:31:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 16:31:41,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:41,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:41,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 16:31:41,434 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:41,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:41,435 INFO L85 PathProgramCache]: Analyzing trace with hash -267751346, now seen corresponding path program 1 times [2024-10-11 16:31:41,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:41,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11707726] [2024-10-11 16:31:41,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:41,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:41,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11707726] [2024-10-11 16:31:41,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11707726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:41,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:41,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:31:41,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380420482] [2024-10-11 16:31:41,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:41,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:31:41,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:41,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:31:41,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:31:41,752 INFO L87 Difference]: Start difference. First operand 434 states and 595 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:42,140 INFO L93 Difference]: Finished difference Result 870 states and 1195 transitions. [2024-10-11 16:31:42,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:31:42,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-11 16:31:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:42,143 INFO L225 Difference]: With dead ends: 870 [2024-10-11 16:31:42,143 INFO L226 Difference]: Without dead ends: 439 [2024-10-11 16:31:42,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:31:42,145 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 9 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2923 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:42,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2923 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:31:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-10-11 16:31:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 434. [2024-10-11 16:31:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 411 states have (on average 1.3746958637469586) internal successors, (565), 415 states have internal predecessors, (565), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 595 transitions. [2024-10-11 16:31:42,157 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 595 transitions. Word has length 67 [2024-10-11 16:31:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:42,158 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 595 transitions. [2024-10-11 16:31:42,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 595 transitions. [2024-10-11 16:31:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 16:31:42,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:42,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:42,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 16:31:42,159 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:42,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1004481798, now seen corresponding path program 1 times [2024-10-11 16:31:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:42,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701440170] [2024-10-11 16:31:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:42,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:42,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701440170] [2024-10-11 16:31:42,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701440170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:42,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:42,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:31:42,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539235823] [2024-10-11 16:31:42,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:42,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:31:42,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:42,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:31:42,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:31:42,659 INFO L87 Difference]: Start difference. First operand 434 states and 595 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:43,737 INFO L93 Difference]: Finished difference Result 1258 states and 1737 transitions. [2024-10-11 16:31:43,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:43,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-11 16:31:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:43,742 INFO L225 Difference]: With dead ends: 1258 [2024-10-11 16:31:43,742 INFO L226 Difference]: Without dead ends: 827 [2024-10-11 16:31:43,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-11 16:31:43,743 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 646 mSDsluCounter, 2941 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:43,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 3520 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 16:31:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-10-11 16:31:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 465. [2024-10-11 16:31:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 446 states have internal predecessors, (596), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 626 transitions. [2024-10-11 16:31:43,762 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 626 transitions. Word has length 67 [2024-10-11 16:31:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:43,762 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 626 transitions. [2024-10-11 16:31:43,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 626 transitions. [2024-10-11 16:31:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 16:31:43,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:43,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:43,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 16:31:43,764 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:43,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:43,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1868095393, now seen corresponding path program 1 times [2024-10-11 16:31:43,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:43,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493375030] [2024-10-11 16:31:43,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:43,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:44,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:44,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493375030] [2024-10-11 16:31:44,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493375030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:44,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:44,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:31:44,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225148861] [2024-10-11 16:31:44,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:44,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:31:44,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:44,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:31:44,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:31:44,025 INFO L87 Difference]: Start difference. First operand 465 states and 626 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:44,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:44,342 INFO L93 Difference]: Finished difference Result 906 states and 1232 transitions. [2024-10-11 16:31:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 16:31:44,343 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-11 16:31:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:44,345 INFO L225 Difference]: With dead ends: 906 [2024-10-11 16:31:44,346 INFO L226 Difference]: Without dead ends: 475 [2024-10-11 16:31:44,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:31:44,347 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 16 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3012 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:44,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3012 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:31:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-10-11 16:31:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 468. [2024-10-11 16:31:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 445 states have (on average 1.348314606741573) internal successors, (600), 449 states have internal predecessors, (600), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 630 transitions. [2024-10-11 16:31:44,364 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 630 transitions. Word has length 68 [2024-10-11 16:31:44,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:44,364 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 630 transitions. [2024-10-11 16:31:44,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:44,364 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 630 transitions. [2024-10-11 16:31:44,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 16:31:44,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:44,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:44,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 16:31:44,366 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:44,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash -289631099, now seen corresponding path program 1 times [2024-10-11 16:31:44,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737273417] [2024-10-11 16:31:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:44,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:44,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:44,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737273417] [2024-10-11 16:31:44,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737273417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:44,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:44,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:31:44,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395346316] [2024-10-11 16:31:44,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:44,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:31:44,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:44,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:31:44,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:31:44,631 INFO L87 Difference]: Start difference. First operand 468 states and 630 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:45,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:45,231 INFO L93 Difference]: Finished difference Result 912 states and 1240 transitions. [2024-10-11 16:31:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:45,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-11 16:31:45,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:45,234 INFO L225 Difference]: With dead ends: 912 [2024-10-11 16:31:45,234 INFO L226 Difference]: Without dead ends: 478 [2024-10-11 16:31:45,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:31:45,236 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 26 mSDsluCounter, 3329 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3872 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:45,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3872 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:31:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-11 16:31:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 468. [2024-10-11 16:31:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 445 states have (on average 1.348314606741573) internal successors, (600), 449 states have internal predecessors, (600), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 630 transitions. [2024-10-11 16:31:45,255 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 630 transitions. Word has length 68 [2024-10-11 16:31:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:45,255 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 630 transitions. [2024-10-11 16:31:45,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 630 transitions. [2024-10-11 16:31:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 16:31:45,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:45,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:45,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 16:31:45,258 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:45,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:45,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1391773950, now seen corresponding path program 1 times [2024-10-11 16:31:45,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:45,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425890354] [2024-10-11 16:31:45,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:45,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:45,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:45,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425890354] [2024-10-11 16:31:45,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425890354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:45,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:45,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:31:45,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204433735] [2024-10-11 16:31:45,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:45,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:31:45,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:45,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:31:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:31:45,561 INFO L87 Difference]: Start difference. First operand 468 states and 630 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:46,041 INFO L93 Difference]: Finished difference Result 918 states and 1249 transitions. [2024-10-11 16:31:46,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:46,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-11 16:31:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:46,044 INFO L225 Difference]: With dead ends: 918 [2024-10-11 16:31:46,044 INFO L226 Difference]: Without dead ends: 484 [2024-10-11 16:31:46,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 16:31:46,047 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 19 mSDsluCounter, 3408 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3953 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:46,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3953 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:31:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-11 16:31:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 478. [2024-10-11 16:31:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 455 states have (on average 1.3450549450549452) internal successors, (612), 459 states have internal predecessors, (612), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 642 transitions. [2024-10-11 16:31:46,097 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 642 transitions. Word has length 69 [2024-10-11 16:31:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:46,098 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 642 transitions. [2024-10-11 16:31:46,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 642 transitions. [2024-10-11 16:31:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 16:31:46,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:46,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:46,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 16:31:46,100 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:46,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1073237862, now seen corresponding path program 1 times [2024-10-11 16:31:46,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:46,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173064774] [2024-10-11 16:31:46,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:46,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:46,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:46,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173064774] [2024-10-11 16:31:46,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173064774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:46,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:46,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:31:46,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745042559] [2024-10-11 16:31:46,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:46,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:31:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:46,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:31:46,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:31:46,469 INFO L87 Difference]: Start difference. First operand 478 states and 642 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:47,063 INFO L93 Difference]: Finished difference Result 938 states and 1273 transitions. [2024-10-11 16:31:47,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:47,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-11 16:31:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:47,069 INFO L225 Difference]: With dead ends: 938 [2024-10-11 16:31:47,070 INFO L226 Difference]: Without dead ends: 494 [2024-10-11 16:31:47,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:31:47,071 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 13 mSDsluCounter, 3856 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4387 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:47,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4387 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:31:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-10-11 16:31:47,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 481. [2024-10-11 16:31:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 458 states have (on average 1.3449781659388647) internal successors, (616), 462 states have internal predecessors, (616), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 646 transitions. [2024-10-11 16:31:47,089 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 646 transitions. Word has length 69 [2024-10-11 16:31:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:47,090 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 646 transitions. [2024-10-11 16:31:47,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 646 transitions. [2024-10-11 16:31:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 16:31:47,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:47,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:47,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 16:31:47,091 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:47,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:47,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1723676698, now seen corresponding path program 1 times [2024-10-11 16:31:47,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:47,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939951000] [2024-10-11 16:31:47,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:47,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:47,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939951000] [2024-10-11 16:31:47,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939951000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:47,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:47,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:31:47,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561551119] [2024-10-11 16:31:47,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:47,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:31:47,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:47,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:31:47,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:31:47,450 INFO L87 Difference]: Start difference. First operand 481 states and 646 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:47,773 INFO L93 Difference]: Finished difference Result 933 states and 1263 transitions. [2024-10-11 16:31:47,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:31:47,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-11 16:31:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:47,777 INFO L225 Difference]: With dead ends: 933 [2024-10-11 16:31:47,777 INFO L226 Difference]: Without dead ends: 486 [2024-10-11 16:31:47,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:31:47,779 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 7 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2947 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:47,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2947 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:31:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-10-11 16:31:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 481. [2024-10-11 16:31:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 458 states have (on average 1.3427947598253276) internal successors, (615), 462 states have internal predecessors, (615), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 645 transitions. [2024-10-11 16:31:47,799 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 645 transitions. Word has length 69 [2024-10-11 16:31:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:47,799 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 645 transitions. [2024-10-11 16:31:47,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 645 transitions. [2024-10-11 16:31:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 16:31:47,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:47,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:47,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 16:31:47,801 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:47,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash -958619597, now seen corresponding path program 1 times [2024-10-11 16:31:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:47,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437514331] [2024-10-11 16:31:47,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:48,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:48,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:48,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437514331] [2024-10-11 16:31:48,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437514331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:48,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:48,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:31:48,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90238872] [2024-10-11 16:31:48,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:48,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:31:48,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:48,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:31:48,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:31:48,045 INFO L87 Difference]: Start difference. First operand 481 states and 645 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:48,406 INFO L93 Difference]: Finished difference Result 931 states and 1261 transitions. [2024-10-11 16:31:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:31:48,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-11 16:31:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:48,410 INFO L225 Difference]: With dead ends: 931 [2024-10-11 16:31:48,410 INFO L226 Difference]: Without dead ends: 484 [2024-10-11 16:31:48,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:31:48,412 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 4 mSDsluCounter, 2363 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:48,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2906 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:31:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-11 16:31:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2024-10-11 16:31:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 461 states have (on average 1.3405639913232104) internal successors, (618), 465 states have internal predecessors, (618), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 648 transitions. [2024-10-11 16:31:48,428 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 648 transitions. Word has length 69 [2024-10-11 16:31:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:48,429 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 648 transitions. [2024-10-11 16:31:48,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 648 transitions. [2024-10-11 16:31:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:31:48,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:48,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:48,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 16:31:48,430 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:48,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash 710707364, now seen corresponding path program 1 times [2024-10-11 16:31:48,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:48,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355831148] [2024-10-11 16:31:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:48,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:48,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355831148] [2024-10-11 16:31:48,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355831148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:48,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:48,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:31:48,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040312592] [2024-10-11 16:31:48,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:48,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:31:48,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:48,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:31:48,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:31:48,852 INFO L87 Difference]: Start difference. First operand 484 states and 648 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:49,356 INFO L93 Difference]: Finished difference Result 946 states and 1280 transitions. [2024-10-11 16:31:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:49,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-11 16:31:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:49,360 INFO L225 Difference]: With dead ends: 946 [2024-10-11 16:31:49,360 INFO L226 Difference]: Without dead ends: 496 [2024-10-11 16:31:49,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:31:49,361 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 9 mSDsluCounter, 3371 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3913 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:49,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3913 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:31:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-11 16:31:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 488. [2024-10-11 16:31:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 465 states have (on average 1.3397849462365592) internal successors, (623), 469 states have internal predecessors, (623), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 653 transitions. [2024-10-11 16:31:49,376 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 653 transitions. Word has length 70 [2024-10-11 16:31:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:49,376 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 653 transitions. [2024-10-11 16:31:49,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 653 transitions. [2024-10-11 16:31:49,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:31:49,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:49,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:49,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 16:31:49,378 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:49,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:49,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1655686255, now seen corresponding path program 1 times [2024-10-11 16:31:49,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:49,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564806158] [2024-10-11 16:31:49,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:49,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:49,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:49,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564806158] [2024-10-11 16:31:49,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564806158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:49,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:49,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 16:31:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943689679] [2024-10-11 16:31:49,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:49,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:31:49,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:49,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:31:49,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:31:49,711 INFO L87 Difference]: Start difference. First operand 488 states and 653 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:50,238 INFO L93 Difference]: Finished difference Result 955 states and 1290 transitions. [2024-10-11 16:31:50,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:50,239 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-11 16:31:50,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:50,242 INFO L225 Difference]: With dead ends: 955 [2024-10-11 16:31:50,242 INFO L226 Difference]: Without dead ends: 501 [2024-10-11 16:31:50,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:31:50,244 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 36 mSDsluCounter, 3878 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4417 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:50,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4417 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:31:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-11 16:31:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 491. [2024-10-11 16:31:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 468 states have (on average 1.3376068376068375) internal successors, (626), 472 states have internal predecessors, (626), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 656 transitions. [2024-10-11 16:31:50,265 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 656 transitions. Word has length 70 [2024-10-11 16:31:50,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:50,266 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 656 transitions. [2024-10-11 16:31:50,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 656 transitions. [2024-10-11 16:31:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:31:50,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:50,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:50,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 16:31:50,267 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:50,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:50,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1604752520, now seen corresponding path program 1 times [2024-10-11 16:31:50,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:50,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719781821] [2024-10-11 16:31:50,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:50,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:50,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:50,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719781821] [2024-10-11 16:31:50,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719781821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:50,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:50,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:31:50,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744965687] [2024-10-11 16:31:50,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:50,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:31:50,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:50,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:31:50,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:31:50,815 INFO L87 Difference]: Start difference. First operand 491 states and 656 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:55,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 16:31:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:55,625 INFO L93 Difference]: Finished difference Result 952 states and 1284 transitions. [2024-10-11 16:31:55,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:55,625 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-11 16:31:55,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:55,628 INFO L225 Difference]: With dead ends: 952 [2024-10-11 16:31:55,628 INFO L226 Difference]: Without dead ends: 495 [2024-10-11 16:31:55,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-11 16:31:55,630 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 31 mSDsluCounter, 3306 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3842 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:55,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3842 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 660 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 16:31:55,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-11 16:31:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 492. [2024-10-11 16:31:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 469 states have (on average 1.3368869936034116) internal successors, (627), 473 states have internal predecessors, (627), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 657 transitions. [2024-10-11 16:31:55,647 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 657 transitions. Word has length 70 [2024-10-11 16:31:55,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:55,647 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 657 transitions. [2024-10-11 16:31:55,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 657 transitions. [2024-10-11 16:31:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:31:55,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:55,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:55,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 16:31:55,649 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:55,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash -231710400, now seen corresponding path program 1 times [2024-10-11 16:31:55,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:55,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467818945] [2024-10-11 16:31:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:55,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:55,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:31:55,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:55,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467818945] [2024-10-11 16:31:55,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467818945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:55,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:31:55,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:31:55,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160494028] [2024-10-11 16:31:55,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:55,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:31:55,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:55,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:31:55,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:31:55,892 INFO L87 Difference]: Start difference. First operand 492 states and 657 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:56,463 INFO L93 Difference]: Finished difference Result 959 states and 1293 transitions. [2024-10-11 16:31:56,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:56,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-11 16:31:56,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:56,468 INFO L225 Difference]: With dead ends: 959 [2024-10-11 16:31:56,468 INFO L226 Difference]: Without dead ends: 501 [2024-10-11 16:31:56,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:31:56,470 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 22 mSDsluCounter, 3329 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3872 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:56,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3872 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:31:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-11 16:31:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 489. [2024-10-11 16:31:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 466 states have (on average 1.3390557939914163) internal successors, (624), 470 states have internal predecessors, (624), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:31:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 654 transitions. [2024-10-11 16:31:56,487 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 654 transitions. Word has length 70 [2024-10-11 16:31:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:56,488 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 654 transitions. [2024-10-11 16:31:56,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:31:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 654 transitions. [2024-10-11 16:31:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:31:56,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:56,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:56,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 16:31:56,489 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-11 16:31:56,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash -834701604, now seen corresponding path program 1 times [2024-10-11 16:31:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:56,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545978969] [2024-10-11 16:31:56,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:56,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:32:20,560 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 16:32:24,569 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2024-10-11 16:32:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:32:31,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:32:31,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545978969] [2024-10-11 16:32:31,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545978969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:32:31,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:32:31,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 16:32:31,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057122210] [2024-10-11 16:32:31,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:32:31,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:32:31,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:32:31,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:32:31,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=70, Unknown=3, NotChecked=16, Total=110 [2024-10-11 16:32:31,189 INFO L87 Difference]: Start difference. First operand 489 states and 654 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:32:35,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 16:32:39,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 16:32:42,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 16:32:46,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 16:32:50,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 16:32:54,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 16:32:58,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []